 Timestamp:
 Jun 21, 2007 6:59:56 AM (12 years ago)
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

trunk/Cbc/src/CbcModel.cpp
r536 r633 418 418 strongInfo_[2]=0; 419 419 numberStrongIterations_ = 0; 420 #ifndef NDEBUG 421 { 422 int n = solver_>getNumCols(); 423 int i; 424 const double *lower = solver_>getColLower() ; 425 const double *upper = solver_>getColUpper() ; 426 for (i=0;i<n;i++) { 427 assert (lower[i]<1.0e10); 428 assert (upper[i]>1.0e10); 429 } 430 n = solver_>getNumRows(); 431 lower = solver_>getRowLower() ; 432 upper = solver_>getRowUpper() ; 433 for (i=0;i<n;i++) { 434 assert (lower[i]<1.0e10); 435 assert (upper[i]>1.0e10); 436 } 437 } 438 #endif 420 439 // original solver (only set if preprocessing) 421 440 OsiSolverInterface * originalSolver=NULL; … … 3868 3887 generator_[i]>mustCallAgain()) 3869 3888 keepGoing=true; // say must go round 3889 // Check last cut to see if infeasible 3890 int numberRowCutsAfter = theseCuts.sizeRowCuts() ; 3891 if(numberRowCutsBefore < numberRowCutsAfter) { 3892 const OsiRowCut * thisCut = theseCuts.rowCutPtr(numberRowCutsAfter1) ; 3893 if (thisCut>lb()>thisCut>ub()) { 3894 feasible = false; // subproblem is infeasible 3895 break; 3896 } 3897 } 3870 3898 #ifdef CBC_DEBUG 3871 3899 {
Note: See TracChangeset
for help on using the changeset viewer.