com.numericalmethod.suanshu.optimization.constrained.convex.sdp.socp.qp.lp.problem

Class StandardLPProblem

java.lang.Object

com.numericalmethod.suanshu.optimization.constrained.convex.sdp.socp.qp.lp.problem.LPProblemImpl1

com.numericalmethod.suanshu.optimization.constrained.convex.sdp.socp.qp.lp.problem.StandardLPProblem

All Implemented Interfaces:

LPProblem, ConstrainedOptimProblem, OptimProblem, java.io.Serializable

public class StandardLPProblem
extends LPProblemImpl1

This is a linear programming problem in the standard form:

min c'x

s.t.

 A * x = b,
 x ≥ 0
 

See Also:

Serialized Form

Constructor Summary

Constructors

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

Method Summary

Methods inherited from class com.numericalmethod.suanshu.optimization.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

StandardLPProblem

public StandardLPProblem(Vector c,
                         LinearEqualityConstraints equal)

Construct a linear programming problem in the standard form.

Parameters:

c - the objective function

equal - the equality constraints