|Constructor and Description|
Construct the solution for an unbounded linear programming problem as a result of applying scheme 2.
|Modifier and Type||Method and Description|
This is the same as the u vector, such that the direction of arbitrarily negative can be computed by adjusting λ.
When the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ.
public LPUnboundedMinimizerScheme2(SimplexTable table, int lambdaCol)
table- the resultant simplex table
lambdaCol- the column indicating an unbounded solution
public ImmutableVector minimizer()
u + λv
public ImmutableVector v()
u + λvwhere
u = minimizer(). This is only meaningful in the case where the problem is unbounded.
Copyright © 2010-2017 Numerical Method Incorporation Limited. All Rights Reserved.