SimplexSolverTest (Commons Math 3.2 Test API)

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

org.apache.commons.math3.optimization.linear
Class SimplexSolverTest

java.lang.Object
  org.apache.commons.math3.optimization.linear.SimplexSolverTest

public class SimplexSolverTest
extends Object
extends Object

Constructor Summary
`SimplexSolverTest()`

Method Summary
`void`	`testDegeneracy()`
`void`	`testEpsilon()`
`void`	`testInfeasibleSolution()`
`void`	`testLargeModel()`
`void`	`testMath272()`
`void`	`testMath286()`
`void`	`testMath288()`
`void`	`testMath290GEQ()`
`void`	`testMath290LEQ()`
`void`	`testMath293()`
`void`	`testMath434NegativeVariable()`
`void`	`testMath434PivotRowSelection()`
`void`	`testMath434PivotRowSelection2()`
`void`	`testMath434UnfeasibleSolution()`
`void`	`testMath713NegativeVariable()`
`void`	`testMath781()`
`void`	`testMath828()`
`void`	`testMath828Cycle()`
`void`	`testMinimization()`
`void`	`testModelWithNoArtificialVars()` With no artificial variables needed (no equals and no greater than constraints) we can go straight to Phase 2.
`void`	`testRestrictVariablesToNonNegative()`
`void`	`testSimplexSolver()`
`void`	`testSingleVariableAndConstraint()`
`void`	`testSolutionWithNegativeDecisionVariable()`
`void`	`testTrivialModel()`
`void`	`testUnboundedSolution()`

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Constructor Detail

SimplexSolverTest

public SimplexSolverTest()

Method Detail

testMath828

public void testMath828()

testMath828Cycle

public void testMath828Cycle()

testMath781

public void testMath781()

testMath713NegativeVariable

public void testMath713NegativeVariable()

testMath434NegativeVariable

public void testMath434NegativeVariable()

testMath434UnfeasibleSolution

public void testMath434UnfeasibleSolution()

testMath434PivotRowSelection

public void testMath434PivotRowSelection()

testMath434PivotRowSelection2

public void testMath434PivotRowSelection2()

testMath272

public void testMath272()

testMath286

public void testMath286()

testDegeneracy

public void testDegeneracy()

testMath288

public void testMath288()

testMath290GEQ

public void testMath290GEQ()

testMath290LEQ

public void testMath290LEQ()

testMath293

public void testMath293()

testSimplexSolver

public void testSimplexSolver()

testSingleVariableAndConstraint

public void testSingleVariableAndConstraint()

testModelWithNoArtificialVars

public void testModelWithNoArtificialVars()

With no artificial variables needed (no equals and no greater than constraints) we can go straight to Phase 2.

testMinimization

public void testMinimization()

testSolutionWithNegativeDecisionVariable

public void testSolutionWithNegativeDecisionVariable()

testInfeasibleSolution

public void testInfeasibleSolution()

testUnboundedSolution

public void testUnboundedSolution()

testRestrictVariablesToNonNegative

public void testRestrictVariablesToNonNegative()

testEpsilon

public void testEpsilon()

testTrivialModel

public void testTrivialModel()

testLargeModel

public void testLargeModel()