Catalano.Math.Optimization

Class LinearProgramming

java.lang.Object

Catalano.Math.Optimization.LinearProgramming

public class LinearProgramming
extends java.lang.Object

Linear Programming. Two Phase Method.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	LinearProgramming.Objective Objective of the function.

Field Summary

Fields

Modifier and Type	Field and Description
static int	INFEASIBLE The solution is infeasible.
static int	OPTIMAL The solution exists.
static int	UNBOUNDED The solution is unbounded.

Constructor Summary

Constructors

Constructor and Description
LinearProgramming(LinearProgramming.Objective objective) Linear Programming.

Method Summary

Modifier and Type	Method and Description
double[]	getCoefficients() Get coefficients.
int	getIterations() Number of iterations required to be converged.
double	getSolution() Get the final solution.
boolean	isInfinite() Check if the solution is infinite.
int	Solve(double[] function, java.util.List<Constraint> constraints) Solve the simplex problem.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

INFEASIBLE

public static final int INFEASIBLE

The solution is infeasible.

See Also:

Constant Field Values

OPTIMAL

public static final int OPTIMAL

The solution exists.

See Also:

Constant Field Values

UNBOUNDED

public static final int UNBOUNDED

The solution is unbounded.

See Also:

Constant Field Values

Constructor Detail

LinearProgramming

public LinearProgramming(LinearProgramming.Objective objective)

Linear Programming.

Parameters:

objective - Objective.

Method Detail

getIterations

public int getIterations()

Number of iterations required to be converged.

Returns:

Number of iterations.

getSolution

public double getSolution()

Get the final solution.

Returns:

Optimal objective value.

getCoefficients

public double[] getCoefficients()

Get coefficients.

Returns:

Coefficients.

isInfinite

public boolean isInfinite()

Check if the solution is infinite.

Returns:

True if exists one more solution, otherwise return false.

Solve

public int Solve(double[] function,
                 java.util.List<Constraint> constraints)

Solve the simplex problem.

Parameters:

function - Function.

constraints - List of constraints.

Returns:

Status of the solution.