 Timestamp:
 Oct 14, 2007 6:44:03 PM (13 years ago)
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

trunk/Cbc/src/CbcFathomDynamicProgramming.cpp
r765 r825 260 260 indices_ = new int [numberActive_]; 261 261 cost_ = new double [size_]; 262 CoinFillN(cost_,size_, DBL_MAX);262 CoinFillN(cost_,size_,COIN_DBL_MAX); 263 263 // but do nothing is okay 264 264 cost_[0]=0.0; … … 475 475 int i; 476 476 // may be possible 477 double bestAtTarget = DBL_MAX;477 double bestAtTarget = COIN_DBL_MAX; 478 478 for (i=0;i<numberColumns;i++) { 479 479 if (size_>10000000&&(i%100)==0) … … 494 494 returnCode=1; 495 495 int needed=0; 496 double bestValue= DBL_MAX;496 double bestValue=COIN_DBL_MAX; 497 497 int iBest=1; 498 498 if (algorithm_==0) { … … 554 554 delete [] lower; 555 555 } 556 if (bestValue< DBL_MAX) {556 if (bestValue<COIN_DBL_MAX) { 557 557 bestValue += fixedObj; 558 558 if (model_>messageHandler()>logLevel()>1) … … 565 565 int n=decodeBitPattern(iBestback_[iBest],indices_,numberRows); 566 566 // Search for cheapest 567 double bestCost= DBL_MAX;567 double bestCost=COIN_DBL_MAX; 568 568 int iColumn=1; 569 569 for (i=0;i<numberColumns;i++) { … … 709 709 if (kMask==0) { 710 710 double thisCost = cost_[i]; 711 if (thisCost!= DBL_MAX) {711 if (thisCost!=COIN_DBL_MAX) { 712 712 // possible 713 713 double newCost=thisCost+cost; … … 824 824 if (good) { 825 825 double thisCost = cost_[i]; 826 if (thisCost!= DBL_MAX) {826 if (thisCost!=COIN_DBL_MAX) { 827 827 // possible 828 828 double newCost=thisCost+cost; … … 900 900 if (kMask==0) { 901 901 double thisCost = cost_[i]; 902 if (thisCost!= DBL_MAX) {902 if (thisCost!=COIN_DBL_MAX) { 903 903 // possible 904 904 double newCost=thisCost+cost; … … 927 927 if (added == 0) { 928 928 double thisCost = cost_[i]; 929 if (thisCost!= DBL_MAX) {929 if (thisCost!=COIN_DBL_MAX) { 930 930 // possible 931 931 double newCost=thisCost+cost;
Note: See TracChangeset
for help on using the changeset viewer.