You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by lu...@apache.org on 2013/04/07 01:42:02 UTC
svn commit: r857558 [17/39] - in
/websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3:
./ analysis/ analysis/differentiation/ analysis/interpolation/ complex/
dfp/ distribution/ distribution/fitting/ ex...
Modified: websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3/optim/linear/SimplexSolverTest.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3/optim/linear/SimplexSolverTest.html (original)
+++ websites/production/commons/content/proper/commons-math/testapidocs/src-html/org/apache/commons/math3/optim/linear/SimplexSolverTest.html Sat Apr 6 23:42:01 2013
@@ -320,351 +320,462 @@
<FONT color="green">317</FONT> }<a name="line.317"></a>
<FONT color="green">318</FONT> <a name="line.318"></a>
<FONT color="green">319</FONT> @Test<a name="line.319"></a>
-<FONT color="green">320</FONT> public void testSimplexSolver() {<a name="line.320"></a>
-<FONT color="green">321</FONT> LinearObjectiveFunction f =<a name="line.321"></a>
-<FONT color="green">322</FONT> new LinearObjectiveFunction(new double[] { 15, 10 }, 7);<a name="line.322"></a>
-<FONT color="green">323</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.323"></a>
-<FONT color="green">324</FONT> constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2));<a name="line.324"></a>
-<FONT color="green">325</FONT> constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3));<a name="line.325"></a>
-<FONT color="green">326</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.EQ, 4));<a name="line.326"></a>
-<FONT color="green">327</FONT> <a name="line.327"></a>
-<FONT color="green">328</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.328"></a>
-<FONT color="green">329</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.329"></a>
-<FONT color="green">330</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(true));<a name="line.330"></a>
-<FONT color="green">331</FONT> Assert.assertEquals(2.0, solution.getPoint()[0], 0.0);<a name="line.331"></a>
-<FONT color="green">332</FONT> Assert.assertEquals(2.0, solution.getPoint()[1], 0.0);<a name="line.332"></a>
-<FONT color="green">333</FONT> Assert.assertEquals(57.0, solution.getValue(), 0.0);<a name="line.333"></a>
-<FONT color="green">334</FONT> }<a name="line.334"></a>
-<FONT color="green">335</FONT> <a name="line.335"></a>
-<FONT color="green">336</FONT> @Test<a name="line.336"></a>
-<FONT color="green">337</FONT> public void testSingleVariableAndConstraint() {<a name="line.337"></a>
-<FONT color="green">338</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 3 }, 0);<a name="line.338"></a>
-<FONT color="green">339</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.339"></a>
-<FONT color="green">340</FONT> constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 10));<a name="line.340"></a>
-<FONT color="green">341</FONT> <a name="line.341"></a>
-<FONT color="green">342</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.342"></a>
-<FONT color="green">343</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.343"></a>
-<FONT color="green">344</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.344"></a>
-<FONT color="green">345</FONT> Assert.assertEquals(10.0, solution.getPoint()[0], 0.0);<a name="line.345"></a>
-<FONT color="green">346</FONT> Assert.assertEquals(30.0, solution.getValue(), 0.0);<a name="line.346"></a>
-<FONT color="green">347</FONT> }<a name="line.347"></a>
-<FONT color="green">348</FONT> <a name="line.348"></a>
-<FONT color="green">349</FONT> /**<a name="line.349"></a>
-<FONT color="green">350</FONT> * With no artificial variables needed (no equals and no greater than<a name="line.350"></a>
-<FONT color="green">351</FONT> * constraints) we can go straight to Phase 2.<a name="line.351"></a>
-<FONT color="green">352</FONT> */<a name="line.352"></a>
-<FONT color="green">353</FONT> @Test<a name="line.353"></a>
-<FONT color="green">354</FONT> public void testModelWithNoArtificialVars() {<a name="line.354"></a>
-<FONT color="green">355</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 15, 10 }, 0);<a name="line.355"></a>
-<FONT color="green">356</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.356"></a>
-<FONT color="green">357</FONT> constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2));<a name="line.357"></a>
-<FONT color="green">358</FONT> constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3));<a name="line.358"></a>
-<FONT color="green">359</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.LEQ, 4));<a name="line.359"></a>
-<FONT color="green">360</FONT> <a name="line.360"></a>
-<FONT color="green">361</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.361"></a>
-<FONT color="green">362</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.362"></a>
-<FONT color="green">363</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.363"></a>
-<FONT color="green">364</FONT> Assert.assertEquals(2.0, solution.getPoint()[0], 0.0);<a name="line.364"></a>
-<FONT color="green">365</FONT> Assert.assertEquals(2.0, solution.getPoint()[1], 0.0);<a name="line.365"></a>
-<FONT color="green">366</FONT> Assert.assertEquals(50.0, solution.getValue(), 0.0);<a name="line.366"></a>
-<FONT color="green">367</FONT> }<a name="line.367"></a>
-<FONT color="green">368</FONT> <a name="line.368"></a>
-<FONT color="green">369</FONT> @Test<a name="line.369"></a>
-<FONT color="green">370</FONT> public void testMinimization() {<a name="line.370"></a>
-<FONT color="green">371</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { -2, 1 }, -5);<a name="line.371"></a>
-<FONT color="green">372</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.372"></a>
-<FONT color="green">373</FONT> constraints.add(new LinearConstraint(new double[] { 1, 2 }, Relationship.LEQ, 6));<a name="line.373"></a>
-<FONT color="green">374</FONT> constraints.add(new LinearConstraint(new double[] { 3, 2 }, Relationship.LEQ, 12));<a name="line.374"></a>
-<FONT color="green">375</FONT> constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.GEQ, 0));<a name="line.375"></a>
-<FONT color="green">376</FONT> <a name="line.376"></a>
-<FONT color="green">377</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.377"></a>
-<FONT color="green">378</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.378"></a>
-<FONT color="green">379</FONT> GoalType.MINIMIZE, new NonNegativeConstraint(false));<a name="line.379"></a>
-<FONT color="green">380</FONT> Assert.assertEquals(4.0, solution.getPoint()[0], 0.0);<a name="line.380"></a>
-<FONT color="green">381</FONT> Assert.assertEquals(0.0, solution.getPoint()[1], 0.0);<a name="line.381"></a>
-<FONT color="green">382</FONT> Assert.assertEquals(-13.0, solution.getValue(), 0.0);<a name="line.382"></a>
-<FONT color="green">383</FONT> }<a name="line.383"></a>
-<FONT color="green">384</FONT> <a name="line.384"></a>
-<FONT color="green">385</FONT> @Test<a name="line.385"></a>
-<FONT color="green">386</FONT> public void testSolutionWithNegativeDecisionVariable() {<a name="line.386"></a>
-<FONT color="green">387</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { -2, 1 }, 0);<a name="line.387"></a>
-<FONT color="green">388</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.388"></a>
-<FONT color="green">389</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.GEQ, 6));<a name="line.389"></a>
-<FONT color="green">390</FONT> constraints.add(new LinearConstraint(new double[] { 1, 2 }, Relationship.LEQ, 14));<a name="line.390"></a>
-<FONT color="green">391</FONT> <a name="line.391"></a>
-<FONT color="green">392</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.392"></a>
-<FONT color="green">393</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.393"></a>
-<FONT color="green">394</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.394"></a>
-<FONT color="green">395</FONT> Assert.assertEquals(-2.0, solution.getPoint()[0], 0.0);<a name="line.395"></a>
-<FONT color="green">396</FONT> Assert.assertEquals(8.0, solution.getPoint()[1], 0.0);<a name="line.396"></a>
-<FONT color="green">397</FONT> Assert.assertEquals(12.0, solution.getValue(), 0.0);<a name="line.397"></a>
-<FONT color="green">398</FONT> }<a name="line.398"></a>
-<FONT color="green">399</FONT> <a name="line.399"></a>
-<FONT color="green">400</FONT> @Test(expected = NoFeasibleSolutionException.class)<a name="line.400"></a>
-<FONT color="green">401</FONT> public void testInfeasibleSolution() {<a name="line.401"></a>
-<FONT color="green">402</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 15 }, 0);<a name="line.402"></a>
-<FONT color="green">403</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.403"></a>
-<FONT color="green">404</FONT> constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 1));<a name="line.404"></a>
-<FONT color="green">405</FONT> constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.GEQ, 3));<a name="line.405"></a>
-<FONT color="green">406</FONT> <a name="line.406"></a>
-<FONT color="green">407</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.407"></a>
-<FONT color="green">408</FONT> solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.408"></a>
-<FONT color="green">409</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.409"></a>
-<FONT color="green">410</FONT> }<a name="line.410"></a>
-<FONT color="green">411</FONT> <a name="line.411"></a>
-<FONT color="green">412</FONT> @Test(expected = UnboundedSolutionException.class)<a name="line.412"></a>
-<FONT color="green">413</FONT> public void testUnboundedSolution() {<a name="line.413"></a>
-<FONT color="green">414</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 15, 10 }, 0);<a name="line.414"></a>
-<FONT color="green">415</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.415"></a>
-<FONT color="green">416</FONT> constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.EQ, 2));<a name="line.416"></a>
-<FONT color="green">417</FONT> <a name="line.417"></a>
-<FONT color="green">418</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.418"></a>
-<FONT color="green">419</FONT> solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.419"></a>
-<FONT color="green">420</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.420"></a>
-<FONT color="green">421</FONT> }<a name="line.421"></a>
-<FONT color="green">422</FONT> <a name="line.422"></a>
-<FONT color="green">423</FONT> @Test<a name="line.423"></a>
-<FONT color="green">424</FONT> public void testRestrictVariablesToNonNegative() {<a name="line.424"></a>
-<FONT color="green">425</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 409, 523, 70, 204, 339 }, 0);<a name="line.425"></a>
-<FONT color="green">426</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.426"></a>
-<FONT color="green">427</FONT> constraints.add(new LinearConstraint(new double[] { 43, 56, 345, 56, 5 }, Relationship.LEQ, 4567456));<a name="line.427"></a>
-<FONT color="green">428</FONT> constraints.add(new LinearConstraint(new double[] { 12, 45, 7, 56, 23 }, Relationship.LEQ, 56454));<a name="line.428"></a>
-<FONT color="green">429</FONT> constraints.add(new LinearConstraint(new double[] { 8, 768, 0, 34, 7456 }, Relationship.LEQ, 1923421));<a name="line.429"></a>
-<FONT color="green">430</FONT> constraints.add(new LinearConstraint(new double[] { 12342, 2342, 34, 678, 2342 }, Relationship.GEQ, 4356));<a name="line.430"></a>
-<FONT color="green">431</FONT> constraints.add(new LinearConstraint(new double[] { 45, 678, 76, 52, 23 }, Relationship.EQ, 456356));<a name="line.431"></a>
-<FONT color="green">432</FONT> <a name="line.432"></a>
-<FONT color="green">433</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.433"></a>
-<FONT color="green">434</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.434"></a>
-<FONT color="green">435</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(true));<a name="line.435"></a>
-<FONT color="green">436</FONT> Assert.assertEquals(2902.92783505155, solution.getPoint()[0], .0000001);<a name="line.436"></a>
-<FONT color="green">437</FONT> Assert.assertEquals(480.419243986254, solution.getPoint()[1], .0000001);<a name="line.437"></a>
-<FONT color="green">438</FONT> Assert.assertEquals(0.0, solution.getPoint()[2], .0000001);<a name="line.438"></a>
-<FONT color="green">439</FONT> Assert.assertEquals(0.0, solution.getPoint()[3], .0000001);<a name="line.439"></a>
-<FONT color="green">440</FONT> Assert.assertEquals(0.0, solution.getPoint()[4], .0000001);<a name="line.440"></a>
-<FONT color="green">441</FONT> Assert.assertEquals(1438556.7491409, solution.getValue(), .0000001);<a name="line.441"></a>
-<FONT color="green">442</FONT> }<a name="line.442"></a>
-<FONT color="green">443</FONT> <a name="line.443"></a>
-<FONT color="green">444</FONT> @Test<a name="line.444"></a>
-<FONT color="green">445</FONT> public void testEpsilon() {<a name="line.445"></a>
-<FONT color="green">446</FONT> LinearObjectiveFunction f =<a name="line.446"></a>
-<FONT color="green">447</FONT> new LinearObjectiveFunction(new double[] { 10, 5, 1 }, 0);<a name="line.447"></a>
-<FONT color="green">448</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.448"></a>
-<FONT color="green">449</FONT> constraints.add(new LinearConstraint(new double[] { 9, 8, 0 }, Relationship.EQ, 17));<a name="line.449"></a>
-<FONT color="green">450</FONT> constraints.add(new LinearConstraint(new double[] { 0, 7, 8 }, Relationship.LEQ, 7));<a name="line.450"></a>
-<FONT color="green">451</FONT> constraints.add(new LinearConstraint(new double[] { 10, 0, 2 }, Relationship.LEQ, 10));<a name="line.451"></a>
+<FONT color="green">320</FONT> public void testMath930() {<a name="line.320"></a>
+<FONT color="green">321</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.321"></a>
+<FONT color="green">322</FONT> constraints.add(new LinearConstraint(new double[] {1, -1, -1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.322"></a>
+<FONT color="green">323</FONT> constraints.add(new LinearConstraint(new double[] {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1}, Relationship.GEQ, 0.0));<a name="line.323"></a>
+<FONT color="green">324</FONT> constraints.add(new LinearConstraint(new double[] {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1}, Relationship.LEQ, 0.0));<a name="line.324"></a>
+<FONT color="green">325</FONT> constraints.add(new LinearConstraint(new double[] {0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, -1, 0, -1, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.325"></a>
+<FONT color="green">326</FONT> constraints.add(new LinearConstraint(new double[] {0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.628803}, Relationship.GEQ, 0.0));<a name="line.326"></a>
+<FONT color="green">327</FONT> constraints.add(new LinearConstraint(new double[] {0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.676993}, Relationship.LEQ, 0.0));<a name="line.327"></a>
+<FONT color="green">328</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 1, -1, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 1, -1, 0, 0, -1, 1, 0, 0, 1, -1, 0, 0, 1, -1, 0, 0, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.328"></a>
+<FONT color="green">329</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.136677}, Relationship.GEQ, 0.0));<a name="line.329"></a>
+<FONT color="green">330</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.444434}, Relationship.LEQ, 0.0));<a name="line.330"></a>
+<FONT color="green">331</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.331"></a>
+<FONT color="green">332</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.254028}, Relationship.GEQ, 0.0));<a name="line.332"></a>
+<FONT color="green">333</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.302218}, Relationship.LEQ, 0.0));<a name="line.333"></a>
+<FONT color="green">334</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 1, -1, -1, 1, 0, 0, 0, 0, -1, 1, 1, -1, 0, 0, 0, 0, -1, 1, 1, -1, 0, 0, 0, 0, 1, -1, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.334"></a>
+<FONT color="green">335</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.653981}, Relationship.GEQ, 0.0));<a name="line.335"></a>
+<FONT color="green">336</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.690437}, Relationship.LEQ, 0.0));<a name="line.336"></a>
+<FONT color="green">337</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, -1, 0, 1, 0, 0, 0, 0, 0, -1, 0, 1, 0, 0, 0, 0, 0, 1, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.337"></a>
+<FONT color="green">338</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.423786}, Relationship.GEQ, 0.0));<a name="line.338"></a>
+<FONT color="green">339</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.486717}, Relationship.LEQ, 0.0));<a name="line.339"></a>
+<FONT color="green">340</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.340"></a>
+<FONT color="green">341</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.049232}, Relationship.GEQ, 0.0));<a name="line.341"></a>
+<FONT color="green">342</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.304747}, Relationship.LEQ, 0.0));<a name="line.342"></a>
+<FONT color="green">343</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.343"></a>
+<FONT color="green">344</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.129826}, Relationship.GEQ, 0.0));<a name="line.344"></a>
+<FONT color="green">345</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.205625}, Relationship.LEQ, 0.0));<a name="line.345"></a>
+<FONT color="green">346</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, -1, 1, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 1, -1, 1, -1, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.346"></a>
+<FONT color="green">347</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.621944}, Relationship.GEQ, 0.0));<a name="line.347"></a>
+<FONT color="green">348</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.764385}, Relationship.LEQ, 0.0));<a name="line.348"></a>
+<FONT color="green">349</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, -1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 1, 0, 1, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.349"></a>
+<FONT color="green">350</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.432572}, Relationship.GEQ, 0.0));<a name="line.350"></a>
+<FONT color="green">351</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.480762}, Relationship.LEQ, 0.0));<a name="line.351"></a>
+<FONT color="green">352</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0, 0, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.352"></a>
+<FONT color="green">353</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.055983}, Relationship.GEQ, 0.0));<a name="line.353"></a>
+<FONT color="green">354</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.11378}, Relationship.LEQ, 0.0));<a name="line.354"></a>
+<FONT color="green">355</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.355"></a>
+<FONT color="green">356</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.009607}, Relationship.GEQ, 0.0));<a name="line.356"></a>
+<FONT color="green">357</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.057797}, Relationship.LEQ, 0.0));<a name="line.357"></a>
+<FONT color="green">358</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.358"></a>
+<FONT color="green">359</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.407308}, Relationship.GEQ, 0.0));<a name="line.359"></a>
+<FONT color="green">360</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.452749}, Relationship.LEQ, 0.0));<a name="line.360"></a>
+<FONT color="green">361</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.361"></a>
+<FONT color="green">362</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.269677}, Relationship.GEQ, 0.0));<a name="line.362"></a>
+<FONT color="green">363</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.321806}, Relationship.LEQ, 0.0));<a name="line.363"></a>
+<FONT color="green">364</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.364"></a>
+<FONT color="green">365</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.049232}, Relationship.GEQ, 0.0));<a name="line.365"></a>
+<FONT color="green">366</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.06902}, Relationship.LEQ, 0.0));<a name="line.366"></a>
+<FONT color="green">367</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.367"></a>
+<FONT color="green">368</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0}, Relationship.GEQ, 0.0));<a name="line.368"></a>
+<FONT color="green">369</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.028754}, Relationship.LEQ, 0.0));<a name="line.369"></a>
+<FONT color="green">370</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, -1, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.370"></a>
+<FONT color="green">371</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.484254}, Relationship.GEQ, 0.0));<a name="line.371"></a>
+<FONT color="green">372</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.524607}, Relationship.LEQ, 0.0));<a name="line.372"></a>
+<FONT color="green">373</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.373"></a>
+<FONT color="green">374</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.385492}, Relationship.GEQ, 0.0));<a name="line.374"></a>
+<FONT color="green">375</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.430134}, Relationship.LEQ, 0.0));<a name="line.375"></a>
+<FONT color="green">376</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, -1, 1, 0, 0, -1, 1, 0, 0, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.376"></a>
+<FONT color="green">377</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.34983}, Relationship.GEQ, 0.0));<a name="line.377"></a>
+<FONT color="green">378</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.375781}, Relationship.LEQ, 0.0));<a name="line.378"></a>
+<FONT color="green">379</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.379"></a>
+<FONT color="green">380</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.254028}, Relationship.GEQ, 0.0));<a name="line.380"></a>
+<FONT color="green">381</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.281308}, Relationship.LEQ, 0.0));<a name="line.381"></a>
+<FONT color="green">382</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, 0, 0, 0, 0, -1, 1, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.382"></a>
+<FONT color="green">383</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.304995}, Relationship.GEQ, 0.0));<a name="line.383"></a>
+<FONT color="green">384</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.345347}, Relationship.LEQ, 0.0));<a name="line.384"></a>
+<FONT color="green">385</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, -1, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.385"></a>
+<FONT color="green">386</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.288899}, Relationship.GEQ, 0.0));<a name="line.386"></a>
+<FONT color="green">387</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.332212}, Relationship.LEQ, 0.0));<a name="line.387"></a>
+<FONT color="green">388</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.388"></a>
+<FONT color="green">389</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.14351}, Relationship.GEQ, 0.0));<a name="line.389"></a>
+<FONT color="green">390</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -0.17057}, Relationship.LEQ, 0.0));<a name="line.390"></a>
+<FONT color="green">391</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.391"></a>
+<FONT color="green">392</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -0.129826}, Relationship.GEQ, 0.0));<a name="line.392"></a>
+<FONT color="green">393</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, -0.157435}, Relationship.LEQ, 0.0));<a name="line.393"></a>
+<FONT color="green">394</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, -1, 1, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.394"></a>
+<FONT color="green">395</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -0}, Relationship.GEQ, 0.0));<a name="line.395"></a>
+<FONT color="green">396</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, -1}, Relationship.LEQ, 0.0));<a name="line.396"></a>
+<FONT color="green">397</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, -1, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.397"></a>
+<FONT color="green">398</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, -0.141071}, Relationship.GEQ, 0.0));<a name="line.398"></a>
+<FONT color="green">399</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, -0.232574}, Relationship.LEQ, 0.0));<a name="line.399"></a>
+<FONT color="green">400</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.400"></a>
+<FONT color="green">401</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -0}, Relationship.GEQ, 0.0));<a name="line.401"></a>
+<FONT color="green">402</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1}, Relationship.LEQ, 0.0));<a name="line.402"></a>
+<FONT color="green">403</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.403"></a>
+<FONT color="green">404</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -0.009607}, Relationship.GEQ, 0.0));<a name="line.404"></a>
+<FONT color="green">405</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -0.057797}, Relationship.LEQ, 0.0));<a name="line.405"></a>
+<FONT color="green">406</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, -1, 1, 0}, Relationship.GEQ, 0.0));<a name="line.406"></a>
+<FONT color="green">407</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -0}, Relationship.GEQ, 0.0));<a name="line.407"></a>
+<FONT color="green">408</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1}, Relationship.LEQ, 0.0));<a name="line.408"></a>
+<FONT color="green">409</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0}, Relationship.GEQ, 0.0));<a name="line.409"></a>
+<FONT color="green">410</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -0.091644}, Relationship.GEQ, 0.0));<a name="line.410"></a>
+<FONT color="green">411</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, -0.203531}, Relationship.LEQ, 0.0));<a name="line.411"></a>
+<FONT color="green">412</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0}, Relationship.GEQ, 0.0));<a name="line.412"></a>
+<FONT color="green">413</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -0}, Relationship.GEQ, 0.0));<a name="line.413"></a>
+<FONT color="green">414</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1}, Relationship.LEQ, 0.0));<a name="line.414"></a>
+<FONT color="green">415</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.415"></a>
+<FONT color="green">416</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0}, Relationship.GEQ, 0.0));<a name="line.416"></a>
+<FONT color="green">417</FONT> constraints.add(new LinearConstraint(new double[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -0.028754}, Relationship.LEQ, 0.0));<a name="line.417"></a>
+<FONT color="green">418</FONT> constraints.add(new LinearConstraint(new double[] {0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, Relationship.EQ, 1.0));<a name="line.418"></a>
+<FONT color="green">419</FONT> <a name="line.419"></a>
+<FONT color="green">420</FONT> double[] objFunctionCoeff = new double[33];<a name="line.420"></a>
+<FONT color="green">421</FONT> objFunctionCoeff[3] = 1;<a name="line.421"></a>
+<FONT color="green">422</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(objFunctionCoeff, 0);<a name="line.422"></a>
+<FONT color="green">423</FONT> SimplexSolver solver = new SimplexSolver(1e-4, 10, 1e-6);<a name="line.423"></a>
+<FONT color="green">424</FONT> <a name="line.424"></a>
+<FONT color="green">425</FONT> PointValuePair solution = solver.optimize(new MaxIter(1000), f, new LinearConstraintSet(constraints),<a name="line.425"></a>
+<FONT color="green">426</FONT> GoalType.MINIMIZE, new NonNegativeConstraint(true));<a name="line.426"></a>
+<FONT color="green">427</FONT> Assert.assertEquals(0.3752298, solution.getValue(), 1e-4);<a name="line.427"></a>
+<FONT color="green">428</FONT> }<a name="line.428"></a>
+<FONT color="green">429</FONT> <a name="line.429"></a>
+<FONT color="green">430</FONT> @Test<a name="line.430"></a>
+<FONT color="green">431</FONT> public void testSimplexSolver() {<a name="line.431"></a>
+<FONT color="green">432</FONT> LinearObjectiveFunction f =<a name="line.432"></a>
+<FONT color="green">433</FONT> new LinearObjectiveFunction(new double[] { 15, 10 }, 7);<a name="line.433"></a>
+<FONT color="green">434</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.434"></a>
+<FONT color="green">435</FONT> constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2));<a name="line.435"></a>
+<FONT color="green">436</FONT> constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3));<a name="line.436"></a>
+<FONT color="green">437</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.EQ, 4));<a name="line.437"></a>
+<FONT color="green">438</FONT> <a name="line.438"></a>
+<FONT color="green">439</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.439"></a>
+<FONT color="green">440</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.440"></a>
+<FONT color="green">441</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(true));<a name="line.441"></a>
+<FONT color="green">442</FONT> Assert.assertEquals(2.0, solution.getPoint()[0], 0.0);<a name="line.442"></a>
+<FONT color="green">443</FONT> Assert.assertEquals(2.0, solution.getPoint()[1], 0.0);<a name="line.443"></a>
+<FONT color="green">444</FONT> Assert.assertEquals(57.0, solution.getValue(), 0.0);<a name="line.444"></a>
+<FONT color="green">445</FONT> }<a name="line.445"></a>
+<FONT color="green">446</FONT> <a name="line.446"></a>
+<FONT color="green">447</FONT> @Test<a name="line.447"></a>
+<FONT color="green">448</FONT> public void testSingleVariableAndConstraint() {<a name="line.448"></a>
+<FONT color="green">449</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 3 }, 0);<a name="line.449"></a>
+<FONT color="green">450</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.450"></a>
+<FONT color="green">451</FONT> constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 10));<a name="line.451"></a>
<FONT color="green">452</FONT> <a name="line.452"></a>
-<FONT color="green">453</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.453"></a>
-<FONT color="green">454</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.454"></a>
-<FONT color="green">455</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.455"></a>
-<FONT color="green">456</FONT> Assert.assertEquals(1.0, solution.getPoint()[0], 0.0);<a name="line.456"></a>
-<FONT color="green">457</FONT> Assert.assertEquals(1.0, solution.getPoint()[1], 0.0);<a name="line.457"></a>
-<FONT color="green">458</FONT> Assert.assertEquals(0.0, solution.getPoint()[2], 0.0);<a name="line.458"></a>
-<FONT color="green">459</FONT> Assert.assertEquals(15.0, solution.getValue(), 0.0);<a name="line.459"></a>
-<FONT color="green">460</FONT> }<a name="line.460"></a>
-<FONT color="green">461</FONT> <a name="line.461"></a>
-<FONT color="green">462</FONT> @Test<a name="line.462"></a>
-<FONT color="green">463</FONT> public void testTrivialModel() {<a name="line.463"></a>
-<FONT color="green">464</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 1, 1 }, 0);<a name="line.464"></a>
-<FONT color="green">465</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.465"></a>
-<FONT color="green">466</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.EQ, 0));<a name="line.466"></a>
-<FONT color="green">467</FONT> <a name="line.467"></a>
-<FONT color="green">468</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.468"></a>
-<FONT color="green">469</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.469"></a>
-<FONT color="green">470</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(true));<a name="line.470"></a>
-<FONT color="green">471</FONT> Assert.assertEquals(0, solution.getValue(), .0000001);<a name="line.471"></a>
-<FONT color="green">472</FONT> }<a name="line.472"></a>
-<FONT color="green">473</FONT> <a name="line.473"></a>
-<FONT color="green">474</FONT> @Test<a name="line.474"></a>
-<FONT color="green">475</FONT> public void testLargeModel() {<a name="line.475"></a>
-<FONT color="green">476</FONT> double[] objective = new double[] {<a name="line.476"></a>
-<FONT color="green">477</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.477"></a>
-<FONT color="green">478</FONT> 1, 1, 12, 1, 1, 1, 1, 1, 1, 1,<a name="line.478"></a>
-<FONT color="green">479</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.479"></a>
-<FONT color="green">480</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.480"></a>
-<FONT color="green">481</FONT> 12, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.481"></a>
-<FONT color="green">482</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.482"></a>
-<FONT color="green">483</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 12, 1,<a name="line.483"></a>
-<FONT color="green">484</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.484"></a>
-<FONT color="green">485</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.485"></a>
-<FONT color="green">486</FONT> 1, 1, 1, 1, 1, 1, 12, 1, 1, 1,<a name="line.486"></a>
-<FONT color="green">487</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.487"></a>
-<FONT color="green">488</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.488"></a>
-<FONT color="green">489</FONT> 1, 1, 1, 1, 12, 1, 1, 1, 1, 1,<a name="line.489"></a>
-<FONT color="green">490</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.490"></a>
-<FONT color="green">491</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.491"></a>
-<FONT color="green">492</FONT> 1, 1, 12, 1, 1, 1, 1, 1, 1, 1,<a name="line.492"></a>
-<FONT color="green">493</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.493"></a>
-<FONT color="green">494</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.494"></a>
-<FONT color="green">495</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.495"></a>
-<FONT color="green">496</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.496"></a>
-<FONT color="green">497</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.497"></a>
-<FONT color="green">498</FONT> 1, 1, 1, 1, 1, 1};<a name="line.498"></a>
-<FONT color="green">499</FONT> <a name="line.499"></a>
-<FONT color="green">500</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(objective, 0);<a name="line.500"></a>
-<FONT color="green">501</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.501"></a>
-<FONT color="green">502</FONT> constraints.add(equationFromString(objective.length, "x0 + x1 + x2 + x3 - x12 = 0"));<a name="line.502"></a>
-<FONT color="green">503</FONT> constraints.add(equationFromString(objective.length, "x4 + x5 + x6 + x7 + x8 + x9 + x10 + x11 - x13 = 0"));<a name="line.503"></a>
-<FONT color="green">504</FONT> constraints.add(equationFromString(objective.length, "x4 + x5 + x6 + x7 + x8 + x9 + x10 + x11 >= 49"));<a name="line.504"></a>
-<FONT color="green">505</FONT> constraints.add(equationFromString(objective.length, "x0 + x1 + x2 + x3 >= 42"));<a name="line.505"></a>
-<FONT color="green">506</FONT> constraints.add(equationFromString(objective.length, "x14 + x15 + x16 + x17 - x26 = 0"));<a name="line.506"></a>
-<FONT color="green">507</FONT> constraints.add(equationFromString(objective.length, "x18 + x19 + x20 + x21 + x22 + x23 + x24 + x25 - x27 = 0"));<a name="line.507"></a>
-<FONT color="green">508</FONT> constraints.add(equationFromString(objective.length, "x14 + x15 + x16 + x17 - x12 = 0"));<a name="line.508"></a>
-<FONT color="green">509</FONT> constraints.add(equationFromString(objective.length, "x18 + x19 + x20 + x21 + x22 + x23 + x24 + x25 - x13 = 0"));<a name="line.509"></a>
-<FONT color="green">510</FONT> constraints.add(equationFromString(objective.length, "x28 + x29 + x30 + x31 - x40 = 0"));<a name="line.510"></a>
-<FONT color="green">511</FONT> constraints.add(equationFromString(objective.length, "x32 + x33 + x34 + x35 + x36 + x37 + x38 + x39 - x41 = 0"));<a name="line.511"></a>
-<FONT color="green">512</FONT> constraints.add(equationFromString(objective.length, "x32 + x33 + x34 + x35 + x36 + x37 + x38 + x39 >= 49"));<a name="line.512"></a>
-<FONT color="green">513</FONT> constraints.add(equationFromString(objective.length, "x28 + x29 + x30 + x31 >= 42"));<a name="line.513"></a>
-<FONT color="green">514</FONT> constraints.add(equationFromString(objective.length, "x42 + x43 + x44 + x45 - x54 = 0"));<a name="line.514"></a>
-<FONT color="green">515</FONT> constraints.add(equationFromString(objective.length, "x46 + x47 + x48 + x49 + x50 + x51 + x52 + x53 - x55 = 0"));<a name="line.515"></a>
-<FONT color="green">516</FONT> constraints.add(equationFromString(objective.length, "x42 + x43 + x44 + x45 - x40 = 0"));<a name="line.516"></a>
-<FONT color="green">517</FONT> constraints.add(equationFromString(objective.length, "x46 + x47 + x48 + x49 + x50 + x51 + x52 + x53 - x41 = 0"));<a name="line.517"></a>
-<FONT color="green">518</FONT> constraints.add(equationFromString(objective.length, "x56 + x57 + x58 + x59 - x68 = 0"));<a name="line.518"></a>
-<FONT color="green">519</FONT> constraints.add(equationFromString(objective.length, "x60 + x61 + x62 + x63 + x64 + x65 + x66 + x67 - x69 = 0"));<a name="line.519"></a>
-<FONT color="green">520</FONT> constraints.add(equationFromString(objective.length, "x60 + x61 + x62 + x63 + x64 + x65 + x66 + x67 >= 51"));<a name="line.520"></a>
-<FONT color="green">521</FONT> constraints.add(equationFromString(objective.length, "x56 + x57 + x58 + x59 >= 44"));<a name="line.521"></a>
-<FONT color="green">522</FONT> constraints.add(equationFromString(objective.length, "x70 + x71 + x72 + x73 - x82 = 0"));<a name="line.522"></a>
-<FONT color="green">523</FONT> constraints.add(equationFromString(objective.length, "x74 + x75 + x76 + x77 + x78 + x79 + x80 + x81 - x83 = 0"));<a name="line.523"></a>
-<FONT color="green">524</FONT> constraints.add(equationFromString(objective.length, "x70 + x71 + x72 + x73 - x68 = 0"));<a name="line.524"></a>
-<FONT color="green">525</FONT> constraints.add(equationFromString(objective.length, "x74 + x75 + x76 + x77 + x78 + x79 + x80 + x81 - x69 = 0"));<a name="line.525"></a>
-<FONT color="green">526</FONT> constraints.add(equationFromString(objective.length, "x84 + x85 + x86 + x87 - x96 = 0"));<a name="line.526"></a>
-<FONT color="green">527</FONT> constraints.add(equationFromString(objective.length, "x88 + x89 + x90 + x91 + x92 + x93 + x94 + x95 - x97 = 0"));<a name="line.527"></a>
-<FONT color="green">528</FONT> constraints.add(equationFromString(objective.length, "x88 + x89 + x90 + x91 + x92 + x93 + x94 + x95 >= 51"));<a name="line.528"></a>
-<FONT color="green">529</FONT> constraints.add(equationFromString(objective.length, "x84 + x85 + x86 + x87 >= 44"));<a name="line.529"></a>
-<FONT color="green">530</FONT> constraints.add(equationFromString(objective.length, "x98 + x99 + x100 + x101 - x110 = 0"));<a name="line.530"></a>
-<FONT color="green">531</FONT> constraints.add(equationFromString(objective.length, "x102 + x103 + x104 + x105 + x106 + x107 + x108 + x109 - x111 = 0"));<a name="line.531"></a>
-<FONT color="green">532</FONT> constraints.add(equationFromString(objective.length, "x98 + x99 + x100 + x101 - x96 = 0"));<a name="line.532"></a>
-<FONT color="green">533</FONT> constraints.add(equationFromString(objective.length, "x102 + x103 + x104 + x105 + x106 + x107 + x108 + x109 - x97 = 0"));<a name="line.533"></a>
-<FONT color="green">534</FONT> constraints.add(equationFromString(objective.length, "x112 + x113 + x114 + x115 - x124 = 0"));<a name="line.534"></a>
-<FONT color="green">535</FONT> constraints.add(equationFromString(objective.length, "x116 + x117 + x118 + x119 + x120 + x121 + x122 + x123 - x125 = 0"));<a name="line.535"></a>
-<FONT color="green">536</FONT> constraints.add(equationFromString(objective.length, "x116 + x117 + x118 + x119 + x120 + x121 + x122 + x123 >= 49"));<a name="line.536"></a>
-<FONT color="green">537</FONT> constraints.add(equationFromString(objective.length, "x112 + x113 + x114 + x115 >= 42"));<a name="line.537"></a>
-<FONT color="green">538</FONT> constraints.add(equationFromString(objective.length, "x126 + x127 + x128 + x129 - x138 = 0"));<a name="line.538"></a>
-<FONT color="green">539</FONT> constraints.add(equationFromString(objective.length, "x130 + x131 + x132 + x133 + x134 + x135 + x136 + x137 - x139 = 0"));<a name="line.539"></a>
-<FONT color="green">540</FONT> constraints.add(equationFromString(objective.length, "x126 + x127 + x128 + x129 - x124 = 0"));<a name="line.540"></a>
-<FONT color="green">541</FONT> constraints.add(equationFromString(objective.length, "x130 + x131 + x132 + x133 + x134 + x135 + x136 + x137 - x125 = 0"));<a name="line.541"></a>
-<FONT color="green">542</FONT> constraints.add(equationFromString(objective.length, "x140 + x141 + x142 + x143 - x152 = 0"));<a name="line.542"></a>
-<FONT color="green">543</FONT> constraints.add(equationFromString(objective.length, "x144 + x145 + x146 + x147 + x148 + x149 + x150 + x151 - x153 = 0"));<a name="line.543"></a>
-<FONT color="green">544</FONT> constraints.add(equationFromString(objective.length, "x144 + x145 + x146 + x147 + x148 + x149 + x150 + x151 >= 59"));<a name="line.544"></a>
-<FONT color="green">545</FONT> constraints.add(equationFromString(objective.length, "x140 + x141 + x142 + x143 >= 42"));<a name="line.545"></a>
-<FONT color="green">546</FONT> constraints.add(equationFromString(objective.length, "x154 + x155 + x156 + x157 - x166 = 0"));<a name="line.546"></a>
-<FONT color="green">547</FONT> constraints.add(equationFromString(objective.length, "x158 + x159 + x160 + x161 + x162 + x163 + x164 + x165 - x167 = 0"));<a name="line.547"></a>
-<FONT color="green">548</FONT> constraints.add(equationFromString(objective.length, "x154 + x155 + x156 + x157 - x152 = 0"));<a name="line.548"></a>
-<FONT color="green">549</FONT> constraints.add(equationFromString(objective.length, "x158 + x159 + x160 + x161 + x162 + x163 + x164 + x165 - x153 = 0"));<a name="line.549"></a>
-<FONT color="green">550</FONT> constraints.add(equationFromString(objective.length, "x83 + x82 - x168 = 0"));<a name="line.550"></a>
-<FONT color="green">551</FONT> constraints.add(equationFromString(objective.length, "x111 + x110 - x169 = 0"));<a name="line.551"></a>
-<FONT color="green">552</FONT> constraints.add(equationFromString(objective.length, "x170 - x182 = 0"));<a name="line.552"></a>
-<FONT color="green">553</FONT> constraints.add(equationFromString(objective.length, "x171 - x183 = 0"));<a name="line.553"></a>
-<FONT color="green">554</FONT> constraints.add(equationFromString(objective.length, "x172 - x184 = 0"));<a name="line.554"></a>
-<FONT color="green">555</FONT> constraints.add(equationFromString(objective.length, "x173 - x185 = 0"));<a name="line.555"></a>
-<FONT color="green">556</FONT> constraints.add(equationFromString(objective.length, "x174 - x186 = 0"));<a name="line.556"></a>
-<FONT color="green">557</FONT> constraints.add(equationFromString(objective.length, "x175 + x176 - x187 = 0"));<a name="line.557"></a>
-<FONT color="green">558</FONT> constraints.add(equationFromString(objective.length, "x177 - x188 = 0"));<a name="line.558"></a>
-<FONT color="green">559</FONT> constraints.add(equationFromString(objective.length, "x178 - x189 = 0"));<a name="line.559"></a>
-<FONT color="green">560</FONT> constraints.add(equationFromString(objective.length, "x179 - x190 = 0"));<a name="line.560"></a>
-<FONT color="green">561</FONT> constraints.add(equationFromString(objective.length, "x180 - x191 = 0"));<a name="line.561"></a>
-<FONT color="green">562</FONT> constraints.add(equationFromString(objective.length, "x181 - x192 = 0"));<a name="line.562"></a>
-<FONT color="green">563</FONT> constraints.add(equationFromString(objective.length, "x170 - x26 = 0"));<a name="line.563"></a>
-<FONT color="green">564</FONT> constraints.add(equationFromString(objective.length, "x171 - x27 = 0"));<a name="line.564"></a>
-<FONT color="green">565</FONT> constraints.add(equationFromString(objective.length, "x172 - x54 = 0"));<a name="line.565"></a>
-<FONT color="green">566</FONT> constraints.add(equationFromString(objective.length, "x173 - x55 = 0"));<a name="line.566"></a>
-<FONT color="green">567</FONT> constraints.add(equationFromString(objective.length, "x174 - x168 = 0"));<a name="line.567"></a>
-<FONT color="green">568</FONT> constraints.add(equationFromString(objective.length, "x177 - x169 = 0"));<a name="line.568"></a>
-<FONT color="green">569</FONT> constraints.add(equationFromString(objective.length, "x178 - x138 = 0"));<a name="line.569"></a>
-<FONT color="green">570</FONT> constraints.add(equationFromString(objective.length, "x179 - x139 = 0"));<a name="line.570"></a>
-<FONT color="green">571</FONT> constraints.add(equationFromString(objective.length, "x180 - x166 = 0"));<a name="line.571"></a>
-<FONT color="green">572</FONT> constraints.add(equationFromString(objective.length, "x181 - x167 = 0"));<a name="line.572"></a>
-<FONT color="green">573</FONT> constraints.add(equationFromString(objective.length, "x193 - x205 = 0"));<a name="line.573"></a>
-<FONT color="green">574</FONT> constraints.add(equationFromString(objective.length, "x194 - x206 = 0"));<a name="line.574"></a>
-<FONT color="green">575</FONT> constraints.add(equationFromString(objective.length, "x195 - x207 = 0"));<a name="line.575"></a>
-<FONT color="green">576</FONT> constraints.add(equationFromString(objective.length, "x196 - x208 = 0"));<a name="line.576"></a>
-<FONT color="green">577</FONT> constraints.add(equationFromString(objective.length, "x197 - x209 = 0"));<a name="line.577"></a>
-<FONT color="green">578</FONT> constraints.add(equationFromString(objective.length, "x198 + x199 - x210 = 0"));<a name="line.578"></a>
-<FONT color="green">579</FONT> constraints.add(equationFromString(objective.length, "x200 - x211 = 0"));<a name="line.579"></a>
-<FONT color="green">580</FONT> constraints.add(equationFromString(objective.length, "x201 - x212 = 0"));<a name="line.580"></a>
-<FONT color="green">581</FONT> constraints.add(equationFromString(objective.length, "x202 - x213 = 0"));<a name="line.581"></a>
-<FONT color="green">582</FONT> constraints.add(equationFromString(objective.length, "x203 - x214 = 0"));<a name="line.582"></a>
-<FONT color="green">583</FONT> constraints.add(equationFromString(objective.length, "x204 - x215 = 0"));<a name="line.583"></a>
-<FONT color="green">584</FONT> constraints.add(equationFromString(objective.length, "x193 - x182 = 0"));<a name="line.584"></a>
-<FONT color="green">585</FONT> constraints.add(equationFromString(objective.length, "x194 - x183 = 0"));<a name="line.585"></a>
-<FONT color="green">586</FONT> constraints.add(equationFromString(objective.length, "x195 - x184 = 0"));<a name="line.586"></a>
-<FONT color="green">587</FONT> constraints.add(equationFromString(objective.length, "x196 - x185 = 0"));<a name="line.587"></a>
-<FONT color="green">588</FONT> constraints.add(equationFromString(objective.length, "x197 - x186 = 0"));<a name="line.588"></a>
-<FONT color="green">589</FONT> constraints.add(equationFromString(objective.length, "x198 + x199 - x187 = 0"));<a name="line.589"></a>
-<FONT color="green">590</FONT> constraints.add(equationFromString(objective.length, "x200 - x188 = 0"));<a name="line.590"></a>
-<FONT color="green">591</FONT> constraints.add(equationFromString(objective.length, "x201 - x189 = 0"));<a name="line.591"></a>
-<FONT color="green">592</FONT> constraints.add(equationFromString(objective.length, "x202 - x190 = 0"));<a name="line.592"></a>
-<FONT color="green">593</FONT> constraints.add(equationFromString(objective.length, "x203 - x191 = 0"));<a name="line.593"></a>
-<FONT color="green">594</FONT> constraints.add(equationFromString(objective.length, "x204 - x192 = 0"));<a name="line.594"></a>
-<FONT color="green">595</FONT> <a name="line.595"></a>
-<FONT color="green">596</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.596"></a>
-<FONT color="green">597</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.597"></a>
-<FONT color="green">598</FONT> GoalType.MINIMIZE, new NonNegativeConstraint(true));<a name="line.598"></a>
-<FONT color="green">599</FONT> Assert.assertEquals(7518.0, solution.getValue(), .0000001);<a name="line.599"></a>
-<FONT color="green">600</FONT> }<a name="line.600"></a>
-<FONT color="green">601</FONT> <a name="line.601"></a>
-<FONT color="green">602</FONT> /**<a name="line.602"></a>
-<FONT color="green">603</FONT> * Converts a test string to a {@link LinearConstraint}.<a name="line.603"></a>
-<FONT color="green">604</FONT> * Ex: x0 + x1 + x2 + x3 - x12 = 0<a name="line.604"></a>
-<FONT color="green">605</FONT> */<a name="line.605"></a>
-<FONT color="green">606</FONT> private LinearConstraint equationFromString(int numCoefficients, String s) {<a name="line.606"></a>
-<FONT color="green">607</FONT> Relationship relationship;<a name="line.607"></a>
-<FONT color="green">608</FONT> if (s.contains(">=")) {<a name="line.608"></a>
-<FONT color="green">609</FONT> relationship = Relationship.GEQ;<a name="line.609"></a>
-<FONT color="green">610</FONT> } else if (s.contains("<=")) {<a name="line.610"></a>
-<FONT color="green">611</FONT> relationship = Relationship.LEQ;<a name="line.611"></a>
-<FONT color="green">612</FONT> } else if (s.contains("=")) {<a name="line.612"></a>
-<FONT color="green">613</FONT> relationship = Relationship.EQ;<a name="line.613"></a>
-<FONT color="green">614</FONT> } else {<a name="line.614"></a>
-<FONT color="green">615</FONT> throw new IllegalArgumentException();<a name="line.615"></a>
-<FONT color="green">616</FONT> }<a name="line.616"></a>
-<FONT color="green">617</FONT> <a name="line.617"></a>
-<FONT color="green">618</FONT> String[] equationParts = s.split("[>|<]?=");<a name="line.618"></a>
-<FONT color="green">619</FONT> double rhs = Double.parseDouble(equationParts[1].trim());<a name="line.619"></a>
-<FONT color="green">620</FONT> <a name="line.620"></a>
-<FONT color="green">621</FONT> double[] lhs = new double[numCoefficients];<a name="line.621"></a>
-<FONT color="green">622</FONT> String left = equationParts[0].replaceAll(" ?x", "");<a name="line.622"></a>
-<FONT color="green">623</FONT> String[] coefficients = left.split(" ");<a name="line.623"></a>
-<FONT color="green">624</FONT> for (String coefficient : coefficients) {<a name="line.624"></a>
-<FONT color="green">625</FONT> double value = coefficient.charAt(0) == '-' ? -1 : 1;<a name="line.625"></a>
-<FONT color="green">626</FONT> int index = Integer.parseInt(coefficient.replaceFirst("[+|-]", "").trim());<a name="line.626"></a>
-<FONT color="green">627</FONT> lhs[index] = value;<a name="line.627"></a>
-<FONT color="green">628</FONT> }<a name="line.628"></a>
-<FONT color="green">629</FONT> return new LinearConstraint(lhs, relationship, rhs);<a name="line.629"></a>
-<FONT color="green">630</FONT> }<a name="line.630"></a>
-<FONT color="green">631</FONT> <a name="line.631"></a>
-<FONT color="green">632</FONT> private static boolean validSolution(PointValuePair solution, List<LinearConstraint> constraints, double epsilon) {<a name="line.632"></a>
-<FONT color="green">633</FONT> double[] vals = solution.getPoint();<a name="line.633"></a>
-<FONT color="green">634</FONT> for (LinearConstraint c : constraints) {<a name="line.634"></a>
-<FONT color="green">635</FONT> double[] coeffs = c.getCoefficients().toArray();<a name="line.635"></a>
-<FONT color="green">636</FONT> double result = 0.0d;<a name="line.636"></a>
-<FONT color="green">637</FONT> for (int i = 0; i < vals.length; i++) {<a name="line.637"></a>
-<FONT color="green">638</FONT> result += vals[i] * coeffs[i];<a name="line.638"></a>
-<FONT color="green">639</FONT> }<a name="line.639"></a>
-<FONT color="green">640</FONT> <a name="line.640"></a>
-<FONT color="green">641</FONT> switch (c.getRelationship()) {<a name="line.641"></a>
-<FONT color="green">642</FONT> case EQ:<a name="line.642"></a>
-<FONT color="green">643</FONT> if (!Precision.equals(result, c.getValue(), epsilon)) {<a name="line.643"></a>
-<FONT color="green">644</FONT> return false;<a name="line.644"></a>
-<FONT color="green">645</FONT> }<a name="line.645"></a>
-<FONT color="green">646</FONT> break;<a name="line.646"></a>
-<FONT color="green">647</FONT> <a name="line.647"></a>
-<FONT color="green">648</FONT> case GEQ:<a name="line.648"></a>
-<FONT color="green">649</FONT> if (Precision.compareTo(result, c.getValue(), epsilon) < 0) {<a name="line.649"></a>
-<FONT color="green">650</FONT> return false;<a name="line.650"></a>
-<FONT color="green">651</FONT> }<a name="line.651"></a>
-<FONT color="green">652</FONT> break;<a name="line.652"></a>
-<FONT color="green">653</FONT> <a name="line.653"></a>
-<FONT color="green">654</FONT> case LEQ:<a name="line.654"></a>
-<FONT color="green">655</FONT> if (Precision.compareTo(result, c.getValue(), epsilon) > 0) {<a name="line.655"></a>
-<FONT color="green">656</FONT> return false;<a name="line.656"></a>
-<FONT color="green">657</FONT> }<a name="line.657"></a>
-<FONT color="green">658</FONT> break;<a name="line.658"></a>
-<FONT color="green">659</FONT> }<a name="line.659"></a>
-<FONT color="green">660</FONT> }<a name="line.660"></a>
-<FONT color="green">661</FONT> <a name="line.661"></a>
-<FONT color="green">662</FONT> return true;<a name="line.662"></a>
-<FONT color="green">663</FONT> }<a name="line.663"></a>
-<FONT color="green">664</FONT> }<a name="line.664"></a>
+<FONT color="green">453</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.453"></a>
+<FONT color="green">454</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.454"></a>
+<FONT color="green">455</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.455"></a>
+<FONT color="green">456</FONT> Assert.assertEquals(10.0, solution.getPoint()[0], 0.0);<a name="line.456"></a>
+<FONT color="green">457</FONT> Assert.assertEquals(30.0, solution.getValue(), 0.0);<a name="line.457"></a>
+<FONT color="green">458</FONT> }<a name="line.458"></a>
+<FONT color="green">459</FONT> <a name="line.459"></a>
+<FONT color="green">460</FONT> /**<a name="line.460"></a>
+<FONT color="green">461</FONT> * With no artificial variables needed (no equals and no greater than<a name="line.461"></a>
+<FONT color="green">462</FONT> * constraints) we can go straight to Phase 2.<a name="line.462"></a>
+<FONT color="green">463</FONT> */<a name="line.463"></a>
+<FONT color="green">464</FONT> @Test<a name="line.464"></a>
+<FONT color="green">465</FONT> public void testModelWithNoArtificialVars() {<a name="line.465"></a>
+<FONT color="green">466</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 15, 10 }, 0);<a name="line.466"></a>
+<FONT color="green">467</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.467"></a>
+<FONT color="green">468</FONT> constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.LEQ, 2));<a name="line.468"></a>
+<FONT color="green">469</FONT> constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.LEQ, 3));<a name="line.469"></a>
+<FONT color="green">470</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.LEQ, 4));<a name="line.470"></a>
+<FONT color="green">471</FONT> <a name="line.471"></a>
+<FONT color="green">472</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.472"></a>
+<FONT color="green">473</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.473"></a>
+<FONT color="green">474</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.474"></a>
+<FONT color="green">475</FONT> Assert.assertEquals(2.0, solution.getPoint()[0], 0.0);<a name="line.475"></a>
+<FONT color="green">476</FONT> Assert.assertEquals(2.0, solution.getPoint()[1], 0.0);<a name="line.476"></a>
+<FONT color="green">477</FONT> Assert.assertEquals(50.0, solution.getValue(), 0.0);<a name="line.477"></a>
+<FONT color="green">478</FONT> }<a name="line.478"></a>
+<FONT color="green">479</FONT> <a name="line.479"></a>
+<FONT color="green">480</FONT> @Test<a name="line.480"></a>
+<FONT color="green">481</FONT> public void testMinimization() {<a name="line.481"></a>
+<FONT color="green">482</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { -2, 1 }, -5);<a name="line.482"></a>
+<FONT color="green">483</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.483"></a>
+<FONT color="green">484</FONT> constraints.add(new LinearConstraint(new double[] { 1, 2 }, Relationship.LEQ, 6));<a name="line.484"></a>
+<FONT color="green">485</FONT> constraints.add(new LinearConstraint(new double[] { 3, 2 }, Relationship.LEQ, 12));<a name="line.485"></a>
+<FONT color="green">486</FONT> constraints.add(new LinearConstraint(new double[] { 0, 1 }, Relationship.GEQ, 0));<a name="line.486"></a>
+<FONT color="green">487</FONT> <a name="line.487"></a>
+<FONT color="green">488</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.488"></a>
+<FONT color="green">489</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.489"></a>
+<FONT color="green">490</FONT> GoalType.MINIMIZE, new NonNegativeConstraint(false));<a name="line.490"></a>
+<FONT color="green">491</FONT> Assert.assertEquals(4.0, solution.getPoint()[0], 0.0);<a name="line.491"></a>
+<FONT color="green">492</FONT> Assert.assertEquals(0.0, solution.getPoint()[1], 0.0);<a name="line.492"></a>
+<FONT color="green">493</FONT> Assert.assertEquals(-13.0, solution.getValue(), 0.0);<a name="line.493"></a>
+<FONT color="green">494</FONT> }<a name="line.494"></a>
+<FONT color="green">495</FONT> <a name="line.495"></a>
+<FONT color="green">496</FONT> @Test<a name="line.496"></a>
+<FONT color="green">497</FONT> public void testSolutionWithNegativeDecisionVariable() {<a name="line.497"></a>
+<FONT color="green">498</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { -2, 1 }, 0);<a name="line.498"></a>
+<FONT color="green">499</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.499"></a>
+<FONT color="green">500</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.GEQ, 6));<a name="line.500"></a>
+<FONT color="green">501</FONT> constraints.add(new LinearConstraint(new double[] { 1, 2 }, Relationship.LEQ, 14));<a name="line.501"></a>
+<FONT color="green">502</FONT> <a name="line.502"></a>
+<FONT color="green">503</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.503"></a>
+<FONT color="green">504</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.504"></a>
+<FONT color="green">505</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.505"></a>
+<FONT color="green">506</FONT> Assert.assertEquals(-2.0, solution.getPoint()[0], 0.0);<a name="line.506"></a>
+<FONT color="green">507</FONT> Assert.assertEquals(8.0, solution.getPoint()[1], 0.0);<a name="line.507"></a>
+<FONT color="green">508</FONT> Assert.assertEquals(12.0, solution.getValue(), 0.0);<a name="line.508"></a>
+<FONT color="green">509</FONT> }<a name="line.509"></a>
+<FONT color="green">510</FONT> <a name="line.510"></a>
+<FONT color="green">511</FONT> @Test(expected = NoFeasibleSolutionException.class)<a name="line.511"></a>
+<FONT color="green">512</FONT> public void testInfeasibleSolution() {<a name="line.512"></a>
+<FONT color="green">513</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 15 }, 0);<a name="line.513"></a>
+<FONT color="green">514</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.514"></a>
+<FONT color="green">515</FONT> constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.LEQ, 1));<a name="line.515"></a>
+<FONT color="green">516</FONT> constraints.add(new LinearConstraint(new double[] { 1 }, Relationship.GEQ, 3));<a name="line.516"></a>
+<FONT color="green">517</FONT> <a name="line.517"></a>
+<FONT color="green">518</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.518"></a>
+<FONT color="green">519</FONT> solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.519"></a>
+<FONT color="green">520</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.520"></a>
+<FONT color="green">521</FONT> }<a name="line.521"></a>
+<FONT color="green">522</FONT> <a name="line.522"></a>
+<FONT color="green">523</FONT> @Test(expected = UnboundedSolutionException.class)<a name="line.523"></a>
+<FONT color="green">524</FONT> public void testUnboundedSolution() {<a name="line.524"></a>
+<FONT color="green">525</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 15, 10 }, 0);<a name="line.525"></a>
+<FONT color="green">526</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.526"></a>
+<FONT color="green">527</FONT> constraints.add(new LinearConstraint(new double[] { 1, 0 }, Relationship.EQ, 2));<a name="line.527"></a>
+<FONT color="green">528</FONT> <a name="line.528"></a>
+<FONT color="green">529</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.529"></a>
+<FONT color="green">530</FONT> solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.530"></a>
+<FONT color="green">531</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.531"></a>
+<FONT color="green">532</FONT> }<a name="line.532"></a>
+<FONT color="green">533</FONT> <a name="line.533"></a>
+<FONT color="green">534</FONT> @Test<a name="line.534"></a>
+<FONT color="green">535</FONT> public void testRestrictVariablesToNonNegative() {<a name="line.535"></a>
+<FONT color="green">536</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 409, 523, 70, 204, 339 }, 0);<a name="line.536"></a>
+<FONT color="green">537</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.537"></a>
+<FONT color="green">538</FONT> constraints.add(new LinearConstraint(new double[] { 43, 56, 345, 56, 5 }, Relationship.LEQ, 4567456));<a name="line.538"></a>
+<FONT color="green">539</FONT> constraints.add(new LinearConstraint(new double[] { 12, 45, 7, 56, 23 }, Relationship.LEQ, 56454));<a name="line.539"></a>
+<FONT color="green">540</FONT> constraints.add(new LinearConstraint(new double[] { 8, 768, 0, 34, 7456 }, Relationship.LEQ, 1923421));<a name="line.540"></a>
+<FONT color="green">541</FONT> constraints.add(new LinearConstraint(new double[] { 12342, 2342, 34, 678, 2342 }, Relationship.GEQ, 4356));<a name="line.541"></a>
+<FONT color="green">542</FONT> constraints.add(new LinearConstraint(new double[] { 45, 678, 76, 52, 23 }, Relationship.EQ, 456356));<a name="line.542"></a>
+<FONT color="green">543</FONT> <a name="line.543"></a>
+<FONT color="green">544</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.544"></a>
+<FONT color="green">545</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.545"></a>
+<FONT color="green">546</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(true));<a name="line.546"></a>
+<FONT color="green">547</FONT> Assert.assertEquals(2902.92783505155, solution.getPoint()[0], .0000001);<a name="line.547"></a>
+<FONT color="green">548</FONT> Assert.assertEquals(480.419243986254, solution.getPoint()[1], .0000001);<a name="line.548"></a>
+<FONT color="green">549</FONT> Assert.assertEquals(0.0, solution.getPoint()[2], .0000001);<a name="line.549"></a>
+<FONT color="green">550</FONT> Assert.assertEquals(0.0, solution.getPoint()[3], .0000001);<a name="line.550"></a>
+<FONT color="green">551</FONT> Assert.assertEquals(0.0, solution.getPoint()[4], .0000001);<a name="line.551"></a>
+<FONT color="green">552</FONT> Assert.assertEquals(1438556.7491409, solution.getValue(), .0000001);<a name="line.552"></a>
+<FONT color="green">553</FONT> }<a name="line.553"></a>
+<FONT color="green">554</FONT> <a name="line.554"></a>
+<FONT color="green">555</FONT> @Test<a name="line.555"></a>
+<FONT color="green">556</FONT> public void testEpsilon() {<a name="line.556"></a>
+<FONT color="green">557</FONT> LinearObjectiveFunction f =<a name="line.557"></a>
+<FONT color="green">558</FONT> new LinearObjectiveFunction(new double[] { 10, 5, 1 }, 0);<a name="line.558"></a>
+<FONT color="green">559</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.559"></a>
+<FONT color="green">560</FONT> constraints.add(new LinearConstraint(new double[] { 9, 8, 0 }, Relationship.EQ, 17));<a name="line.560"></a>
+<FONT color="green">561</FONT> constraints.add(new LinearConstraint(new double[] { 0, 7, 8 }, Relationship.LEQ, 7));<a name="line.561"></a>
+<FONT color="green">562</FONT> constraints.add(new LinearConstraint(new double[] { 10, 0, 2 }, Relationship.LEQ, 10));<a name="line.562"></a>
+<FONT color="green">563</FONT> <a name="line.563"></a>
+<FONT color="green">564</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.564"></a>
+<FONT color="green">565</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.565"></a>
+<FONT color="green">566</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(false));<a name="line.566"></a>
+<FONT color="green">567</FONT> Assert.assertEquals(1.0, solution.getPoint()[0], 0.0);<a name="line.567"></a>
+<FONT color="green">568</FONT> Assert.assertEquals(1.0, solution.getPoint()[1], 0.0);<a name="line.568"></a>
+<FONT color="green">569</FONT> Assert.assertEquals(0.0, solution.getPoint()[2], 0.0);<a name="line.569"></a>
+<FONT color="green">570</FONT> Assert.assertEquals(15.0, solution.getValue(), 0.0);<a name="line.570"></a>
+<FONT color="green">571</FONT> }<a name="line.571"></a>
+<FONT color="green">572</FONT> <a name="line.572"></a>
+<FONT color="green">573</FONT> @Test<a name="line.573"></a>
+<FONT color="green">574</FONT> public void testTrivialModel() {<a name="line.574"></a>
+<FONT color="green">575</FONT> LinearObjectiveFunction f = new LinearObjectiveFunction(new double[] { 1, 1 }, 0);<a name="line.575"></a>
+<FONT color="green">576</FONT> Collection<LinearConstraint> constraints = new ArrayList<LinearConstraint>();<a name="line.576"></a>
+<FONT color="green">577</FONT> constraints.add(new LinearConstraint(new double[] { 1, 1 }, Relationship.EQ, 0));<a name="line.577"></a>
+<FONT color="green">578</FONT> <a name="line.578"></a>
+<FONT color="green">579</FONT> SimplexSolver solver = new SimplexSolver();<a name="line.579"></a>
+<FONT color="green">580</FONT> PointValuePair solution = solver.optimize(DEFAULT_MAX_ITER, f, new LinearConstraintSet(constraints),<a name="line.580"></a>
+<FONT color="green">581</FONT> GoalType.MAXIMIZE, new NonNegativeConstraint(true));<a name="line.581"></a>
+<FONT color="green">582</FONT> Assert.assertEquals(0, solution.getValue(), .0000001);<a name="line.582"></a>
+<FONT color="green">583</FONT> }<a name="line.583"></a>
+<FONT color="green">584</FONT> <a name="line.584"></a>
+<FONT color="green">585</FONT> @Test<a name="line.585"></a>
+<FONT color="green">586</FONT> public void testLargeModel() {<a name="line.586"></a>
+<FONT color="green">587</FONT> double[] objective = new double[] {<a name="line.587"></a>
+<FONT color="green">588</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.588"></a>
+<FONT color="green">589</FONT> 1, 1, 12, 1, 1, 1, 1, 1, 1, 1,<a name="line.589"></a>
+<FONT color="green">590</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.590"></a>
+<FONT color="green">591</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.591"></a>
+<FONT color="green">592</FONT> 12, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.592"></a>
+<FONT color="green">593</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.593"></a>
+<FONT color="green">594</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 12, 1,<a name="line.594"></a>
+<FONT color="green">595</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.595"></a>
+<FONT color="green">596</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.596"></a>
+<FONT color="green">597</FONT> 1, 1, 1, 1, 1, 1, 12, 1, 1, 1,<a name="line.597"></a>
+<FONT color="green">598</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.598"></a>
+<FONT color="green">599</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.599"></a>
+<FONT color="green">600</FONT> 1, 1, 1, 1, 12, 1, 1, 1, 1, 1,<a name="line.600"></a>
+<FONT color="green">601</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.601"></a>
+<FONT color="green">602</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.602"></a>
+<FONT color="green">603</FONT> 1, 1, 12, 1, 1, 1, 1, 1, 1, 1,<a name="line.603"></a>
+<FONT color="green">604</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.604"></a>
+<FONT color="green">605</FONT> 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,<a name="line.605"></a>
[... 174 lines stripped ...]