public class LPCanonicalProblem1 extends LPProblemImpl1
min c'xs.t.
b ≤ 0 if the problem is feasibleA * x ≥ b, x ≥ 0
| Constructor and Description |
|---|
LPCanonicalProblem1(LPCanonicalProblem2 problem)
Convert a linear programming problem from the 2nd canonical form to the 1st canonical form.
|
LPCanonicalProblem1(Vector cost,
LinearGreaterThanConstraints greater)
Construct a linear programming problem in the canonical form.
|
LPCanonicalProblem1(Vector c,
Matrix A,
Vector b)
Construct a linear programming problem in the canonical form.
|
| Modifier and Type | Method and Description |
|---|---|
LinearGreaterThanConstraints |
getGreaterThanConstraints()
Get the greater-than-or-equal-to constraints of the linear programming problem.
|
A, Aeq, b, beq, c, dimension, f, getEqualityConstraints, getLessThanConstraints, isFree, nEqualities, nGreaterThanInequalities, toStringpublic LPCanonicalProblem1(Vector c, Matrix A, Vector b)
c - the objective functionA - the coefficients, A, of the greater-than-or-equal-to constraints A * x ≥ bb - the values, b, of the greater-than-or-equal-to constraints A * x ≥ bpublic LPCanonicalProblem1(Vector cost, LinearGreaterThanConstraints greater)
cost - the objective functiongreater - a collection of greater-than-or-equal-to constraintspublic LPCanonicalProblem1(LPCanonicalProblem2 problem)
problem - a linear programming problem in the 2nd canonical formpublic LinearGreaterThanConstraints getGreaterThanConstraints()
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.