public class LPUnboundedMinimizer extends Object implements LPSimplexMinimizer
Modifier and Type | Field and Description |
---|---|
protected int |
lambdaCol |
protected SimplexTable |
table |
Constructor and Description |
---|
LPUnboundedMinimizer(SimplexTable table,
int lambdaCol)
Construct the solution for an unbounded linear programming problem.
|
Modifier and Type | Method and Description |
---|---|
SimplexTable |
getResultantTableau()
Get the solution simplex table as a result of solving a linear programming problem.
|
ImmutableVector |
minimizer()
This is the same as the u vector, such that the direction of arbitrarily negative can
be computed by adjusting λ.
|
double |
minimum()
Get the (approximate) minimum found.
|
ImmutableVector |
v()
When the problem is unbounded, the direction of arbitrarily negative can be computed by
adjusting λ.
|
protected final SimplexTable table
protected final int lambdaCol
public LPUnboundedMinimizer(SimplexTable table, int lambdaCol)
table
- the table of the current (intermediate) solution of a linear programming
problemlambdaCol
- the column index for which there is no row that passes the ratio test (hence
the problem is unbounded); when the problem is bounded, lambdaCol = 0
public SimplexTable getResultantTableau()
LPSimplexMinimizer
getResultantTableau
in interface LPSimplexMinimizer
public double minimum()
MinimizationSolution
minimum
in interface MinimizationSolution<Vector>
public ImmutableVector minimizer()
u + λv
minimizer
in interface MinimizationSolution<Vector>
public ImmutableVector v()
u + λvwhere
u = minimizer()
.
This is only meaningful in the case where the problem is unbounded.Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.