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

Class LPStandardProblem

java.lang.Object

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

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

All Implemented Interfaces:

LPProblem, ConstrainedOptimProblem, OptimProblem

public class LPStandardProblem
extends LPProblemImpl1

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} \]

Constructor Summary

Constructors

Constructor and Description
LPStandardProblem(Vector c, LinearEqualityConstraints equal) Construct a linear programming problem in the standard form.

Method Summary

Methods inherited from class dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.lp.problem.LPProblemImpl1

A, Aeq, b, beq, c, dimension, f, getEqualityConstraints, getLessThanConstraints, isFree, nEqualities, nGreaterThanInequalities, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

LPStandardProblem

public LPStandardProblem(Vector c,
                         LinearEqualityConstraints equal)

Construct a linear programming problem in the standard form.

Parameters:

c - the objective function

equal - the equality constraints