Package dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem

Interface Summary

Interface	Description
LPProblem	A linear programming (LP) problem minimizes a linear objective function subject to a collection of linear constraints. \[ \min c'x \] s.t. \[ \begin{gathered} A \cdot x \ge b \\ Aeq \cdot x = beq \end{gathered} \] some x ≥ 0, some x are free.

Class Summary

Class	Description
LPCanonicalProblem1	This is a linear programming problem in the 1st canonical form (following the convention in the reference): \[ \min c'x \] s.t. \[ \begin{gathered} A \cdot x \ge b, \\ x \ge 0 \end{gathered} \] b ≤ 0 if the problem is feasible
LPCanonicalProblem2	This is a linear programming problem in the 2nd canonical form (following the convention in the wiki): \[ \min c'x \] s.t. \[ \begin{gathered} A \cdot x \le b, \\ x \ge 0 \end{gathered} \] b ≥ 0 if the problem is feasible
LPProblemImpl1	This is an implementation of a linear programming problem, LPProblem.
LPStandardProblem	This is a linear programming problem in the standard form: \[ \min c'x \] s.t. \[ \begin{gathered} A \cdot x = b, \\ x \ge 0 \end{gathered} \]