com.numericalmethod.suanshu.optimization.constrained.linearprogramming.simplex.standard
Class LpBoundedSolution

java.lang.Object
  com.numericalmethod.suanshu.optimization.constrained.linearprogramming.simplex.standard.LpBoundedSolution

All Implemented Interfaces:

LpSolution

public class LpBoundedSolution
extends java.lang.Object
implements LpSolution

This class represents a solution to a bounded Linear Programming (LP) problem.

Note that there may be multiple solutions that give the same minimum. This class is designed to return all possible optimal solutions.

Constructor Summary

LpBoundedSolution(LpSolver phase2)
Construct the solution for a bounded LP problem.

Method Summary

double	min() Get the minimum.
ImmutableVector	minimizer() Get a minimizing vector.
ImmutableVector[]	minimizers() Get all the optimal minimizers.

Methods inherited from class java.lang.Object

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

Constructor Detail

LpBoundedSolution

public LpBoundedSolution(LpSolver phase2)

Construct the solution for a bounded LP problem.

Parameters:

phase2 - the solver that generates the solution

Method Detail

min

public double min()

Description copied from interface: LpSolution

Get the minimum.

Specified by:

min in interface LpSolution

Returns:

the minimum

minimizer

public ImmutableVector minimizer()

Description copied from interface: LpSolution

Get a minimizing vector.

In the case where the problem is unbounded, this minimizer is the same as the u vector on p.67 in "Michael C. Ferris, Olvi L. Mangasarian, Stephen J. Wright. "Linear Programming with MATLAB," Algorithm 3.1, Section 3, The Simplex Method."

Specified by:

minimizer in interface LpSolution

Returns:

a minimizing vector, as a solution to the Linear Programming problem

minimizers

public ImmutableVector[] minimizers()

Get all the optimal minimizers.

Returns:

all the optimal minimizers