<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
<meta name="Generator" content="Microsoft Exchange Server">
<!-- converted from rtf -->
<style><!-- .EmailQuote { margin-left: 1pt; padding-left: 4pt; border-left: #800000 2px solid; } --></style>
</head>
<body>
<font face="Calibri, sans-serif" size="2">
<div>Hi,</div>
<div> </div>
<div>I am obtaining the following error via CBC 2.3 stable (built as of this AM following an svn update) on the miplib2003 “fiber.mps” instance (on a vanilla redhat 64-bit linux system):</div>
<div> </div>
<div>Coin:import fiber.mps</div>
<div>At line 1 NAME fiber</div>
<div>At line 2 ROWS</div>
<div>At line 367 COLUMNS</div>
<div>At line 2491 RHS</div>
<div>At line 2522 BOUNDS</div>
<div>At line 3777 ENDATA</div>
<div>Problem fiber has 363 rows, 1298 columns and 2944 elements</div>
<div>Coin:solve</div>
<div>Continuous objective value is 156083 - 0.00 seconds</div>
<div>Cgl0002I 3 variables fixed</div>
<div>Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions</div>
<div>Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions</div>
<div>Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions</div>
<div>Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions</div>
<div>Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions</div>
<div>Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions</div>
<div>Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions</div>
<div>Cgl0004I processed model has 290 rows, 1055 columns (1055 integer) and 2465 elements</div>
<div>Cbc0006I The LP relaxation is infeasible or too expensive</div>
<div>Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308</div>
<div>Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)</div>
<div>Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)</div>
<div>Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)</div>
<div>Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)</div>
<div>MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)</div>
<div>FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)</div>
<div>TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)</div>
<div>Result - Finished objective 3983 after 0 nodes and 0 iterations - took 0.05 seconds (total time 4.83)</div>
<div> </div>
<div>The LP relaxation is definitely feasible, and it doesn’t look all that expense based on statistics. </div>
<div> </div>
<div>Any ideas?</div>
<div> </div>
<div>Thanks,</div>
<div> </div>
<div>Jean-Paul</div>
<div> </div>
<div>--</div>
<div> </div>
<div>Dr. Jean-Paul Watson</div>
<div>Discrete Math and Complex Systems Department</div>
<div>Sandia National Laboratories</div>
<div>P.O. Box 5800, MS 1318</div>
<div>Albuquerque, NM 87185-1318</div>
<div>(505) 845-8887</div>
<div>jwatson@sandia.gov</div>
<div> </div>
<div> </div>
<div> </div>
<div> </div>
<div> </div>
</font>
</body>
</html>