# SuanShu, a Java numerical and statistical library

com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution

## Class LPUnboundedMinimizerScheme2

• ### Fields inherited from class com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution.LPUnboundedMinimizer

lambdaCol, table
• ### Constructor Summary

Constructors
Constructor and 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
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 λ.
• ### Methods inherited from class com.numericalmethod.suanshu.optimization.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution.LPUnboundedMinimizer

getResultantTableau, minimum
• ### Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
• ### 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 table
lambdaCol - the column indicating an unbounded solution
• ### Method Detail

• #### minimizer

public ImmutableVector minimizer()
Description copied from class: LPUnboundedMinimizer
This is the same as the u vector, such that the direction of arbitrarily negative can be computed by adjusting λ.
u + λv
Specified by:
minimizer in interface MinimizationSolution<Vector>
Overrides:
minimizer in class LPUnboundedMinimizer
Returns:
the u vector
• #### v

public ImmutableVector v()
Description copied from class: LPUnboundedMinimizer
When the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ.
u + λv
where u = minimizer().

This is only meaningful in the case where the problem is unbounded.

Overrides:
v in class LPUnboundedMinimizer
Returns:
the v vector