dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.solution

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 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

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 λ. \[ u + \lambda v \]
ImmutableVector	v() When the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ. \[ u + \lambda v \] where u = minimizer().

Methods inherited from class dev.nm.solver.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 + \lambda 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 + \lambda 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