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

Class FerrisMangasarianWrightPhase1

java.lang.Object

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

All Implemented Interfaces:

java.io.Serializable

public class FerrisMangasarianWrightPhase1
extends java.lang.Object
implements java.io.Serializable

The phase 1 procedure finds a feasible table from an infeasible one by pivoting the simplex table of a related problem.

See Also:

"Michael C. Ferris, Olvi L. Mangasarian, Stephen J. Wright, "Algorithm 3.2, Section 3.4, The Phase I Procedure," Linear Programming with MATLAB.", Serialized Form

Constructor Summary

Constructors

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.

Method Summary

Modifier and Type	Method and Description
SimplexTable	process() Find a feasible table, if any.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

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,
                            java.lang.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 infeasible

java.lang.Exception - if any error