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

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

All Implemented Interfaces:

LpSolution

public class LpUnboundedSolution
extends java.lang.Object
implements LpSolution

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

Constructor Summary

LpUnboundedSolution(LpSolver phase2)
Construct the solution for an unbounded LP problem.

Method Summary

double	min() Get the minimum.
ImmutableVector	minimizer() This is the same as the u vector, such that the direction of arbitrarily negative can be computed by adjusting λ.
ImmutableVector	v() When the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ.

Methods inherited from class java.lang.Object

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

Constructor Detail

LpUnboundedSolution

public LpUnboundedSolution(LpSolver phase2)

Construct the solution for an unbounded 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()

This is the same as the u vector, such that the direction of arbitrarily negative can be computed by adjusting λ.

 u + λv
 

Specified by:

minimizer in interface LpSolution

Returns:

the u vector

v

public ImmutableVector v()

When the problem is unbounded, the direction of arbitrarily negative can be computed by adjusting λ.

 u + λv
 

u = minimizer()

This is only meaningful in the case where the problem is unbounded.

Returns:

the v vector