Class LPCanonicalProblem1

  • All Implemented Interfaces:
    LPProblem, ConstrainedOptimProblem, OptimProblem

    public class LPCanonicalProblem1
    extends LPProblemImpl1
    This is a linear programming problem in the 1st canonical form (following the convention in the reference):
    min c'x
    s.t.
    
     A * x ≥ b,
     x ≥ 0
     
    b ≤ 0 if the problem is feasible
    • Constructor Detail

      • LPCanonicalProblem1

        public LPCanonicalProblem1​(Vector c,
                                   Matrix A,
                                   Vector b)
        Construct a linear programming problem in the canonical form.
        Parameters:
        c - the objective function
        A - the coefficients, A, of the greater-than-or-equal-to constraints A * x ≥ b
        b - the values, b, of the greater-than-or-equal-to constraints A * x ≥ b
      • LPCanonicalProblem1

        public LPCanonicalProblem1​(Vector cost,
                                   LinearGreaterThanConstraints greater)
        Construct a linear programming problem in the canonical form.
        Parameters:
        cost - the objective function
        greater - a collection of greater-than-or-equal-to constraints
      • LPCanonicalProblem1

        public LPCanonicalProblem1​(LPCanonicalProblem2 problem)
        Convert a linear programming problem from the 2nd canonical form to the 1st canonical form.
        Parameters:
        problem - a linear programming problem in the 2nd canonical form
    • Method Detail

      • getGreaterThanConstraints

        public LinearGreaterThanConstraints getGreaterThanConstraints()
        Get the greater-than-or-equal-to constraints of the linear programming problem.
        Returns:
        the greater-than-or-equal-to constraints