public class LPCanonicalProblem2 extends LPProblemImpl1
min c'xs.t.
b ≥ 0 if the problem is feasibleA * x ≤ b, x ≥ 0
| Constructor and Description |
|---|
LPCanonicalProblem2(LPCanonicalProblem1 problem)
Convert a linear programming problem from the 1st canonical form to the 2nd canonical form.
|
LPCanonicalProblem2(Vector cost,
LinearLessThanConstraints less)
Construct a linear programming problem in the canonical form.
|
LPCanonicalProblem2(Vector c,
Matrix A,
Vector b)
Construct a linear programming problem in the canonical form.
|
A, Aeq, b, beq, c, dimension, f, getEqualityConstraints, getLessThanConstraints, isFree, nEqualities, nGreaterThanInequalities, toStringpublic LPCanonicalProblem2(Vector c, Matrix A, Vector b)
c - c'x is the linear objective function to be minimizedA - the less-than inequality constraints A * x ≤ bb - the less-than inequality values A * x ≤ bpublic LPCanonicalProblem2(Vector cost, LinearLessThanConstraints less)
cost - the objective functionless - a collection of less-than-or-equal-to constraintspublic LPCanonicalProblem2(LPCanonicalProblem1 problem)
problem - a linear programming problem in the 1st canonical formCopyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.