Class LPUnboundedMinimizer

    • Field Detail

      • lambdaCol

        protected final int lambdaCol
    • Constructor Detail

      • LPUnboundedMinimizer

        public LPUnboundedMinimizer​(SimplexTable table,
                                    int lambdaCol)
        Construct the solution for an unbounded linear programming problem.
        Parameters:
        table - the table of the current (intermediate) solution of a linear programming problem
        lambdaCol - the column index for which there is no row that passes the ratio test (hence the problem is unbounded); when the problem is bounded, lambdaCol = 0
    • Method Detail

      • getResultantTableau

        public SimplexTable getResultantTableau()
        Description copied from interface: LPSimplexMinimizer
        Get the solution simplex table as a result of solving a linear programming problem.
        Specified by:
        getResultantTableau in interface LPSimplexMinimizer
        Returns:
        the solution simplex table as a result of solving a linear programming problem
      • minimizer

        public ImmutableVector minimizer()
        This is the same as the u vector, such that the direction of arbitrarily negative can be computed by adjusting λ.
        u + λv
        Specified by:
        minimizer in interface MinimizationSolution<Vector>
        Returns:
        the u vector
      • v

        public ImmutableVector v()
        When the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ.
        u + λv
        where u = minimizer().

        This is only meaningful in the case where the problem is unbounded.

        Returns:
        the v vector