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

Class CanonicalLPProblem1

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

All Implemented Interfaces:

LPProblem, ConstrainedOptimProblem, OptimProblem, java.io.Serializable

public class CanonicalLPProblem1
extends LPProblemImpl1

This is a linear programming problem in the 1st canonical form (following the convention in the reference):

min c'x

s.t.

 A * x ≥ b,
 x ≥ 0
 

b ≤ 0 if the problem is feasible

See Also:

"Michael C. Ferris, Olvi L. Mangasarian, Stephen J. Wright, "Eq. 3.1, Chapter 3, The Simplex Method," Linear Programming with MATLAB.", Serialized Form

Constructor Summary

Constructors

Constructor and Description
CanonicalLPProblem1(CanonicalLPProblem2 problem) Convert a linear programming problem from the 2nd canonical form to the 1st canonical form.
CanonicalLPProblem1(Vector cost, LinearGreaterThanConstraints greater) Construct a linear programming problem in the canonical form.
CanonicalLPProblem1(Vector c, Matrix A, Vector b) Construct a linear programming problem in the canonical form.

Method Summary

Modifier and Type	Method and Description
LinearGreaterThanConstraints	getGreaterThanConstraints() Get the greater-than-or-equal-to constraints of the linear programming problem.

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

CanonicalLPProblem1

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

Construct a linear programming problem in the canonical form.

Parameters:

c - the objective function

A - the coefficients, A, of the greater-than-or-equal-to constraints A * x ≥ b

b - the values, b, of the greater-than-or-equal-to constraints A * x ≥ b

CanonicalLPProblem1

public CanonicalLPProblem1(Vector cost,
                           LinearGreaterThanConstraints greater)

Construct a linear programming problem in the canonical form.

Parameters:

cost - the objective function

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

CanonicalLPProblem1

public CanonicalLPProblem1(CanonicalLPProblem2 problem)

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

Parameters:

problem - a linear programming problem in the 2nd canonical form

Method Detail

getGreaterThanConstraints

public LinearGreaterThanConstraints getGreaterThanConstraints()

Get the greater-than-or-equal-to constraints of the linear programming problem.

Returns:

the greater-than-or-equal-to constraints