Modifier and Type | Method and Description |
---|---|
SimplexTable |
FerrisMangasarianWrightPhase1.process()
Find a feasible table, if any.
|
SimplexTable |
FerrisMangasarianWrightScheme2.process()
Remove equalities and free variables, if possible.
|
SimplexTable |
SimplexTable.swap(int r,
int s)
Perform a Jordan Exchange to swap row
r with column s . |
Constructor and Description |
---|
FerrisMangasarianWrightPhase1(SimplexTable table)
Construct the phase 1 algorithm for an infeasible table corresponding to a non-standard linear programming problem, e.g., b ≥ 0.
|
FerrisMangasarianWrightScheme2(SimplexTable table)
Construct the scheme 2 algorithm for a table with equalities and free variables.
|
SimplexTable(SimplexTable table)
Copy constructor.
|
Modifier and Type | Method and Description |
---|---|
SimplexPivoting.Pivot |
SimplexPivoting.getPivot(SimplexTable table)
Get the next pivot.
|
SimplexPivoting.Pivot |
NaiveRule.getPivot(SimplexTable table) |
int |
SimplexPivoting.pricing(SimplexTable table)
This is pivot column selection (pricing) rule.
|
int |
SmallestSubscriptRule.pricing(SimplexTable table)
This is pivot column selection (pricing) rule.
|
int |
NaiveRule.pricing(SimplexTable table)
This is pivot column selection (pricing) rule.
|
int |
SimplexPivoting.ratioTest(SimplexTable table,
int s)
This is pivot row selection (Ratio test) rule.
|
int |
NaiveRule.ratioTest(SimplexTable table,
int s)
This is pivot row selection (Ratio test) rule.
|
Modifier and Type | Field and Description |
---|---|
protected SimplexTable |
LPUnboundedMinimizer.table |
Modifier and Type | Method and Description |
---|---|
SimplexTable |
LPBoundedMinimizer.getResultantTableau() |
SimplexTable |
LPUnboundedMinimizer.getResultantTableau() |
SimplexTable |
LPSimplexMinimizer.getResultantTableau()
Get the solution simplex table as a result of solving a linear programming problem.
|
Constructor and Description |
---|
LPBoundedMinimizer(SimplexTable table)
Constructs the solution for a bounded linear programming problem.
|
LPUnboundedMinimizer(SimplexTable table,
int lambdaCol)
Construct the solution for an unbounded linear programming problem.
|
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 |
---|---|
LPSimplexSolution |
FerrisMangasarianWrightPhase2.solve(SimplexTable table) |
LPSimplexSolution |
LPTwoPhaseSolver.solve(SimplexTable table) |
LPSimplexSolution |
LPSimplexSolver.solve(SimplexTable table)
Solve an LP problem by a simplex algorithm on a simplex table
|
Modifier and Type | Method and Description |
---|---|
SimplexTable |
GomoryMixedCutMinimizer.MyCutter.cut(SimplexTable table) |
SimplexTable |
SimplexCuttingPlaneMinimizer.CutterFactory.Cutter.cut(SimplexTable table)
Cut a simplex table.
|
SimplexTable |
GomoryPureCutMinimizer.MyCutter.cut(SimplexTable table) |
Modifier and Type | Method and Description |
---|---|
SimplexTable |
GomoryMixedCutMinimizer.MyCutter.cut(SimplexTable table) |
SimplexTable |
SimplexCuttingPlaneMinimizer.CutterFactory.Cutter.cut(SimplexTable table)
Cut a simplex table.
|
SimplexTable |
GomoryPureCutMinimizer.MyCutter.cut(SimplexTable table) |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.