Class FerrisMangasarianWrightPhase1
- java.lang.Object
-
- dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.simplex.FerrisMangasarianWrightPhase1
-
public class FerrisMangasarianWrightPhase1 extends Object
The phase 1 procedure finds a feasible table from an infeasible one by pivoting the simplex table of a related problem.
-
-
Constructor Summary
Constructors Constructor 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.
-
-
-
Constructor Detail
-
FerrisMangasarianWrightPhase1
public FerrisMangasarianWrightPhase1(SimplexTable table)
Construct the phase 1 algorithm for an infeasible table corresponding to a non-standard linear programming problem, e.g., b ≥ 0.- Parameters:
table
- an infeasible table
-
-
Method Detail
-
process
public SimplexTable process() throws LPInfeasible, Exception
Find a feasible table, if any.- Returns:
- a feasible table. If the original table is already feasible, return itself.
- Throws:
LPInfeasible
- if the linear programming problem is infeasibleException
- if any error
-
-