Uses of Class
dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem.LPProblemImpl1

Packages that use LPProblemImpl1

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

Uses of LPProblemImpl1 in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem

Subclasses of LPProblemImpl1 in dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem

Modifier and Type	Class and Description
class	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
class	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
class	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} \]