Class 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 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 infeasible
        Exception - if any error