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

Class CanonicalLPProblem2

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.CanonicalLPProblem2

All Implemented Interfaces:

LPProblem, ConstrainedOptimProblem, OptimProblem, java.io.Serializable

public class CanonicalLPProblem2
extends LPProblemImpl1

This is a linear programming problem in the 2nd canonical form (following the convention in the wiki):

min c'x

s.t.

 A * x ≤ b,
 x ≥ 0
 

b ≥ 0 if the problem is feasible

See Also:

Wikipedia: Standard form, Serialized Form

Constructor Summary

Constructors

Constructor and Description
CanonicalLPProblem2(CanonicalLPProblem1 problem) Convert a linear programming problem from the 1st canonical form to the 2nd canonical form.
CanonicalLPProblem2(Vector cost, LinearLessThanConstraints less) Construct a linear programming problem in the canonical form.
CanonicalLPProblem2(Vector c, Matrix A, Vector b) Construct a linear programming problem in the canonical 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

CanonicalLPProblem2

public CanonicalLPProblem2(Vector c,
                           Matrix A,
                           Vector b)

Construct a linear programming problem in the canonical form.

Parameters:

c - c'x is the linear objective function to be minimized

A - the less-than inequality constraints A * x ≤ b

b - the less-than inequality values A * x ≤ b

CanonicalLPProblem2

public CanonicalLPProblem2(Vector cost,
                           LinearLessThanConstraints less)

Construct a linear programming problem in the canonical form.

Parameters:

cost - the objective function

less - a collection of less-than-or-equal-to constraints

CanonicalLPProblem2

public CanonicalLPProblem2(CanonicalLPProblem1 problem)

Convert a linear programming problem from the 1st canonical form to the 2nd canonical form.

Parameters:

problem - a linear programming problem in the 1st canonical form