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

Class SimplexTable

java.lang.Object

com.numericalmethod.suanshu.datastructure.FlexibleTable

com.numericalmethod.suanshu.optimization.constrained.convex.sdp.socp.qp.lp.simplex.SimplexTable

All Implemented Interfaces:

Table, MatrixAccess, MatrixTable, MinimizationSolution<ImmutableVector>, java.io.Serializable

public class SimplexTable
extends FlexibleTable
implements MinimizationSolution<ImmutableVector>

This is a simplex table used to solve a linear programming problem using a simplex method.

See Also:

Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	SimplexTable.Label
static class	SimplexTable.LabelType

Field Summary

Fields

Modifier and Type	Field and Description
static SimplexTable.Label	ARTIFICIAL
static SimplexTable.Label	ARTIFICIAL_COST
static SimplexTable.Label	B
static SimplexTable.Label	COST
static SimplexTable.Label	UNDEFINED

Constructor Summary

Constructors

Constructor and Description
SimplexTable(CanonicalLPProblem1 problem) Construct a simplex table from a canonical linear programming problem.
SimplexTable(CanonicalLPProblem1 problem, double epsilon) Construct a simplex table from a canonical linear programming problem.
SimplexTable(LPProblem problem) Construct a simplex table from a general linear programming problem.
SimplexTable(LPProblem problem, double epsilon) Construct a simplex table from a general linear programming problem.
SimplexTable(SimplexTable table) Copy constructor.

Method Summary

Modifier and Type	Method and Description
double	getBCol(int i) Get the table entry at [i, B].
SimplexTable.Label	getColLabel(int i) Get the label for column i.
double	getCostRow(int j) Get the table entry at [COST, j].
int	getProblemSize() Get the number of variables in the problem or the cost/objective function.
SimplexTable.Label	getRowLabel(int i) Get the label for row i.
boolean	isFeasible() Check if this table is feasible.
ImmutableVector	minimizer() Get the minimizer (solution) to the minimization problem.
double	minimum() Get the (approximate) minimum found.
SimplexTable	swap(int r, int s) Perform a Jordan Exchange to swap row r with column s.

Methods inherited from class com.numericalmethod.suanshu.datastructure.FlexibleTable

addColAt, addColAt, addRowAt, addRowAt, deleteCol, deleteRow, equals, get, getColumn, getIndexFromColLabel, getIndexFromRowLabel, getRow, hashCode, nCols, nRows, renameCol, renameRow, set, toMatrix, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Field Detail

COST

public static final SimplexTable.Label COST

B

public static final SimplexTable.Label B

ARTIFICIAL_COST

public static final SimplexTable.Label ARTIFICIAL_COST

ARTIFICIAL

public static final SimplexTable.Label ARTIFICIAL

UNDEFINED

public static final SimplexTable.Label UNDEFINED

Constructor Detail

SimplexTable

public SimplexTable(CanonicalLPProblem1 problem,
                    double epsilon)

Construct a simplex table from a canonical linear programming problem.

Parameters:

problem - a canonical linear programming problem

epsilon - a precision parameter: when a number |x| ≤ ε, it is considered 0

SimplexTable

public SimplexTable(CanonicalLPProblem1 problem)

Construct a simplex table from a canonical linear programming problem.

Parameters:

problem - a canonical linear programming problem

SimplexTable

public SimplexTable(LPProblem problem,
                    double epsilon)

Construct a simplex table from a general linear programming problem.

Parameters:

problem - a general linear programming problem

epsilon - a precision parameter: when a number |x| ≤ ε, it is considered 0

SimplexTable

public SimplexTable(LPProblem problem)

Construct a simplex table from a general linear programming problem.

Parameters:

problem - a general linear programming problem

SimplexTable

public SimplexTable(SimplexTable table)

Copy constructor.

Parameters:

table - a simplex table

Method Detail

getColLabel

public SimplexTable.Label getColLabel(int i)

Description copied from class: FlexibleTable

Get the label for column i.

Overrides:

getColLabel in class FlexibleTable

Parameters:

i - a column index, counting from 1

Returns:

the label for column i

getRowLabel

public SimplexTable.Label getRowLabel(int i)

Description copied from class: FlexibleTable

Get the label for row i.

Overrides:

getRowLabel in class FlexibleTable

Parameters:

i - a row index, counting from 1

Returns:

the label for row i

getCostRow

public double getCostRow(int j)

Get the table entry at [COST, j].

Parameters:

j - a column index, counting from 1

Returns:

T[COST, j]

getBCol

public double getBCol(int i)

Get the table entry at [i, B].

Parameters:

i - a row index, counting from 1

Returns:

T[i, B]

getProblemSize

public int getProblemSize()

Get the number of variables in the problem or the cost/objective function.

Returns:

the number of variables

swap

public SimplexTable swap(int r,
                         int s)

Perform a Jordan Exchange to swap row r with column s.

Parameters:

r - the index to a entering variable (row)

s - the index to a leaving variable (column)

Returns:

a swapped simplex table

isFeasible

public boolean isFeasible()

Check if this table is feasible.

Returns:

true if the table is feasible

minimum

public double minimum()

Description copied from interface: MinimizationSolution

Get the (approximate) minimum found.

Specified by:

minimum in interface MinimizationSolution<ImmutableVector>

Returns:

the (approximate) minimum found

minimizer

public ImmutableVector minimizer()

Description copied from interface: MinimizationSolution

Get the minimizer (solution) to the minimization problem.

Specified by:

minimizer in interface MinimizationSolution<ImmutableVector>

Returns:

the minimizer