[Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #28: CbcModel.cpp:517: void CbcModel::branchAndBound(int): Assertion `lower[i]<1.0e10' failed.

COIN-OR Branch-and-Cut MIP Solver coin-trac at coin-or.org
Thu Aug 9 07:21:34 EDT 2007


#28: CbcModel.cpp:517: void CbcModel::branchAndBound(int): Assertion
`lower[i]<1.0e10' failed.
------------------------+---------------------------------------------------
 Reporter:  kim         |       Owner:  somebody
     Type:  defect      |      Status:  new     
 Priority:  major       |   Milestone:          
Component:  component1  |     Version:          
 Keywords:              |  
------------------------+---------------------------------------------------
 I will attach the mps file.

 {{{
 pre at betelgeuse:~/trunk/solver$ cbc assertion-lower.mps
 At line 1 NAME          BLANK
 At line 2 ROWS
 At line 605 COLUMNS
 At line 4035 RHS
 At line 4245 BOUNDS
 At line 4692 ENDATA
 Problem BLANK has 601 rows, 579 columns and 6195 elements
 Optimal - objective value 1.60267e+06
 Cgl0003I 0 fixed, 25 tightened bounds, 94 strengthened rows, 12
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 94 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 10 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions
 Cgl0004I processed model has 256 rows, 137 columns (110 integer) and 1211
 elements
 Optimal - objective value 1.60267e+06
 110 integer variables and 25 variables could be made integer
 cbc: CbcModel.cpp:517: void CbcModel::branchAndBound(int): Assertion
 `lower[i]<1.0e10' failed.
 Aborted
 pre at betelgeuse:~/trunk/solver$
 }}}

-- 
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/28>
COIN-OR Branch-and-Cut MIP Solver <http://projects.coin-or.org/Cbc>
An LP-based branch-and-cut MIP solver.



More information about the Cbc-tickets mailing list