Class PhasedSimplexSolver

  • All Implemented Interfaces:
    Optimisation, Optimisation.Solver, UpdatableSolver

    final class PhasedSimplexSolver
    extends SimplexSolver
    First runs the dual algorithm (with a possibly modified objective function) to establish feasibility, and then the primal to reach optimality.

    This is the primary sub-class of SimplexSolver and the one you would typically use. All the other sub-classes are primarily there to help with testing.

    • Method Detail

      • setup

        void setup​(SimplexStore simplex)
        Description copied from class: SimplexSolver
        • Determine if non-basic variables are at their lower or upper bound (or if they are unbounded)
        • Shift ranges/bounds so that (one of) the bound(s) is at zero
        • Assumes that the ranges/bounds of basic variables are already defined this way.
        Specified by:
        setup in class SimplexSolver