Class LPUnboundedMinimizerScheme2
- java.lang.Object
-
- dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution.LPUnboundedMinimizer
-
- dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution.LPUnboundedMinimizerScheme2
-
- All Implemented Interfaces:
MinimizationSolution<Vector>,LPMinimizer,LPSimplexMinimizer
public class LPUnboundedMinimizerScheme2 extends LPUnboundedMinimizer
This is the solution to an unbounded linear programming problem found in scheme 2.
-
-
Field Summary
-
Fields inherited from class dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution.LPUnboundedMinimizer
lambdaCol, table
-
-
Constructor Summary
Constructors Constructor Description LPUnboundedMinimizerScheme2(SimplexTable table, int lambdaCol)Construct the solution for an unbounded linear programming problem as a result of applying scheme 2.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description ImmutableVectorminimizer()This is the same as the u vector, such that the direction of arbitrarily negative can be computed by adjusting λ.ImmutableVectorv()When the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ.-
Methods inherited from class dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution.LPUnboundedMinimizer
getResultantTableau, minimum
-
-
-
-
Constructor Detail
-
LPUnboundedMinimizerScheme2
public LPUnboundedMinimizerScheme2(SimplexTable table, int lambdaCol)
Construct the solution for an unbounded linear programming problem as a result of applying scheme 2.- Parameters:
table- the resultant simplex tablelambdaCol- the column indicating an unbounded solution
-
-
Method Detail
-
minimizer
public ImmutableVector minimizer()
Description copied from class:LPUnboundedMinimizerThis is the same as the u vector, such that the direction of arbitrarily negative can be computed by adjusting λ.u + λv
- Specified by:
minimizerin interfaceMinimizationSolution<Vector>- Overrides:
minimizerin classLPUnboundedMinimizer- Returns:
- the u vector
-
v
public ImmutableVector v()
Description copied from class:LPUnboundedMinimizerWhen the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ.u + λv
whereu = minimizer(). This is only meaningful in the case where the problem is unbounded.- Overrides:
vin classLPUnboundedMinimizer- Returns:
- the v vector
-
-