[Coin-lpsolver] Clp Executable Error message

Brad Bell bradbell at apl.washington.edu
Thu Aug 17 10:35:57 EDT 2006


What does the following message mean ?

On Thu, 17 Aug 2006 neos at mcs.anl.gov wrote:

> You are using the solver clp-mps.
>
> \%%%%%%%%%%%%%%%%%%%% CLP Results %%%%%%%%%%%%%%%%%%%%
>
> Load Avg: ( 0.0 , 0.0 , 0.0 )
> /home/neos/neos-bin/clp: /usr/lib/libstdc++.so.6: version `CXXABI_1.3.1' not found (required by /home/neos/neos-bin/clp)
> /home/neos/neos-bin/clp: /usr/lib/libstdc++.so.6: version `CXXABI_1.3.1' not found (required by /home/neos/COIN/lib/libClp.so)
> /home/neos/neos-bin/clp: /usr/lib/libstdc++.so.6: version `CXXABI_1.3.1' not found (required by /home/neos/COIN/lib/libCoin.so)
>  Error (256) in /home/neos/neos-bin/clp clp.mps - < clp.par
>
>
> %%%%%%%%%%%%%%%%%%%% CLP Results %%%%%%%%%%%%%%%%%%%%
>

I got it in response to the attached Neos Input file.
-------------- next part --------------
<document>

<priority>short</priority>

<category>lp</category>

<solver>Clp</solver>

<inputMethod>MPS</inputMethod>



<comments><![CDATA[

maximize     x1 +   x2 +   x3         w.r.t x in R+^3

subject to   x1 + 2*x2        <= 5

                    x2 + 2*x3 <= 5

           2*x1 +          x3 <= 5

]]></comments>

<MPS><![CDATA[*

*Op Name0---  Name1---  Value1------

*23 56789012  56789012  567890123456

NAME          0<=x1, 0<=x2, 0<=x3

ROWS

 N  z

 L  r1

 L  r2

 L  r3

COLUMNS

*Op Name0---  Name1---  Value1------

    x1        z         1

    x1        r1        1

    x1        r2        0

    x1        r3        2

*

    x2        z         1

    x2        r1        2

    x2        r2        1

    x2        r3        0

*

    x3        z         1

    x3        r1        0

    x3        r2        2

    x3        r3        1

*

RHS

    rhs       r1        5

    rhs       r2        5

    rhs       r3        5

BOUNDS

 PL bnd       x1 

 PL bnd       x2

 PL bnd       x3

ENDATA

*]]></MPS>



<param><![CDATA[

maximize

primalSimplex

solution -

]]></param>



</document>



More information about the Clp mailing list