Prev Next Top Problem3_9a

Neos Clp Input and Output For Problem 3.9a

Input
You may find that, for this input example, problem3_9a.htm gives better copy and paste results than problem3_9a.xml :
<document>

<category>lp</category>
<solver>Clp</solver>
<inputMethod>MPS</inputMethod>

<comments><![CDATA[
maximize    3*x1 + x2
subject to    x1 - x2 <= - 1
            - x1 - x2 <= - 3
            2*x1 + x2 <=   4
              x1 , x2 >= 0
The corresponding optimal solution is
     x1 = 1, x2 = 2, r1 = -1, r2 = -3, r3 = 4
]]></comments>

<MPS><![CDATA[*
*Op Name0---  Name1---  Value1------   Name2---  Value2------
*23 56789012  56789012  567890123456   01234567  012345678901
NAME          P-3.9a
ROWS
 N  z
 L  r1
 L  r2
 L  r3
COLUMNS
    x1        z         3              r1         1
    x1        r2        -1             r3         2
*
    x2        z         1              r1         -1
    x2        r2        -1             r3         1
RHS
    b         r1        -1
    b         r2        -3
    b         r3        4
ENDATA
*]]></MPS>

<param><![CDATA[
maximize
primalSimplex
solution -
]]></param>

</document>
Output
%%%%%%%%%%%%%%%%%%%% CLP Results %%%%%%%%%%%%%%%%%%%%

Load Avg: ( 0.0 , 0.0 , 0.0 )
Coin LP version 1.02.02, build Mar 20 2006
command line - /home/neos/neos-bin/clp clp.mps - 
At line 4 NAME          P-3.9a
At line 5 ROWS
At line 10 COLUMNS
At line 16 RHS
At line 20 ENDATA
Problem CP-2.2 has 3 rows, 2 columns and 6 elements
Model was imported from ./clp.mps in -6.60686e-19 seconds
Switching to line mode
Clp:Clp:Clp:Presolve 0 (-3) rows, 0 (-2) columns and 0 (-6) elements
Empty problem - 0 rows, 0 columns and 0 elements
Optimal - objective value 5
After Postsolve, objective 5, infeasibilities - dual 0 (0), primal 0 (0)
Optimal objective 5 - 0 iterations time 0.002, Presolve -0.00
Clp:
      0 x1                    1          1.6653345e-16
      1 x2                    2          5.5511151e-17
Clp:

%%%%%%%%%%%%%%%%%%%% CLP Results %%%%%%%%%%%%%%%%%%%%
Input File: Problem3_9a.omh