public class LPUnboundedMinimizerScheme2 extends LPUnboundedMinimizer
lambdaCol, table| Constructor and Description |
|---|
LPUnboundedMinimizerScheme2(SimplexTable table,
int lambdaCol)
Construct the solution for an unbounded linear programming problem as a result of applying scheme 2.
|
| Modifier and Type | Method and Description |
|---|---|
ImmutableVector |
minimizer()
This is the same as the u vector, such that the direction of arbitrarily negative can
be computed by adjusting λ.
|
ImmutableVector |
v()
When the problem is unbounded, the direction of arbitrarily negative can be computed by
adjusting λ.
|
getResultantTableau, minimumpublic LPUnboundedMinimizerScheme2(SimplexTable table, int lambdaCol)
table - the resultant simplex tablelambdaCol - the column indicating an unbounded solutionpublic ImmutableVector minimizer()
LPUnboundedMinimizeru + λv
minimizer in interface MinimizationSolution<Vector>minimizer in class LPUnboundedMinimizerpublic ImmutableVector v()
LPUnboundedMinimizeru + λvwhere
u = minimizer().
This is only meaningful in the case where the problem is unbounded.v in class LPUnboundedMinimizerCopyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.