| Prev | Next | Top | Equation2_1 |
<document>
<category>lp</category>
<solver>Clp</solver>
<inputMethod>MPS</inputMethod>
<comments><![CDATA[
Equation 2.1 in Vasek Chvatal's book: Linear Programming
maximize 5*x1 + 4*x2 + 3*x3
subject to 2*x1 + 3*x2 + x3 <= 5
4*x1 + x2 + 2*x3 <= 11
3*x1 + 4*x2 + 2*x3 <= 8
x1 , x2 , x3 >= 0
The solution is x1 = 2, x2 = 0, x3 = 1
The residuals are 0=s1=5-r1, 1=s2=11-r2, 0=s3=8-r3
]]></comments>
<MPS><![CDATA[*
*Op Name0--- Name1--- Value1------ Name2--- Value2------
*23 56789012 56789012 567890123456 01234567 012345678901
NAME CE-2.1
ROWS
N z
L r1
L r2
L r3
COLUMNS
x1 z 5 r1 2
x1 r2 4 r3 3
*
x2 z 4 r1 3
x2 r2 1 r3 4
*
x3 z 3 r1 1
x3 r2 2 r3 2
RHS
b r1 5
b r2 11
b r3 8
ENDATA
*]]></MPS>
<param><![CDATA[
maximize
primalSimplex
solution -
]]></param>
</document>
%%%%%%%%%%%%%%%%%%%% CLP Results %%%%%%%%%%%%%%%%%%%%
Load Avg: ( 0.08 , 0.03 , 0.14 )
Coin LP version 1.02.02, build Mar 20 2006
command line - /home/neos/neos-bin/clp clp.mps -
At line 4 NAME CE-2.1
At line 5 ROWS
At line 10 COLUMNS
At line 19 RHS
At line 23 ENDATA
Problem CE-2.1 has 3 rows, 3 columns and 9 elements
Model was imported from ./clp.mps in 0 seconds
Switching to line mode
Clp:Clp:Clp:Presolve 3 (0) rows, 3 (0) columns and 9 (0) elements
0 Obj -0 Dual inf 7.47056 (3)
4 Obj 13
Optimal - objective value 13
Optimal objective 13 - 4 iterations time 0.002
Clp:
0 x1 2 -2.8223853e-16
1 x2 0 -3
2 x3 1 5.647295e-16
%%%%%%%%%%%%%%%%%%%% CLP Results %%%%%%%%%%%%%%%%%%%%