- Timestamp:
- Sep 25, 2009 11:26:48 AM (12 years ago)
- Location:
- trunk/Clp/src
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/Clp/src/ClpDualRowSteepest.cpp
r1377 r1436 537 537 // could re-initialize here (could be expensive) 538 538 norm /= model_->alpha() * model_->alpha(); 539 539 assert(model_->alpha()); 540 540 assert(norm); 541 541 // pivot element -
trunk/Clp/src/ClpModel.hpp
r1424 r1436 18 18 #include "CoinMessageHandler.hpp" 19 19 #include "CoinHelperFunctions.hpp" 20 #include "CoinFinite.hpp" 20 21 #include "ClpParameters.hpp" 21 22 #include "ClpObjective.hpp" 22 23 class ClpEventHandler; 23 24 // Plus infinity25 #ifndef COIN_DBL_MAX26 #define COIN_DBL_MAX DBL_MAX27 #endif28 29 24 /** This is the base class for Linear and quadratic Models 30 25 This knows nothing about the algorithm, but it seems to -
trunk/Clp/src/ClpSimplexDual.cpp
r1434 r1436 3818 3818 } 3819 3819 3820 if (sequenceIn_>=0) {3821 3820 #ifdef MORE_CAREFUL 3822 3821 // If we have done pivots and things look bad set alpha_ 0.0 to force factorization 3823 if (badSumPivots) { 3822 if (badSumPivots|| 3823 fabs(theta_*badFree)>10.0*dualTolerance_&&factorization_->pivots()) { 3824 3824 if (handler_->logLevel()>1) 3825 3825 printf("forcing re-factorization\n"); 3826 alpha_=0.0; 3827 } 3828 if (fabs(theta_*badFree)>10.0*dualTolerance_&&factorization_->pivots()) { 3829 if (handler_->logLevel()>1) 3830 printf("forcing re-factorizationon free\n"); 3831 alpha_=0.0; 3832 } 3833 #endif 3826 sequenceIn_=-1; 3827 } 3828 #endif 3829 if (sequenceIn_>=0) { 3834 3830 lowerIn_ = lower_[sequenceIn_]; 3835 3831 upperIn_ = upper_[sequenceIn_]; … … 3896 3892 lowerIn_=valueIn_; 3897 3893 } 3894 } else { 3895 // no pivot 3896 bestPossible=0.0; 3897 alpha_=0.0; 3898 3898 } 3899 3899 //if (thisIncrease)
Note: See TracChangeset
for help on using the changeset viewer.