[Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #80: assertion failure CBC releases 2.3.0 on tiny IP

COIN-OR Branch-and-Cut MIP Solver coin-trac at coin-or.org
Mon Sep 14 14:52:26 EDT 2009


#80: assertion failure CBC releases 2.3.0 on tiny IP
------------------------+---------------------------------------------------
 Reporter:  mgalati     |       Owner:  somebody
     Type:  defect      |      Status:  new     
 Priority:  major       |   Milestone:          
Component:  component1  |     Version:          
 Keywords:              |  
------------------------+---------------------------------------------------
 {{{
 http://coral.ie.lehigh.edu/~magh/tmp/subProbN_MC2KP02.n21.c2.p4.b0.lp

 decomp_mmkp: ../../../../Cgl/src/CglPreProcess/CglPreProcess.cpp:3731:
 OsiSolverInterface* CglPreProcess::modified(OsiSolverInterface*, bool,
 int&, int, int): Assertion `newValue' failed.
 Aborted

 [magala at orclus71 src]$ ./cbc ~/COIN/coin-
 Decomp/build-g/Decomp/examples/MMKP/subProbN_MC2KP02.n21.c2.p4.b0.lp
 Coin Cbc and Clp Solver version 2.3.0, build Sep 10 2009
 command line - ./cbc /users/magala/COIN/coin-
 Decomp/build-g/Decomp/examples/MMKP/subProbN_MC2KP02.n21.c2.p4.b0.lp
 (default strategy 1)
 Continuous objective value is -651.24 - 0.00 seconds
 Cgl0003I 64 fixed, 0 tightened bounds, 0 strengthened rows, 0
 substitutions
 Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions
 Cgl0004I processed model has 16 rows, 78 columns (78 integer) and 211
 elements
 Cbc0038I Pass   1: suminf.    0.44444 (2) obj. -643.471 iterations 12
 Cbc0038I Pass   2: suminf.    0.44444 (2) obj. -643.471 iterations 1
 Cbc0038I Solution found of -591.576
 Cbc0038I Before mini branch and bound, 74 integers at bound fixed and 0
 continuous
 Cbc0038I Full problem 16 rows 78 columns, reduced to 1 rows 2 columns
 Cbc0038I Mini branch and bound improved solution from -591.576 to -637.123
 (0.01 seconds)
 Cbc0038I Round again with cutoff of -638.535
 Cbc0038I Reduced cost fixing fixed 24 variables on major pass 2
 Cbc0038I Pass   3: suminf.    0.44444 (2) obj. -648.259 iterations 1
 Cbc0038I Pass   4: suminf.    0.44444 (2) obj. -648.259 iterations 1
 Cbc0038I Pass   5: suminf.    0.87489 (2) obj. -638.535 iterations 12
 Cbc0038I Pass   6: suminf.    0.66667 (2) obj. -651.24 iterations 5
 Cbc0038I Pass   7: suminf.    1.48822 (4) obj. -638.535 iterations 12
 Cbc0038I Pass   8: suminf.    0.88889 (2) obj. -643.717 iterations 10
 Cbc0038I Pass   9: suminf.    0.13333 (2) obj. -638.535 iterations 12
 Cbc0038I Pass  10: suminf.    0.13333 (2) obj. -638.535 iterations 1
 Cbc0038I Pass  11: suminf.    0.44444 (2) obj. -648.259 iterations 11
 Cbc0038I Pass  12: suminf.    0.44444 (2) obj. -648.259 iterations 1
 Cbc0038I Pass  13: suminf.    0.87489 (2) obj. -638.535 iterations 9
 Cbc0038I Pass  14: suminf.    1.38192 (4) obj. -638.535 iterations 11
 Cbc0038I Solution found of -642.492
 Cbc0038I Before mini branch and bound, 64 integers at bound fixed and 0
 continuous
 Cbc0038I Full problem 16 rows 78 columns, reduced to 3 rows 10 columns
 Cbc0038I Mini branch and bound improved solution from -642.492 to -650.822
 (0.02 seconds)
 Cbc0038I Round again with cutoff of -650.906
 Cbc0038I Reduced cost fixing fixed 62 variables on major pass 3
 Cbc0038I Pass  15: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  16: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  17: suminf.    0.69823 (2) obj. -650.906 iterations 11
 Cbc0038I Pass  18: suminf.    0.66667 (2) obj. -651.24 iterations 2
 Cbc0038I Pass  19: suminf.    0.69823 (2) obj. -650.906 iterations 2
 Cbc0038I Pass  20: suminf.    0.66667 (2) obj. -651.24 iterations 2
 Cbc0038I Pass  21: suminf.    0.66667 (2) obj. -651.24 iterations 0
 Cbc0038I Pass  22: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  23: suminf.    0.66667 (2) obj. -651.24 iterations 0
 Cbc0038I Pass  24: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  25: suminf.    0.66667 (2) obj. -651.24 iterations 0
 Cbc0038I Pass  26: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  27: suminf.    0.69823 (2) obj. -650.906 iterations 2
 Cbc0038I Pass  28: suminf.    0.66667 (2) obj. -651.24 iterations 2
 Cbc0038I Pass  29: suminf.    0.66667 (2) obj. -651.24 iterations 0
 Cbc0038I Pass  30: suminf.    0.66667 (2) obj. -651.24 iterations 2
 Cbc0038I Pass  31: suminf.    0.69823 (2) obj. -650.906 iterations 2
 Cbc0038I Pass  32: suminf.    0.66667 (2) obj. -651.24 iterations 2
 Cbc0038I Pass  33: suminf.    0.66667 (2) obj. -651.24 iterations 0
 Cbc0038I Pass  34: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  35: suminf.    0.69823 (2) obj. -650.906 iterations 2
 Cbc0038I Pass  36: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  37: suminf.    0.69823 (2) obj. -650.906 iterations 1
 Cbc0038I Pass  38: suminf.    0.69823 (2) obj. -650.906 iterations 2
 Cbc0038I Pass  39: suminf.    0.69823 (2) obj. -650.906 iterations 0
 Cbc0038I Pass  40: suminf.    0.66667 (2) obj. -651.24 iterations 2
 Cbc0038I Pass  41: suminf.    0.66667 (2) obj. -651.24 iterations 0
 Cbc0038I Pass  42: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I Pass  43: suminf.    0.66667 (2) obj. -651.24 iterations 0
 Cbc0038I Pass  44: suminf.    0.66667 (2) obj. -651.24 iterations 1
 Cbc0038I No solution found this major pass
 Cbc0038I Before mini branch and bound, 76 integers at bound fixed and 0
 continuous
 Cbc0038I Full problem 16 rows 78 columns, reduced to 0 rows 0 columns
 Cbc0038I Mini branch and bound did not improve solution (0.04 seconds)
 Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of
 -650.822 - took 0.04 seconds
 Cbc0012I Integer solution of -650.822 found by feasibility pump after 0
 iterations and 0 nodes (0.04 seconds)
 cbc: ../../../../Cgl/src/CglPreProcess/CglPreProcess.cpp:3731:
 OsiSolverInterface* CglPreProcess::modified(OsiSolverInterface*, bool,
 int&, int, int): Assertion `newValue' failed.
 Aborted
 }}}

-- 
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/80>
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