Changeset 1502
 Timestamp:
 Jan 29, 2010 9:25:07 AM (11 years ago)
 Location:
 trunk/Clp/src
 Files:

 54 edited
Legend:
 Unmodified
 Added
 Removed

trunk/Clp/src/CbcOrClpParam.cpp
r1453 r1502 25 25 #include "ClpFactorization.hpp" 26 26 #endif 27 #ifdef COIN_HAS_READLINE 27 #ifdef COIN_HAS_READLINE 28 28 #include <readline/readline.h> 29 29 #include <readline/history.h> … … 31 31 #ifdef COIN_HAS_CBC 32 32 // from CoinSolve 33 static char coin_prompt[] ="Coin:";33 static char coin_prompt[] = "Coin:"; 34 34 #else 35 static char coin_prompt[] ="Clp:";35 static char coin_prompt[] = "Clp:"; 36 36 #endif 37 37 #ifdef CLP_CILK … … 45 45 #endif 46 46 #endif 47 static bool doPrinting =true;48 std::string afterEquals ="";47 static bool doPrinting = true; 48 std::string afterEquals = ""; 49 49 static char printArray[200]; 50 50 void setCbcOrClpPrinting(bool yesNo) 51 51 { 52 doPrinting=yesNo;52 doPrinting = yesNo; 53 53 } 54 54 //############################################################################# … … 57 57 58 58 // 59 // Default Constructor 59 // Default Constructor 60 60 // 61 CbcOrClpParam::CbcOrClpParam () 62 : type_(INVALID),63 lowerDoubleValue_(0.0),64 upperDoubleValue_(0.0),65 lowerIntValue_(0),66 upperIntValue_(0),67 lengthName_(0),68 lengthMatch_(0),69 definedKeyWords_(),70 name_(),71 shortHelp_(),72 longHelp_(),73 action_(INVALID),74 currentKeyWord_(1),75 display_(0),76 intValue_(1),77 doubleValue_(1.0),78 stringValue_(""),79 whereUsed_(7)61 CbcOrClpParam::CbcOrClpParam () 62 : type_(CBC_PARAM_NOTUSED_INVALID), 63 lowerDoubleValue_(0.0), 64 upperDoubleValue_(0.0), 65 lowerIntValue_(0), 66 upperIntValue_(0), 67 lengthName_(0), 68 lengthMatch_(0), 69 definedKeyWords_(), 70 name_(), 71 shortHelp_(), 72 longHelp_(), 73 action_(CBC_PARAM_NOTUSED_INVALID), 74 currentKeyWord_(1), 75 display_(0), 76 intValue_(1), 77 doubleValue_(1.0), 78 stringValue_(""), 79 whereUsed_(7) 80 80 { 81 81 } 82 82 // Other constructors 83 83 CbcOrClpParam::CbcOrClpParam (std::string name, std::string help, 84 85 86 : type_(type),87 lowerIntValue_(0),88 upperIntValue_(0),89 definedKeyWords_(),90 name_(name),91 shortHelp_(help),92 longHelp_(),93 action_(type),94 currentKeyWord_(1),95 display_(display),96 intValue_(1),97 doubleValue_(1.0),98 stringValue_(""),99 whereUsed_(7)100 { 101 lowerDoubleValue_ = lower;102 upperDoubleValue_ = upper;103 gutsOfConstructor();84 double lower, double upper, CbcOrClpParameterType type, 85 int display) 86 : type_(type), 87 lowerIntValue_(0), 88 upperIntValue_(0), 89 definedKeyWords_(), 90 name_(name), 91 shortHelp_(help), 92 longHelp_(), 93 action_(type), 94 currentKeyWord_(1), 95 display_(display), 96 intValue_(1), 97 doubleValue_(1.0), 98 stringValue_(""), 99 whereUsed_(7) 100 { 101 lowerDoubleValue_ = lower; 102 upperDoubleValue_ = upper; 103 gutsOfConstructor(); 104 104 } 105 105 CbcOrClpParam::CbcOrClpParam (std::string name, std::string help, 106 107 108 : type_(type),109 lowerDoubleValue_(0.0),110 upperDoubleValue_(0.0),111 definedKeyWords_(),112 name_(name),113 shortHelp_(help),114 longHelp_(),115 action_(type),116 currentKeyWord_(1),117 display_(display),118 intValue_(1),119 doubleValue_(1.0),120 stringValue_(""),121 whereUsed_(7)122 { 123 gutsOfConstructor();124 lowerIntValue_ = lower;125 upperIntValue_ = upper;106 int lower, int upper, CbcOrClpParameterType type, 107 int display) 108 : type_(type), 109 lowerDoubleValue_(0.0), 110 upperDoubleValue_(0.0), 111 definedKeyWords_(), 112 name_(name), 113 shortHelp_(help), 114 longHelp_(), 115 action_(type), 116 currentKeyWord_(1), 117 display_(display), 118 intValue_(1), 119 doubleValue_(1.0), 120 stringValue_(""), 121 whereUsed_(7) 122 { 123 gutsOfConstructor(); 124 lowerIntValue_ = lower; 125 upperIntValue_ = upper; 126 126 } 127 127 // Other strings will be added by append 128 CbcOrClpParam::CbcOrClpParam (std::string name, std::string help, 129 130 CbcOrClpParameterType type,int whereUsed,131 132 : type_(type),133 lowerDoubleValue_(0.0),134 upperDoubleValue_(0.0),135 lowerIntValue_(0),136 upperIntValue_(0),137 definedKeyWords_(),138 name_(name),139 shortHelp_(help),140 longHelp_(),141 action_(type),142 currentKeyWord_(0),143 display_(display),144 intValue_(1),145 doubleValue_(1.0),146 stringValue_(""),147 whereUsed_(whereUsed)148 { 149 gutsOfConstructor();150 definedKeyWords_.push_back(firstValue);128 CbcOrClpParam::CbcOrClpParam (std::string name, std::string help, 129 std::string firstValue, 130 CbcOrClpParameterType type, int whereUsed, 131 int display) 132 : type_(type), 133 lowerDoubleValue_(0.0), 134 upperDoubleValue_(0.0), 135 lowerIntValue_(0), 136 upperIntValue_(0), 137 definedKeyWords_(), 138 name_(name), 139 shortHelp_(help), 140 longHelp_(), 141 action_(type), 142 currentKeyWord_(0), 143 display_(display), 144 intValue_(1), 145 doubleValue_(1.0), 146 stringValue_(""), 147 whereUsed_(whereUsed) 148 { 149 gutsOfConstructor(); 150 definedKeyWords_.push_back(firstValue); 151 151 } 152 152 // Action 153 153 CbcOrClpParam::CbcOrClpParam (std::string name, std::string help, 154 CbcOrClpParameterType type,int whereUsed,155 156 : type_(type),157 lowerDoubleValue_(0.0),158 upperDoubleValue_(0.0),159 lowerIntValue_(0),160 upperIntValue_(0),161 definedKeyWords_(),162 name_(name),163 shortHelp_(help),164 longHelp_(),165 action_(type),166 currentKeyWord_(1),167 display_(display),168 intValue_(1),169 doubleValue_(1.0),170 stringValue_("")171 { 172 whereUsed_=whereUsed;173 gutsOfConstructor();154 CbcOrClpParameterType type, int whereUsed, 155 int display) 156 : type_(type), 157 lowerDoubleValue_(0.0), 158 upperDoubleValue_(0.0), 159 lowerIntValue_(0), 160 upperIntValue_(0), 161 definedKeyWords_(), 162 name_(name), 163 shortHelp_(help), 164 longHelp_(), 165 action_(type), 166 currentKeyWord_(1), 167 display_(display), 168 intValue_(1), 169 doubleValue_(1.0), 170 stringValue_("") 171 { 172 whereUsed_ = whereUsed; 173 gutsOfConstructor(); 174 174 } 175 175 176 176 // 177 // Copy constructor 177 // Copy constructor 178 178 // 179 CbcOrClpParam::CbcOrClpParam (const CbcOrClpParam & rhs) 180 { 181 type_ = rhs.type_; 182 lowerDoubleValue_ = rhs.lowerDoubleValue_; 183 upperDoubleValue_ = rhs.upperDoubleValue_; 184 lowerIntValue_ = rhs.lowerIntValue_; 185 upperIntValue_ = rhs.upperIntValue_; 186 lengthName_ = rhs.lengthName_; 187 lengthMatch_ = rhs.lengthMatch_; 188 definedKeyWords_ = rhs.definedKeyWords_; 189 name_ = rhs.name_; 190 shortHelp_ = rhs.shortHelp_; 191 longHelp_ = rhs.longHelp_; 192 action_ = rhs.action_; 193 currentKeyWord_ = rhs.currentKeyWord_; 194 display_=rhs.display_; 195 intValue_=rhs.intValue_; 196 doubleValue_=rhs.doubleValue_; 197 stringValue_=rhs.stringValue_; 198 whereUsed_=rhs.whereUsed_; 199 } 200 201 // 202 // Destructor 203 // 204 CbcOrClpParam::~CbcOrClpParam () 205 { 206 } 207 208 // 209 // Assignment operator 210 // 211 CbcOrClpParam & 212 CbcOrClpParam::operator=(const CbcOrClpParam& rhs) 213 { 214 if (this != &rhs) { 179 CbcOrClpParam::CbcOrClpParam (const CbcOrClpParam & rhs) 180 { 215 181 type_ = rhs.type_; 216 182 lowerDoubleValue_ = rhs.lowerDoubleValue_; … … 226 192 action_ = rhs.action_; 227 193 currentKeyWord_ = rhs.currentKeyWord_; 228 display_=rhs.display_; 229 intValue_=rhs.intValue_; 230 doubleValue_=rhs.doubleValue_; 231 stringValue_=rhs.stringValue_; 232 whereUsed_=rhs.whereUsed_; 233 } 234 return *this; 235 } 236 void 194 display_ = rhs.display_; 195 intValue_ = rhs.intValue_; 196 doubleValue_ = rhs.doubleValue_; 197 stringValue_ = rhs.stringValue_; 198 whereUsed_ = rhs.whereUsed_; 199 } 200 201 // 202 // Destructor 203 // 204 CbcOrClpParam::~CbcOrClpParam () 205 { 206 } 207 208 // 209 // Assignment operator 210 // 211 CbcOrClpParam & 212 CbcOrClpParam::operator=(const CbcOrClpParam & rhs) 213 { 214 if (this != &rhs) { 215 type_ = rhs.type_; 216 lowerDoubleValue_ = rhs.lowerDoubleValue_; 217 upperDoubleValue_ = rhs.upperDoubleValue_; 218 lowerIntValue_ = rhs.lowerIntValue_; 219 upperIntValue_ = rhs.upperIntValue_; 220 lengthName_ = rhs.lengthName_; 221 lengthMatch_ = rhs.lengthMatch_; 222 definedKeyWords_ = rhs.definedKeyWords_; 223 name_ = rhs.name_; 224 shortHelp_ = rhs.shortHelp_; 225 longHelp_ = rhs.longHelp_; 226 action_ = rhs.action_; 227 currentKeyWord_ = rhs.currentKeyWord_; 228 display_ = rhs.display_; 229 intValue_ = rhs.intValue_; 230 doubleValue_ = rhs.doubleValue_; 231 stringValue_ = rhs.stringValue_; 232 whereUsed_ = rhs.whereUsed_; 233 } 234 return *this; 235 } 236 void 237 237 CbcOrClpParam::gutsOfConstructor() 238 238 { 239 std::string::size_type shriekPos = name_.find('!');240 lengthName_ = name_.length();241 if ( shriekPos==std::string::npos ) {242 //does not contain '!'243 lengthMatch_= lengthName_;244 } else {245 lengthMatch_=shriekPos;246 name_ = name_.substr(0,shriekPos)+name_.substr(shriekPos+1);247 lengthName_;248 }239 std::string::size_type shriekPos = name_.find('!'); 240 lengthName_ = name_.length(); 241 if ( shriekPos == std::string::npos ) { 242 //does not contain '!' 243 lengthMatch_ = lengthName_; 244 } else { 245 lengthMatch_ = shriekPos; 246 name_ = name_.substr(0, shriekPos) + name_.substr(shriekPos + 1); 247 lengthName_; 248 } 249 249 } 250 250 // Returns length of name for printing 251 int 251 int 252 252 CbcOrClpParam::lengthMatchName ( ) const 253 253 { 254 if (lengthName_==lengthMatch_)255 return lengthName_;256 else257 return lengthName_+2;254 if (lengthName_ == lengthMatch_) 255 return lengthName_; 256 else 257 return lengthName_ + 2; 258 258 } 259 259 // Insert string (only valid for keywords) 260 void 260 void 261 261 CbcOrClpParam::append(std::string keyWord) 262 262 { 263 definedKeyWords_.push_back(keyWord);263 definedKeyWords_.push_back(keyWord); 264 264 } 265 265 266 int 266 int 267 267 CbcOrClpParam::matches (std::string input) const 268 268 { 269 // look up strings to do more elegantly 270 if (input.length()>lengthName_) { 271 return 0; 272 } else { 273 unsigned int i; 274 for (i=0;i<input.length();i++) { 275 if (tolower(name_[i])!=tolower(input[i])) 276 break; 277 } 278 if (i<input.length()) { 279 return 0; 280 } else if (i>=lengthMatch_) { 281 return 1; 269 // look up strings to do more elegantly 270 if (input.length() > lengthName_) { 271 return 0; 282 272 } else { 283 // matched but too short 284 return 2; 285 } 286 } 273 unsigned int i; 274 for (i = 0; i < input.length(); i++) { 275 if (tolower(name_[i]) != tolower(input[i])) 276 break; 277 } 278 if (i < input.length()) { 279 return 0; 280 } else if (i >= lengthMatch_) { 281 return 1; 282 } else { 283 // matched but too short 284 return 2; 285 } 286 } 287 287 } 288 288 // Returns name which could match 289 std::string 289 std::string 290 290 CbcOrClpParam::matchName ( ) const 291 { 292 if (lengthMatch_==lengthName_)293 return name_;294 else295 return name_.substr(0,lengthMatch_)+"("+name_.substr(lengthMatch_)+")";291 { 292 if (lengthMatch_ == lengthName_) 293 return name_; 294 else 295 return name_.substr(0, lengthMatch_) + "(" + name_.substr(lengthMatch_) + ")"; 296 296 } 297 297 298 298 // Returns parameter option which matches (1 if none) 299 int 299 int 300 300 CbcOrClpParam::parameterOption ( std::string check ) const 301 301 { 302 int numberItems = definedKeyWords_.size(); 303 if (!numberItems) { 304 return 1; 305 } else { 306 int whichItem=0; 302 int numberItems = definedKeyWords_.size(); 303 if (!numberItems) { 304 return 1; 305 } else { 306 int whichItem = 0; 307 unsigned int it; 308 for (it = 0; it < definedKeyWords_.size(); it++) { 309 std::string thisOne = definedKeyWords_[it]; 310 std::string::size_type shriekPos = thisOne.find('!'); 311 unsigned int length1 = thisOne.length(); 312 unsigned int length2 = length1; 313 if ( shriekPos != std::string::npos ) { 314 //contains '!' 315 length2 = shriekPos; 316 thisOne = thisOne.substr(0, shriekPos) + 317 thisOne.substr(shriekPos + 1); 318 length1 = thisOne.length(); 319 } 320 if (check.length() <= length1 && length2 <= check.length()) { 321 unsigned int i; 322 for (i = 0; i < check.length(); i++) { 323 if (tolower(thisOne[i]) != tolower(check[i])) 324 break; 325 } 326 if (i < check.length()) { 327 whichItem++; 328 } else if (i >= length2) { 329 break; 330 } 331 } else { 332 whichItem++; 333 } 334 } 335 if (whichItem < numberItems) 336 return whichItem; 337 else 338 return 1; 339 } 340 } 341 // Prints parameter options 342 void 343 CbcOrClpParam::printOptions ( ) const 344 { 345 std::cout << "<Possible options for " << name_ << " are:"; 307 346 unsigned int it; 308 for (it=0;it<definedKeyWords_.size();it++) { 309 std::string thisOne = definedKeyWords_[it]; 310 std::string::size_type shriekPos = thisOne.find('!'); 311 unsigned int length1 = thisOne.length(); 312 unsigned int length2 = length1; 313 if ( shriekPos!=std::string::npos ) { 314 //contains '!' 315 length2 = shriekPos; 316 thisOne = thisOne.substr(0,shriekPos)+ 317 thisOne.substr(shriekPos+1); 318 length1 = thisOne.length(); 319 } 320 if (check.length()<=length1&&length2<=check.length()) { 321 unsigned int i; 322 for (i=0;i<check.length();i++) { 323 if (tolower(thisOne[i])!=tolower(check[i])) 324 break; 325 } 326 if (i<check.length()) { 327 whichItem++; 328 } else if (i>=length2) { 329 break; 330 } 331 } else { 332 whichItem++; 333 } 334 } 335 if (whichItem<numberItems) 336 return whichItem; 347 for (it = 0; it < definedKeyWords_.size(); it++) { 348 std::string thisOne = definedKeyWords_[it]; 349 std::string::size_type shriekPos = thisOne.find('!'); 350 if ( shriekPos != std::string::npos ) { 351 //contains '!' 352 thisOne = thisOne.substr(0, shriekPos) + 353 "(" + thisOne.substr(shriekPos + 1) + ")"; 354 } 355 std::cout << " " << thisOne; 356 } 357 assert (currentKeyWord_ >= 0 && currentKeyWord_ < static_cast<int>(definedKeyWords_.size())); 358 std::string current = definedKeyWords_[currentKeyWord_]; 359 std::string::size_type shriekPos = current.find('!'); 360 if ( shriekPos != std::string::npos ) { 361 //contains '!' 362 current = current.substr(0, shriekPos) + 363 "(" + current.substr(shriekPos + 1) + ")"; 364 } 365 std::cout << ";\n\tcurrent " << current << ">" << std::endl; 366 } 367 // Print action and string 368 void 369 CbcOrClpParam::printString() const 370 { 371 if (name_ == "directory") 372 std::cout << "Current working directory is " << stringValue_ << std::endl; 373 else if (name_.substr(0, 6) == "printM") 374 std::cout << "Current value of printMask is " << stringValue_ << std::endl; 337 375 else 338 return 1; 339 } 340 } 341 // Prints parameter options 342 void 343 CbcOrClpParam::printOptions ( ) const 344 { 345 std::cout<<"<Possible options for "<<name_<<" are:"; 346 unsigned int it; 347 for (it=0;it<definedKeyWords_.size();it++) { 348 std::string thisOne = definedKeyWords_[it]; 349 std::string::size_type shriekPos = thisOne.find('!'); 350 if ( shriekPos!=std::string::npos ) { 351 //contains '!' 352 thisOne = thisOne.substr(0,shriekPos)+ 353 "("+thisOne.substr(shriekPos+1)+")"; 354 } 355 std::cout<<" "<<thisOne; 356 } 357 assert (currentKeyWord_>=0&¤tKeyWord_<static_cast<int>(definedKeyWords_.size())); 358 std::string current = definedKeyWords_[currentKeyWord_]; 359 std::string::size_type shriekPos = current.find('!'); 360 if ( shriekPos!=std::string::npos ) { 361 //contains '!' 362 current = current.substr(0,shriekPos)+ 363 "("+current.substr(shriekPos+1)+")"; 364 } 365 std::cout<<";\n\tcurrent "<<current<<">"<<std::endl; 366 } 367 // Print action and string 368 void 369 CbcOrClpParam::printString() const 370 { 371 if (name_=="directory") 372 std::cout<<"Current working directory is "<<stringValue_<<std::endl; 373 else if (name_.substr(0,6)=="printM") 374 std::cout<<"Current value of printMask is "<<stringValue_<<std::endl; 375 else 376 std::cout<<"Current default (if $ as parameter) for "<<name_ 377 <<" is "<<stringValue_<<std::endl; 376 std::cout << "Current default (if $ as parameter) for " << name_ 377 << " is " << stringValue_ << std::endl; 378 378 } 379 379 void CoinReadPrintit(const char * input) 380 380 { 381 int length =strlen(input);382 char temp[101];383 int i;384 int n=0;385 for (i=0;i<length;i++) {386 if (input[i]=='\n') {387 temp[n]='\0';388 std::cout<<temp<<std::endl;389 n=0;390 } else if (n>=65&&input[i]==' ') {391 temp[n]='\0';392 std::cout<<temp<<std::endl;393 n=0;394 } else if (ninput[i]!=' ') {395 temp[n++]=input[i];396 }397 }398 if (n) {399 temp[n]='\0';400 std::cout<<temp<<std::endl;401 }381 int length = strlen(input); 382 char temp[101]; 383 int i; 384 int n = 0; 385 for (i = 0; i < length; i++) { 386 if (input[i] == '\n') { 387 temp[n] = '\0'; 388 std::cout << temp << std::endl; 389 n = 0; 390 } else if (n >= 65 && input[i] == ' ') { 391 temp[n] = '\0'; 392 std::cout << temp << std::endl; 393 n = 0; 394 } else if (n  input[i] != ' ') { 395 temp[n++] = input[i]; 396 } 397 } 398 if (n) { 399 temp[n] = '\0'; 400 std::cout << temp << std::endl; 401 } 402 402 } 403 403 // Print Long help 404 void 404 void 405 405 CbcOrClpParam::printLongHelp() const 406 406 { 407 if (type_>=1&&type_<400) {408 CoinReadPrintit(longHelp_.c_str());409 if (type_<SOLVERLOGLEVEL) {410 printf("<Range of values is %g to %g;\n\tcurrent %g>\n",lowerDoubleValue_,upperDoubleValue_, doubleValue_);411 assert (upperDoubleValue_>lowerDoubleValue_);412 } else if (type_<DIRECTION) {413 printf("<Range of values is %d to %d;\n\tcurrent %d>\n",lowerIntValue_,upperIntValue_,intValue_);414 assert (upperIntValue_>lowerIntValue_);415 } else if (type_<DIRECTORY) {416 printOptions();417 }418 }407 if (type_ >= 1 && type_ < 400) { 408 CoinReadPrintit(longHelp_.c_str()); 409 if (type_ < CLP_PARAM_INT_SOLVERLOGLEVEL) { 410 printf("<Range of values is %g to %g;\n\tcurrent %g>\n", lowerDoubleValue_, upperDoubleValue_, doubleValue_); 411 assert (upperDoubleValue_ > lowerDoubleValue_); 412 } else if (type_ < CLP_PARAM_STR_DIRECTION) { 413 printf("<Range of values is %d to %d;\n\tcurrent %d>\n", lowerIntValue_, upperIntValue_, intValue_); 414 assert (upperIntValue_ > lowerIntValue_); 415 } else if (type_ < CLP_PARAM_ACTION_DIRECTORY) { 416 printOptions(); 417 } 418 } 419 419 } 420 420 #ifdef COIN_HAS_CBC 421 421 int 422 CbcOrClpParam::setDoubleParameter (OsiSolverInterface * model, double value)423 { 424 int returnCode;425 setDoubleParameterWithMessage(model,value,returnCode);426 if (doPrinting&&strlen(printArray))427 std::cout<<printArray<<std::endl;428 return returnCode;422 CbcOrClpParam::setDoubleParameter (OsiSolverInterface * model, double value) 423 { 424 int returnCode; 425 setDoubleParameterWithMessage(model, value, returnCode); 426 if (doPrinting && strlen(printArray)) 427 std::cout << printArray << std::endl; 428 return returnCode; 429 429 } 430 430 // Sets double parameter and returns printable string and error code 431 const char * 432 CbcOrClpParam::setDoubleParameterWithMessage ( OsiSolverInterface * model, double value , int & returnCode)433 { 434 if (value<lowerDoubleValue_value>upperDoubleValue_) {435 sprintf(printArray,"%g was provided for %s  valid range is %g to %g",436 value,name_.c_str(),lowerDoubleValue_,upperDoubleValue_);437 std::cout<<value<<" was provided for "<<name_<<438 "  valid range is "<<lowerDoubleValue_<<" to "<<439 upperDoubleValue_<<std::endl;440 returnCode = 1;441 } else {442 double oldValue=doubleValue_;443 doubleValue_=value;444 switch(type_) {445 caseDUALTOLERANCE:446 model>getDblParam(OsiDualTolerance,oldValue);447 model>setDblParam(OsiDualTolerance,value);448 break;449 casePRIMALTOLERANCE:450 model>getDblParam(OsiPrimalTolerance,oldValue);451 model>setDblParam(OsiPrimalTolerance,value);452 break;453 default:454 break;455 }456 sprintf(printArray,"%s was changed from %g to %g",457 name_.c_str(),oldValue,value);458 returnCode = 0;459 }460 return printArray;431 const char * 432 CbcOrClpParam::setDoubleParameterWithMessage ( OsiSolverInterface * model, double value , int & returnCode) 433 { 434 if (value < lowerDoubleValue_  value > upperDoubleValue_) { 435 sprintf(printArray, "%g was provided for %s  valid range is %g to %g", 436 value, name_.c_str(), lowerDoubleValue_, upperDoubleValue_); 437 std::cout << value << " was provided for " << name_ << 438 "  valid range is " << lowerDoubleValue_ << " to " << 439 upperDoubleValue_ << std::endl; 440 returnCode = 1; 441 } else { 442 double oldValue = doubleValue_; 443 doubleValue_ = value; 444 switch (type_) { 445 case CLP_PARAM_DBL_DUALTOLERANCE: 446 model>getDblParam(OsiDualTolerance, oldValue); 447 model>setDblParam(OsiDualTolerance, value); 448 break; 449 case CLP_PARAM_DBL_PRIMALTOLERANCE: 450 model>getDblParam(OsiPrimalTolerance, oldValue); 451 model>setDblParam(OsiPrimalTolerance, value); 452 break; 453 default: 454 break; 455 } 456 sprintf(printArray, "%s was changed from %g to %g", 457 name_.c_str(), oldValue, value); 458 returnCode = 0; 459 } 460 return printArray; 461 461 } 462 462 #endif 463 463 #ifdef COIN_HAS_CLP 464 464 int 465 CbcOrClpParam::setDoubleParameter (ClpSimplex * model, double value)466 { 467 int returnCode;468 setDoubleParameterWithMessage(model,value,returnCode);469 if (doPrinting&&strlen(printArray))470 std::cout<<printArray<<std::endl;471 return returnCode;465 CbcOrClpParam::setDoubleParameter (ClpSimplex * model, double value) 466 { 467 int returnCode; 468 setDoubleParameterWithMessage(model, value, returnCode); 469 if (doPrinting && strlen(printArray)) 470 std::cout << printArray << std::endl; 471 return returnCode; 472 472 } 473 473 // Sets int parameter and returns printable string and error code 474 const char * 475 CbcOrClpParam::setDoubleParameterWithMessage ( ClpSimplex * model, double value , int & returnCode)476 { 477 double oldValue = doubleValue_;478 if (value<lowerDoubleValue_value>upperDoubleValue_) {479 sprintf(printArray,"%g was provided for %s  valid range is %g to %g",480 value,name_.c_str(),lowerDoubleValue_,upperDoubleValue_);481 returnCode = 1;482 } else {483 sprintf(printArray,"%s was changed from %g to %g",484 name_.c_str(),oldValue,value);485 returnCode = 0;486 doubleValue_=value;487 switch(type_) {488 caseDUALTOLERANCE:489 model>setDualTolerance(value);490 break;491 casePRIMALTOLERANCE:492 model>setPrimalTolerance(value);493 break;494 caseDUALBOUND:495 model>setDualBound(value);496 break;497 casePRIMALWEIGHT:498 model>setInfeasibilityCost(value);499 break;474 const char * 475 CbcOrClpParam::setDoubleParameterWithMessage ( ClpSimplex * model, double value , int & returnCode) 476 { 477 double oldValue = doubleValue_; 478 if (value < lowerDoubleValue_  value > upperDoubleValue_) { 479 sprintf(printArray, "%g was provided for %s  valid range is %g to %g", 480 value, name_.c_str(), lowerDoubleValue_, upperDoubleValue_); 481 returnCode = 1; 482 } else { 483 sprintf(printArray, "%s was changed from %g to %g", 484 name_.c_str(), oldValue, value); 485 returnCode = 0; 486 doubleValue_ = value; 487 switch (type_) { 488 case CLP_PARAM_DBL_DUALTOLERANCE: 489 model>setDualTolerance(value); 490 break; 491 case CLP_PARAM_DBL_PRIMALTOLERANCE: 492 model>setPrimalTolerance(value); 493 break; 494 case CLP_PARAM_DBL_DUALBOUND: 495 model>setDualBound(value); 496 break; 497 case CLP_PARAM_DBL_PRIMALWEIGHT: 498 model>setInfeasibilityCost(value); 499 break; 500 500 #ifndef COIN_HAS_CBC 501 case TIMELIMIT: 502 model>setMaximumSeconds(value); 503 break; 504 #endif 505 case OBJSCALE: 506 model>setObjectiveScale(value); 507 break; 508 case RHSSCALE: 509 model>setRhsScale(value); 510 break; 511 case PRESOLVETOLERANCE: 512 model>setDblParam(ClpPresolveTolerance,value); 513 break; 501 case CLP_PARAM_DBL_TIMELIMIT: 502 model>setMaximumSeconds(value); 503 break; 504 #endif 505 case CLP_PARAM_DBL_OBJSCALE: 506 model>setObjectiveScale(value); 507 break; 508 case CLP_PARAM_DBL_RHSSCALE: 509 model>setRhsScale(value); 510 break; 511 case CLP_PARAM_DBL_PRESOLVETOLERANCE: 512 model>setDblParam(ClpPresolveTolerance, value); 513 break; 514 default: 515 break; 516 } 517 } 518 return printArray; 519 } 520 double 521 CbcOrClpParam::doubleParameter (ClpSimplex * model) const 522 { 523 double value; 524 switch (type_) { 525 #ifndef COIN_HAS_CBC 526 case CLP_PARAM_DBL_DUALTOLERANCE: 527 value = model>dualTolerance(); 528 break; 529 case CLP_PARAM_DBL_PRIMALTOLERANCE: 530 value = model>primalTolerance(); 531 break; 532 #endif 533 case CLP_PARAM_DBL_DUALBOUND: 534 value = model>dualBound(); 535 break; 536 case CLP_PARAM_DBL_PRIMALWEIGHT: 537 value = model>infeasibilityCost(); 538 break; 539 #ifndef COIN_HAS_CBC 540 case CLP_PARAM_DBL_TIMELIMIT: 541 value = model>maximumSeconds(); 542 break; 543 #endif 544 case CLP_PARAM_DBL_OBJSCALE: 545 value = model>objectiveScale(); 546 break; 547 case CLP_PARAM_DBL_RHSSCALE: 548 value = model>rhsScale(); 549 break; 514 550 default: 515 break; 516 } 517 } 518 return printArray; 519 } 520 double 521 CbcOrClpParam::doubleParameter (ClpSimplex * model) const 522 { 523 double value; 524 switch(type_) { 525 #ifndef COIN_HAS_CBC 526 case DUALTOLERANCE: 527 value=model>dualTolerance(); 528 break; 529 case PRIMALTOLERANCE: 530 value=model>primalTolerance(); 531 break; 532 #endif 533 case DUALBOUND: 534 value=model>dualBound(); 535 break; 536 case PRIMALWEIGHT: 537 value=model>infeasibilityCost(); 538 break; 539 #ifndef COIN_HAS_CBC 540 case TIMELIMIT: 541 value=model>maximumSeconds(); 542 break; 543 #endif 544 case OBJSCALE: 545 value=model>objectiveScale(); 546 break; 547 case RHSSCALE: 548 value=model>rhsScale(); 549 break; 550 default: 551 value=doubleValue_; 552 break; 553 } 554 return value; 555 } 556 int 557 CbcOrClpParam::setIntParameter (ClpSimplex * model,int value) 558 { 559 int returnCode; 560 setIntParameterWithMessage(model,value,returnCode); 561 if (doPrinting&&strlen(printArray)) 562 std::cout<<printArray<<std::endl; 563 return returnCode; 551 value = doubleValue_; 552 break; 553 } 554 return value; 555 } 556 int 557 CbcOrClpParam::setIntParameter (ClpSimplex * model, int value) 558 { 559 int returnCode; 560 setIntParameterWithMessage(model, value, returnCode); 561 if (doPrinting && strlen(printArray)) 562 std::cout << printArray << std::endl; 563 return returnCode; 564 564 } 565 565 // Sets int parameter and returns printable string and error code 566 const char * 567 CbcOrClpParam::setIntParameterWithMessage ( ClpSimplex * model, int value , int & returnCode)568 { 569 int oldValue = intValue_;570 if (value<lowerIntValue_value>upperIntValue_) {571 sprintf(printArray,"%d was provided for %s  valid range is %d to %d",572 value,name_.c_str(),lowerIntValue_,upperIntValue_);573 returnCode = 1;574 } else {575 intValue_=value;576 sprintf(printArray,"%s was changed from %d to %d",577 name_.c_str(),oldValue,value);578 returnCode = 0;579 switch(type_) {580 caseSOLVERLOGLEVEL:581 model>setLogLevel(value);582 if (value>2)583 584 else585 586 break;587 caseMAXFACTOR:588 model>factorization()>maximumPivots(value);589 break;590 casePERTVALUE:591 model>setPerturbation(value);592 break;593 caseMAXITERATION:594 model>setMaximumIterations(value);595 break;596 caseSPECIALOPTIONS:597 model>setSpecialOptions(value);566 const char * 567 CbcOrClpParam::setIntParameterWithMessage ( ClpSimplex * model, int value , int & returnCode) 568 { 569 int oldValue = intValue_; 570 if (value < lowerIntValue_  value > upperIntValue_) { 571 sprintf(printArray, "%d was provided for %s  valid range is %d to %d", 572 value, name_.c_str(), lowerIntValue_, upperIntValue_); 573 returnCode = 1; 574 } else { 575 intValue_ = value; 576 sprintf(printArray, "%s was changed from %d to %d", 577 name_.c_str(), oldValue, value); 578 returnCode = 0; 579 switch (type_) { 580 case CLP_PARAM_INT_SOLVERLOGLEVEL: 581 model>setLogLevel(value); 582 if (value > 2) 583 model>factorization()>messageLevel(8); 584 else 585 model>factorization()>messageLevel(0); 586 break; 587 case CLP_PARAM_INT_MAXFACTOR: 588 model>factorization()>maximumPivots(value); 589 break; 590 case CLP_PARAM_INT_PERTVALUE: 591 model>setPerturbation(value); 592 break; 593 case CLP_PARAM_INT_MAXITERATION: 594 model>setMaximumIterations(value); 595 break; 596 case CLP_PARAM_INT_SPECIALOPTIONS: 597 model>setSpecialOptions(value); 598 598 #ifndef COIN_HAS_CBC 599 599 #ifdef CBC_THREAD 600 caseTHREADS:601 model>setNumberThreads(value);602 break;603 #endif 604 #endif 605 default:606 break;607 }608 }609 return printArray;610 } 611 int 600 case CBC_PARAM_INT_THREADS: 601 model>setNumberThreads(value); 602 break; 603 #endif 604 #endif 605 default: 606 break; 607 } 608 } 609 return printArray; 610 } 611 int 612 612 CbcOrClpParam::intParameter (ClpSimplex * model) const 613 613 { 614 int value;615 switch(type_) {614 int value; 615 switch (type_) { 616 616 #ifndef COIN_HAS_CBC 617 caseSOLVERLOGLEVEL:618 value=model>logLevel();619 break;620 #endif 621 caseMAXFACTOR:622 value=model>factorization()>maximumPivots();623 break;624 break;625 casePERTVALUE:626 value=model>perturbation();627 break;628 caseMAXITERATION:629 value=model>maximumIterations();630 break;631 caseSPECIALOPTIONS:632 value=model>specialOptions();633 break;617 case CLP_PARAM_INT_SOLVERLOGLEVEL: 618 value = model>logLevel(); 619 break; 620 #endif 621 case CLP_PARAM_INT_MAXFACTOR: 622 value = model>factorization()>maximumPivots(); 623 break; 624 break; 625 case CLP_PARAM_INT_PERTVALUE: 626 value = model>perturbation(); 627 break; 628 case CLP_PARAM_INT_MAXITERATION: 629 value = model>maximumIterations(); 630 break; 631 case CLP_PARAM_INT_SPECIALOPTIONS: 632 value = model>specialOptions(); 633 break; 634 634 #ifndef COIN_HAS_CBC 635 635 #ifdef CBC_THREAD 636 caseTHREADS:637 value = model>numberThreads();638 #endif 639 #endif 640 default:641 value=intValue_;642 break;643 }644 return value;636 case CBC_PARAM_INT_THREADS: 637 value = model>numberThreads(); 638 #endif 639 #endif 640 default: 641 value = intValue_; 642 break; 643 } 644 return value; 645 645 } 646 646 #endif … … 648 648 CbcOrClpParam::checkDoubleParameter (double value) const 649 649 { 650 if (value<lowerDoubleValue_value>upperDoubleValue_) { 651 std::cout<<value<<" was provided for "<<name_<< 652 "  valid range is "<<lowerDoubleValue_<<" to "<< 653 upperDoubleValue_<<std::endl; 654 return 1; 655 } else { 650 if (value < lowerDoubleValue_  value > upperDoubleValue_) { 651 std::cout << value << " was provided for " << name_ << 652 "  valid range is " << lowerDoubleValue_ << " to " << 653 upperDoubleValue_ << std::endl; 654 return 1; 655 } else { 656 return 0; 657 } 658 } 659 #ifdef COIN_HAS_CBC 660 double 661 CbcOrClpParam::doubleParameter (OsiSolverInterface * 662 #ifndef NDEBUG 663 model 664 #endif 665 ) const 666 { 667 double value = 0.0; 668 switch (type_) { 669 case CLP_PARAM_DBL_DUALTOLERANCE: 670 assert(model>getDblParam(OsiDualTolerance, value)); 671 break; 672 case CLP_PARAM_DBL_PRIMALTOLERANCE: 673 assert(model>getDblParam(OsiPrimalTolerance, value)); 674 break; 675 default: 676 return doubleValue_; 677 break; 678 } 679 return value; 680 } 681 int 682 CbcOrClpParam::setIntParameter (OsiSolverInterface * model, int value) 683 { 684 int returnCode; 685 setIntParameterWithMessage(model, value, returnCode); 686 if (doPrinting && strlen(printArray)) 687 std::cout << printArray << std::endl; 688 return returnCode; 689 } 690 // Sets int parameter and returns printable string and error code 691 const char * 692 CbcOrClpParam::setIntParameterWithMessage ( OsiSolverInterface * model, int value , int & returnCode) 693 { 694 if (value < lowerIntValue_  value > upperIntValue_) { 695 sprintf(printArray, "%d was provided for %s  valid range is %d to %d", 696 value, name_.c_str(), lowerIntValue_, upperIntValue_); 697 returnCode = 1; 698 } else { 699 int oldValue = intValue_; 700 intValue_ = oldValue; 701 switch (type_) { 702 case CLP_PARAM_INT_SOLVERLOGLEVEL: 703 model>messageHandler()>setLogLevel(value); 704 break; 705 default: 706 break; 707 } 708 sprintf(printArray, "%s was changed from %d to %d", 709 name_.c_str(), oldValue, value); 710 returnCode = 0; 711 } 712 return printArray; 713 } 714 int 715 CbcOrClpParam::intParameter (OsiSolverInterface * model) const 716 { 717 int value = 0; 718 switch (type_) { 719 case CLP_PARAM_INT_SOLVERLOGLEVEL: 720 value = model>messageHandler()>logLevel(); 721 break; 722 default: 723 value = intValue_; 724 break; 725 } 726 return value; 727 } 728 int 729 CbcOrClpParam::setDoubleParameter (CbcModel &model, double value) 730 { 731 int returnCode; 732 setDoubleParameterWithMessage(model, value, returnCode); 733 if (doPrinting && strlen(printArray)) 734 std::cout << printArray << std::endl; 735 return returnCode; 736 } 737 // Sets double parameter and returns printable string and error code 738 const char * 739 CbcOrClpParam::setDoubleParameterWithMessage ( CbcModel & model, double value , int & returnCode) 740 { 741 if (value < lowerDoubleValue_  value > upperDoubleValue_) { 742 sprintf(printArray, "%g was provided for %s  valid range is %g to %g", 743 value, name_.c_str(), lowerDoubleValue_, upperDoubleValue_); 744 returnCode = 1; 745 } else { 746 double oldValue = doubleValue_; 747 doubleValue_ = value; 748 switch (type_) { 749 case CBC_PARAM_DBL_INFEASIBILITYWEIGHT: 750 oldValue = model.getDblParam(CbcModel::CbcInfeasibilityWeight); 751 model.setDblParam(CbcModel::CbcInfeasibilityWeight, value); 752 break; 753 case CBC_PARAM_DBL_INTEGERTOLERANCE: 754 oldValue = model.getDblParam(CbcModel::CbcIntegerTolerance); 755 model.setDblParam(CbcModel::CbcIntegerTolerance, value); 756 break; 757 case CBC_PARAM_DBL_INCREMENT: 758 oldValue = model.getDblParam(CbcModel::CbcCutoffIncrement); 759 model.setDblParam(CbcModel::CbcCutoffIncrement, value); 760 case CBC_PARAM_DBL_ALLOWABLEGAP: 761 oldValue = model.getDblParam(CbcModel::CbcAllowableGap); 762 model.setDblParam(CbcModel::CbcAllowableGap, value); 763 break; 764 case CBC_PARAM_DBL_GAPRATIO: 765 oldValue = model.getDblParam(CbcModel::CbcAllowableFractionGap); 766 model.setDblParam(CbcModel::CbcAllowableFractionGap, value); 767 break; 768 case CBC_PARAM_DBL_CUTOFF: 769 oldValue = model.getCutoff(); 770 model.setCutoff(value); 771 break; 772 case CBC_PARAM_DBL_TIMELIMIT_BAB: 773 oldValue = model.getDblParam(CbcModel::CbcMaximumSeconds) ; 774 { 775 //OsiClpSolverInterface * clpSolver = dynamic_cast< OsiClpSolverInterface*> (model.solver()); 776 //ClpSimplex * lpSolver = clpSolver>getModelPtr(); 777 //lpSolver>setMaximumSeconds(value); 778 model.setDblParam(CbcModel::CbcMaximumSeconds, value) ; 779 } 780 break ; 781 case CLP_PARAM_DBL_DUALTOLERANCE: 782 case CLP_PARAM_DBL_PRIMALTOLERANCE: 783 setDoubleParameter(model.solver(), value); 784 return 0; // to avoid message 785 default: 786 break; 787 } 788 sprintf(printArray, "%s was changed from %g to %g", 789 name_.c_str(), oldValue, value); 790 returnCode = 0; 791 } 792 return printArray; 793 } 794 double 795 CbcOrClpParam::doubleParameter (CbcModel &model) const 796 { 797 double value; 798 switch (type_) { 799 case CBC_PARAM_DBL_INFEASIBILITYWEIGHT: 800 value = model.getDblParam(CbcModel::CbcInfeasibilityWeight); 801 break; 802 case CBC_PARAM_DBL_INTEGERTOLERANCE: 803 value = model.getDblParam(CbcModel::CbcIntegerTolerance); 804 break; 805 case CBC_PARAM_DBL_INCREMENT: 806 value = model.getDblParam(CbcModel::CbcCutoffIncrement); 807 break; 808 case CBC_PARAM_DBL_ALLOWABLEGAP: 809 value = model.getDblParam(CbcModel::CbcAllowableGap); 810 break; 811 case CBC_PARAM_DBL_GAPRATIO: 812 value = model.getDblParam(CbcModel::CbcAllowableFractionGap); 813 break; 814 case CBC_PARAM_DBL_CUTOFF: 815 value = model.getCutoff(); 816 break; 817 case CBC_PARAM_DBL_TIMELIMIT_BAB: 818 value = model.getDblParam(CbcModel::CbcMaximumSeconds) ; 819 break ; 820 case CLP_PARAM_DBL_DUALTOLERANCE: 821 case CLP_PARAM_DBL_PRIMALTOLERANCE: 822 value = doubleParameter(model.solver()); 823 break; 824 default: 825 value = doubleValue_; 826 break; 827 } 828 return value; 829 } 830 int 831 CbcOrClpParam::setIntParameter (CbcModel &model, int value) 832 { 833 int returnCode; 834 setIntParameterWithMessage(model, value, returnCode); 835 if (doPrinting && strlen(printArray)) 836 std::cout << printArray << std::endl; 837 return returnCode; 838 } 839 // Sets int parameter and returns printable string and error code 840 const char * 841 CbcOrClpParam::setIntParameterWithMessage ( CbcModel & model, int value , int & returnCode) 842 { 843 if (value < lowerIntValue_  value > upperIntValue_) { 844 sprintf(printArray, "%d was provided for %s  valid range is %d to %d", 845 value, name_.c_str(), lowerIntValue_, upperIntValue_); 846 returnCode = 1; 847 } else { 848 int oldValue = intValue_; 849 intValue_ = value; 850 switch (type_) { 851 case CLP_PARAM_INT_LOGLEVEL: 852 oldValue = model.messageHandler()>logLevel(); 853 model.messageHandler()>setLogLevel(CoinAbs(value)); 854 break; 855 case CLP_PARAM_INT_SOLVERLOGLEVEL: 856 oldValue = model.solver()>messageHandler()>logLevel(); 857 model.solver()>messageHandler()>setLogLevel(value); 858 break; 859 case CBC_PARAM_INT_MAXNODES: 860 oldValue = model.getIntParam(CbcModel::CbcMaxNumNode); 861 model.setIntParam(CbcModel::CbcMaxNumNode, value); 862 break; 863 case CBC_PARAM_INT_MAXSOLS: 864 oldValue = model.getIntParam(CbcModel::CbcMaxNumSol); 865 model.setIntParam(CbcModel::CbcMaxNumSol, value); 866 break; 867 case CBC_PARAM_INT_STRONGBRANCHING: 868 oldValue = model.numberStrong(); 869 model.setNumberStrong(value); 870 break; 871 case CBC_PARAM_INT_NUMBERBEFORE: 872 oldValue = model.numberBeforeTrust(); 873 model.setNumberBeforeTrust(value); 874 break; 875 case CBC_PARAM_INT_NUMBERANALYZE: 876 oldValue = model.numberAnalyzeIterations(); 877 model.setNumberAnalyzeIterations(value); 878 break; 879 case CBC_PARAM_INT_CUTPASSINTREE: 880 oldValue = model.getMaximumCutPasses(); 881 model.setMaximumCutPasses(value); 882 break; 883 case CBC_PARAM_INT_CUTPASS: 884 oldValue = model.getMaximumCutPassesAtRoot(); 885 model.setMaximumCutPassesAtRoot(value); 886 break; 887 #ifdef COIN_HAS_CBC 888 #ifdef CBC_THREAD 889 case CBC_PARAM_INT_THREADS: 890 oldValue = model.getNumberThreads(); 891 model.setNumberThreads(value); 892 break; 893 #endif 894 #endif 895 default: 896 break; 897 } 898 sprintf(printArray, "%s was changed from %d to %d", 899 name_.c_str(), oldValue, value); 900 returnCode = 0; 901 } 902 return printArray; 903 } 904 int 905 CbcOrClpParam::intParameter (CbcModel &model) const 906 { 907 int value; 908 switch (type_) { 909 case CLP_PARAM_INT_LOGLEVEL: 910 value = model.messageHandler()>logLevel(); 911 break; 912 case CLP_PARAM_INT_SOLVERLOGLEVEL: 913 value = model.solver()>messageHandler()>logLevel(); 914 break; 915 case CBC_PARAM_INT_MAXNODES: 916 value = model.getIntParam(CbcModel::CbcMaxNumNode); 917 break; 918 case CBC_PARAM_INT_MAXSOLS: 919 value = model.getIntParam(CbcModel::CbcMaxNumSol); 920 break; 921 case CBC_PARAM_INT_STRONGBRANCHING: 922 value = model.numberStrong(); 923 break; 924 case CBC_PARAM_INT_NUMBERBEFORE: 925 value = model.numberBeforeTrust(); 926 break; 927 case CBC_PARAM_INT_NUMBERANALYZE: 928 value = model.numberAnalyzeIterations(); 929 break; 930 case CBC_PARAM_INT_CUTPASSINTREE: 931 value = model.getMaximumCutPasses(); 932 break; 933 case CBC_PARAM_INT_CUTPASS: 934 value = model.getMaximumCutPassesAtRoot(); 935 break; 936 #ifdef COIN_HAS_CBC 937 #ifdef CBC_THREAD 938 case CBC_PARAM_INT_THREADS: 939 value = model.getNumberThreads(); 940 #endif 941 #endif 942 default: 943 value = intValue_; 944 break; 945 } 946 return value; 947 } 948 #endif 949 // Sets current parameter option using string 950 void 951 CbcOrClpParam::setCurrentOption ( const std::string value ) 952 { 953 int action = parameterOption(value); 954 if (action >= 0) 955 currentKeyWord_ = action; 956 } 957 // Sets current parameter option 958 void 959 CbcOrClpParam::setCurrentOption ( int value , bool printIt) 960 { 961 if (printIt && value != currentKeyWord_) 962 std::cout << "Option for " << name_ << " changed from " 963 << definedKeyWords_[currentKeyWord_] << " to " 964 << definedKeyWords_[value] << std::endl; 965 966 currentKeyWord_ = value; 967 } 968 // Sets current parameter option and returns printable string 969 const char * 970 CbcOrClpParam::setCurrentOptionWithMessage ( int value ) 971 { 972 if (value != currentKeyWord_) { 973 sprintf(printArray, "Option for %s changed from %s to %s", 974 name_.c_str(), definedKeyWords_[currentKeyWord_].c_str(), 975 definedKeyWords_[value].c_str()); 976 977 currentKeyWord_ = value; 978 } else { 979 printArray[0] = '\0'; 980 } 981 return printArray; 982 } 983 void 984 CbcOrClpParam::setIntValue ( int value ) 985 { 986 if (value < lowerIntValue_  value > upperIntValue_) { 987 std::cout << value << " was provided for " << name_ << 988 "  valid range is " << lowerIntValue_ << " to " << 989 upperIntValue_ << std::endl; 990 } else { 991 intValue_ = value; 992 } 993 } 994 void 995 CbcOrClpParam::setDoubleValue ( double value ) 996 { 997 if (value < lowerDoubleValue_  value > upperDoubleValue_) { 998 std::cout << value << " was provided for " << name_ << 999 "  valid range is " << lowerDoubleValue_ << " to " << 1000 upperDoubleValue_ << std::endl; 1001 } else { 1002 doubleValue_ = value; 1003 } 1004 } 1005 void 1006 CbcOrClpParam::setStringValue ( std::string value ) 1007 { 1008 stringValue_ = value; 1009 } 1010 static char line[1000]; 1011 static char * where = NULL; 1012 extern int CbcOrClpRead_mode; 1013 int CbcOrClpEnvironmentIndex = 1; 1014 static int fillEnv() 1015 { 1016 #if defined(_MSC_VER)  defined(__MSVCRT__) 656 1017 return 0; 657 } 658 } 659 #ifdef COIN_HAS_CBC 660 double 661 CbcOrClpParam::doubleParameter (OsiSolverInterface * 662 #ifndef NDEBUG 663 model 664 #endif 665 ) const 666 { 667 double value=0.0; 668 switch(type_) { 669 case DUALTOLERANCE: 670 assert(model>getDblParam(OsiDualTolerance,value)); 671 break; 672 case PRIMALTOLERANCE: 673 assert(model>getDblParam(OsiPrimalTolerance,value)); 674 break; 675 default: 676 return doubleValue_; 677 break; 678 } 679 return value; 680 } 681 int 682 CbcOrClpParam::setIntParameter (OsiSolverInterface * model,int value) 683 { 684 int returnCode; 685 setIntParameterWithMessage(model,value,returnCode); 686 if (doPrinting&&strlen(printArray)) 687 std::cout<<printArray<<std::endl; 688 return returnCode; 689 } 690 // Sets int parameter and returns printable string and error code 691 const char * 692 CbcOrClpParam::setIntParameterWithMessage ( OsiSolverInterface * model, int value ,int & returnCode) 693 { 694 if (value<lowerIntValue_value>upperIntValue_) { 695 sprintf(printArray,"%d was provided for %s  valid range is %d to %d", 696 value,name_.c_str(),lowerIntValue_,upperIntValue_); 697 returnCode = 1; 698 } else { 699 int oldValue=intValue_; 700 intValue_=oldValue; 701 switch(type_) { 702 case SOLVERLOGLEVEL: 703 model>messageHandler()>setLogLevel(value); 704 break; 705 default: 706 break; 707 } 708 sprintf(printArray,"%s was changed from %d to %d", 709 name_.c_str(),oldValue,value); 710 returnCode = 0; 711 } 712 return printArray; 713 } 714 int 715 CbcOrClpParam::intParameter (OsiSolverInterface * model) const 716 { 717 int value=0; 718 switch(type_) { 719 case SOLVERLOGLEVEL: 720 value=model>messageHandler()>logLevel(); 721 break; 722 default: 723 value=intValue_; 724 break; 725 } 726 return value; 727 } 728 int 729 CbcOrClpParam::setDoubleParameter (CbcModel &model,double value) 730 { 731 int returnCode; 732 setDoubleParameterWithMessage(model,value,returnCode); 733 if (doPrinting&&strlen(printArray)) 734 std::cout<<printArray<<std::endl; 735 return returnCode; 736 } 737 // Sets double parameter and returns printable string and error code 738 const char * 739 CbcOrClpParam::setDoubleParameterWithMessage ( CbcModel & model, double value ,int & returnCode) 740 { 741 if (value<lowerDoubleValue_value>upperDoubleValue_) { 742 sprintf(printArray,"%g was provided for %s  valid range is %g to %g", 743 value,name_.c_str(),lowerDoubleValue_,upperDoubleValue_); 744 returnCode = 1; 745 } else { 746 double oldValue=doubleValue_; 747 doubleValue_ = value; 748 switch(type_) { 749 case INFEASIBILITYWEIGHT: 750 oldValue=model.getDblParam(CbcModel::CbcInfeasibilityWeight); 751 model.setDblParam(CbcModel::CbcInfeasibilityWeight,value); 752 break; 753 case INTEGERTOLERANCE: 754 oldValue=model.getDblParam(CbcModel::CbcIntegerTolerance); 755 model.setDblParam(CbcModel::CbcIntegerTolerance,value); 756 break; 757 case INCREMENT: 758 oldValue=model.getDblParam(CbcModel::CbcCutoffIncrement); 759 model.setDblParam(CbcModel::CbcCutoffIncrement,value); 760 case ALLOWABLEGAP: 761 oldValue=model.getDblParam(CbcModel::CbcAllowableGap); 762 model.setDblParam(CbcModel::CbcAllowableGap,value); 763 break; 764 case GAPRATIO: 765 oldValue=model.getDblParam(CbcModel::CbcAllowableFractionGap); 766 model.setDblParam(CbcModel::CbcAllowableFractionGap,value); 767 break; 768 case CUTOFF: 769 oldValue=model.getCutoff(); 770 model.setCutoff(value); 771 break; 772 case TIMELIMIT_BAB: 773 oldValue = model.getDblParam(CbcModel::CbcMaximumSeconds) ; 774 { 775 //OsiClpSolverInterface * clpSolver = dynamic_cast< OsiClpSolverInterface*> (model.solver()); 776 //ClpSimplex * lpSolver = clpSolver>getModelPtr(); 777 //lpSolver>setMaximumSeconds(value); 778 model.setDblParam(CbcModel::CbcMaximumSeconds,value) ; 779 } 780 break ; 781 case DUALTOLERANCE: 782 case PRIMALTOLERANCE: 783 setDoubleParameter(model.solver(),value); 784 return 0; // to avoid message 785 default: 786 break; 787 } 788 sprintf(printArray,"%s was changed from %g to %g", 789 name_.c_str(),oldValue,value); 790 returnCode = 0; 791 } 792 return printArray; 793 } 794 double 795 CbcOrClpParam::doubleParameter (CbcModel &model) const 796 { 797 double value; 798 switch(type_) { 799 case INFEASIBILITYWEIGHT: 800 value=model.getDblParam(CbcModel::CbcInfeasibilityWeight); 801 break; 802 case INTEGERTOLERANCE: 803 value=model.getDblParam(CbcModel::CbcIntegerTolerance); 804 break; 805 case INCREMENT: 806 value=model.getDblParam(CbcModel::CbcCutoffIncrement); 807 break; 808 case ALLOWABLEGAP: 809 value=model.getDblParam(CbcModel::CbcAllowableGap); 810 break; 811 case GAPRATIO: 812 value=model.getDblParam(CbcModel::CbcAllowableFractionGap); 813 break; 814 case CUTOFF: 815 value=model.getCutoff(); 816 break; 817 case TIMELIMIT_BAB: 818 value = model.getDblParam(CbcModel::CbcMaximumSeconds) ; 819 break ; 820 case DUALTOLERANCE: 821 case PRIMALTOLERANCE: 822 value=doubleParameter(model.solver()); 823 break; 824 default: 825 value = doubleValue_; 826 break; 827 } 828 return value; 829 } 830 int 831 CbcOrClpParam::setIntParameter (CbcModel &model,int value) 832 { 833 int returnCode; 834 setIntParameterWithMessage(model,value,returnCode); 835 if (doPrinting&&strlen(printArray)) 836 std::cout<<printArray<<std::endl; 837 return returnCode; 838 } 839 // Sets int parameter and returns printable string and error code 840 const char * 841 CbcOrClpParam::setIntParameterWithMessage ( CbcModel & model, int value ,int & returnCode) 842 { 843 if (value<lowerIntValue_value>upperIntValue_) { 844 sprintf(printArray,"%d was provided for %s  valid range is %d to %d", 845 value,name_.c_str(),lowerIntValue_,upperIntValue_); 846 returnCode = 1; 847 } else { 848 int oldValue=intValue_; 849 intValue_ = value; 850 switch(type_) { 851 case LOGLEVEL: 852 oldValue = model.messageHandler()>logLevel(); 853 model.messageHandler()>setLogLevel(CoinAbs(value)); 854 break; 855 case SOLVERLOGLEVEL: 856 oldValue = model.solver()>messageHandler()>logLevel(); 857 model.solver()>messageHandler()>setLogLevel(value); 858 break; 859 case MAXNODES: 860 oldValue=model.getIntParam(CbcModel::CbcMaxNumNode); 861 model.setIntParam(CbcModel::CbcMaxNumNode,value); 862 break; 863 case MAXSOLS: 864 oldValue=model.getIntParam(CbcModel::CbcMaxNumSol); 865 model.setIntParam(CbcModel::CbcMaxNumSol,value); 866 break; 867 case STRONGBRANCHING: 868 oldValue=model.numberStrong(); 869 model.setNumberStrong(value); 870 break; 871 case NUMBERBEFORE: 872 oldValue=model.numberBeforeTrust(); 873 model.setNumberBeforeTrust(value); 874 break; 875 case NUMBERANALYZE: 876 oldValue=model.numberAnalyzeIterations(); 877 model.setNumberAnalyzeIterations(value); 878 break; 879 case CUTPASSINTREE: 880 oldValue=model.getMaximumCutPasses(); 881 model.setMaximumCutPasses(value); 882 break; 883 case CUTPASS: 884 oldValue=model.getMaximumCutPassesAtRoot(); 885 model.setMaximumCutPassesAtRoot(value); 886 break; 887 #ifdef COIN_HAS_CBC 888 #ifdef CBC_THREAD 889 case THREADS: 890 oldValue=model.getNumberThreads(); 891 model.setNumberThreads(value); 892 break; 893 #endif 894 #endif 895 default: 896 break; 897 } 898 sprintf(printArray,"%s was changed from %d to %d", 899 name_.c_str(),oldValue,value); 900 returnCode = 0; 901 } 902 return printArray; 903 } 904 int 905 CbcOrClpParam::intParameter (CbcModel &model) const 906 { 907 int value; 908 switch(type_) { 909 case LOGLEVEL: 910 value = model.messageHandler()>logLevel(); 911 break; 912 case SOLVERLOGLEVEL: 913 value = model.solver()>messageHandler()>logLevel(); 914 break; 915 case MAXNODES: 916 value = model.getIntParam(CbcModel::CbcMaxNumNode); 917 break; 918 case MAXSOLS: 919 value = model.getIntParam(CbcModel::CbcMaxNumSol); 920 break; 921 case STRONGBRANCHING: 922 value=model.numberStrong(); 923 break; 924 case NUMBERBEFORE: 925 value=model.numberBeforeTrust(); 926 break; 927 case NUMBERANALYZE: 928 value=model.numberAnalyzeIterations(); 929 break; 930 case CUTPASSINTREE: 931 value=model.getMaximumCutPasses(); 932 break; 933 case CUTPASS: 934 value=model.getMaximumCutPassesAtRoot(); 935 break; 936 #ifdef COIN_HAS_CBC 937 #ifdef CBC_THREAD 938 case THREADS: 939 value = model.getNumberThreads(); 940 #endif 941 #endif 942 default: 943 value=intValue_; 944 break; 945 } 946 return value; 947 } 948 #endif 949 // Sets current parameter option using string 950 void 951 CbcOrClpParam::setCurrentOption ( const std::string value ) 952 { 953 int action = parameterOption(value); 954 if (action>=0) 955 currentKeyWord_=action; 956 } 957 // Sets current parameter option 958 void 959 CbcOrClpParam::setCurrentOption ( int value , bool printIt) 960 { 961 if (printIt&&value!=currentKeyWord_) 962 std::cout<<"Option for "<<name_<<" changed from " 963 <<definedKeyWords_[currentKeyWord_]<<" to " 964 <<definedKeyWords_[value]<<std::endl; 965 966 currentKeyWord_=value; 967 } 968 // Sets current parameter option and returns printable string 969 const char * 970 CbcOrClpParam::setCurrentOptionWithMessage ( int value ) 971 { 972 if (value!=currentKeyWord_) { 973 sprintf(printArray,"Option for %s changed from %s to %s", 974 name_.c_str(),definedKeyWords_[currentKeyWord_].c_str(), 975 definedKeyWords_[value].c_str()); 976 977 currentKeyWord_=value; 978 } else { 979 printArray[0]='\0'; 980 } 981 return printArray; 982 } 983 void 984 CbcOrClpParam::setIntValue ( int value ) 985 { 986 if (value<lowerIntValue_value>upperIntValue_) { 987 std::cout<<value<<" was provided for "<<name_<< 988 "  valid range is "<<lowerIntValue_<<" to "<< 989 upperIntValue_<<std::endl; 990 } else { 991 intValue_=value; 992 } 993 } 994 void 995 CbcOrClpParam::setDoubleValue ( double value ) 996 { 997 if (value<lowerDoubleValue_value>upperDoubleValue_) { 998 std::cout<<value<<" was provided for "<<name_<< 999 "  valid range is "<<lowerDoubleValue_<<" to "<< 1000 upperDoubleValue_<<std::endl; 1001 } else { 1002 doubleValue_=value; 1003 } 1004 } 1005 void 1006 CbcOrClpParam::setStringValue ( std::string value ) 1007 { 1008 stringValue_=value; 1009 } 1010 static char line[1000]; 1011 static char * where=NULL; 1012 extern int CbcOrClpRead_mode; 1013 int CbcOrClpEnvironmentIndex=1; 1014 static int fillEnv() 1015 { 1016 char * environ = getenv("CBC_CLP_ENVIRONMENT"); 1017 int length=0; 1018 if (environ) { 1019 length = strlen(environ); 1020 if (CbcOrClpEnvironmentIndex<length) { 1021 // find next non blank 1022 char * whereEnv = environ+ CbcOrClpEnvironmentIndex; 1023 // munch white space 1024 while(*whereEnv==' '*whereEnv=='\t'*whereEnv<' ') 1025 whereEnv++; 1026 // copy 1027 char * put = line; 1028 while ( *whereEnv != '\0' ) { 1029 if ( *whereEnv == ' '*whereEnv == '\t'  *whereEnv < ' ' ) { 1030 break; 1031 } 1032 *put=*whereEnv; 1033 put++; 1034 assert (putline<1000); 1035 whereEnv++; 1036 } 1037 CbcOrClpEnvironmentIndex=whereEnvenviron; 1038 *put='\0'; 1039 length=strlen(line); 1040 } else { 1041 length=0; 1042 } 1043 } 1044 if (!length) 1045 CbcOrClpEnvironmentIndex=1; 1046 return length; 1018 #else 1019 // Don't think it will work on Windows 1020 char * environ = getenv("CBC_CLP_ENVIRONMENT"); 1021 int length = 0; 1022 if (environ) { 1023 length = strlen(environ); 1024 if (CbcOrClpEnvironmentIndex < length) { 1025 // find next non blank 1026 char * whereEnv = environ + CbcOrClpEnvironmentIndex; 1027 // munch white space 1028 while (*whereEnv == ' '  *whereEnv == '\t'  *whereEnv < ' ') 1029 whereEnv++; 1030 // copy 1031 char * put = line; 1032 while ( *whereEnv != '\0' ) { 1033 if ( *whereEnv == ' '  *whereEnv == '\t'  *whereEnv < ' ' ) { 1034 break; 1035 } 1036 *put = *whereEnv; 1037 put++; 1038 assert (put  line < 1000); 1039 whereEnv++; 1040 } 1041 CbcOrClpEnvironmentIndex = whereEnv  environ; 1042 *put = '\0'; 1043 length = strlen(line); 1044 } else { 1045 length = 0; 1046 } 1047 } 1048 if (!length) 1049 CbcOrClpEnvironmentIndex = 1; 1050 return length; 1051 #endif 1047 1052 } 1048 1053 extern FILE * CbcOrClpReadCommand; … … 1051 1056 CoinReadNextField() 1052 1057 { 1053 std::string field; 1054 if (!where) { 1055 // need new line 1056 #ifdef COIN_HAS_READLINE 1057 if (CbcOrClpReadCommand==stdin) { 1058 // Get a line from the user. 1059 where = readline (coin_prompt); 1060 1061 // If the line has any text in it, save it on the history. 1062 if (where) { 1063 if ( *where) 1064 add_history (where); 1065 strcpy(line,where); 1066 free(where); 1067 } 1058 std::string field; 1059 if (!where) { 1060 // need new line 1061 #ifdef COIN_HAS_READLINE 1062 if (CbcOrClpReadCommand == stdin) { 1063 // Get a line from the user. 1064 where = readline (coin_prompt); 1065 1066 // If the line has any text in it, save it on the history. 1067 if (where) { 1068 if ( *where) 1069 add_history (where); 1070 strcpy(line, where); 1071 free(where); 1072 } 1073 } else { 1074 where = fgets(line, 1000, CbcOrClpReadCommand); 1075 } 1076 #else 1077 if (CbcOrClpReadCommand == stdin) { 1078 fprintf(stdout, coin_prompt); 1079 fflush(stdout); 1080 } 1081 where = fgets(line, 1000, CbcOrClpReadCommand); 1082 #endif 1083 if (!where) 1084 return field; // EOF 1085 where = line; 1086 // clean image 1087 char * lastNonBlank = line  1; 1088 while ( *where != '\0' ) { 1089 if ( *where != '\t' && *where < ' ' ) { 1090 break; 1091 } else if ( *where != '\t' && *where != ' ') { 1092 lastNonBlank = where; 1093 } 1094 where++; 1095 } 1096 where = line; 1097 *(lastNonBlank + 1) = '\0'; 1098 } 1099 // munch white space 1100 while (*where == ' '  *where == '\t') 1101 where++; 1102 char * saveWhere = where; 1103 while (*where != ' ' && *where != '\t' && *where != '\0') 1104 where++; 1105 if (where != saveWhere) { 1106 char save = *where; 1107 *where = '\0'; 1108 //convert to string 1109 field = saveWhere; 1110 *where = save; 1068 1111 } else { 1069 where = fgets(line,1000,CbcOrClpReadCommand); 1070 } 1071 #else 1072 if (CbcOrClpReadCommand==stdin) { 1073 fprintf(stdout,coin_prompt); 1074 fflush(stdout); 1075 } 1076 where = fgets(line,1000,CbcOrClpReadCommand); 1077 #endif 1078 if (!where) 1079 return field; // EOF 1080 where = line; 1081 // clean image 1082 char * lastNonBlank = line1; 1083 while ( *where != '\0' ) { 1084 if ( *where != '\t' && *where < ' ' ) { 1085 break; 1086 } else if ( *where != '\t' && *where != ' ') { 1087 lastNonBlank = where; 1088 } 1089 where++; 1090 } 1091 where=line; 1092 *(lastNonBlank+1)='\0'; 1093 } 1094 // munch white space 1095 while(*where==' '*where=='\t') 1096 where++; 1097 char * saveWhere = where; 1098 while (*where!=' '&&*where!='\t'&&*where!='\0') 1099 where++; 1100 if (where!=saveWhere) { 1101 char save = *where; 1102 *where='\0'; 1103 //convert to string 1104 field=saveWhere; 1105 *where=save; 1106 } else { 1107 where=NULL; 1108 field="EOL"; 1109 } 1110 return field; 1112 where = NULL; 1113 field = "EOL"; 1114 } 1115 return field; 1111 1116 } 1112 1117 … … 1114 1119 CoinReadGetCommand(int argc, const char *argv[]) 1115 1120 { 1116 std::string field="EOL";1117 // say no =1118 afterEquals="";1119 while (field=="EOL") {1120 if (CbcOrClpRead_mode>0) {1121 if ((CbcOrClpRead_mode<argc&&argv[CbcOrClpRead_mode])1122 CbcOrClpEnvironmentIndex>=0) {1123 if(CbcOrClpEnvironmentIndex<0) {1124 1125 1126 1127 field=line;1128 1129 1130 1131 1132 1133 if (field=="") {1134 std::cout<<"Switching to line mode"<<std::endl;1135 CbcOrClpRead_mode=1;1136 field=CoinReadNextField();1137 } else if (field[0]!='') {1138 if (CbcOrClpRead_mode!=2) {1139 1140 1141 } else if (CbcOrClpEnvironmentIndex<0) {1142 1143 1144 field="import";1145 1146 1147 if (field!="") {1148 1149 1150 1151 1152 1153 field="import";1154 1155 1156 } else {1157 field="";1158 }1159 } else {1160 field=CoinReadNextField();1161 }1162 }1163 // if = then modify and save1164 std::string::size_type found = field.find('=');1165 if (found!=std::string::npos) {1166 afterEquals = field.substr(found+1);1167 field = field.substr(0,found);1168 }1169 //std::cout<<field<<std::endl;1170 return field;1121 std::string field = "EOL"; 1122 // say no = 1123 afterEquals = ""; 1124 while (field == "EOL") { 1125 if (CbcOrClpRead_mode > 0) { 1126 if ((CbcOrClpRead_mode < argc && argv[CbcOrClpRead_mode])  1127 CbcOrClpEnvironmentIndex >= 0) { 1128 if (CbcOrClpEnvironmentIndex < 0) { 1129 field = argv[CbcOrClpRead_mode++]; 1130 } else { 1131 if (fillEnv()) { 1132 field = line; 1133 } else { 1134 // not there 1135 continue; 1136 } 1137 } 1138 if (field == "") { 1139 std::cout << "Switching to line mode" << std::endl; 1140 CbcOrClpRead_mode = 1; 1141 field = CoinReadNextField(); 1142 } else if (field[0] != '') { 1143 if (CbcOrClpRead_mode != 2) { 1144 // now allow std::cout<<"skipping noncommand "<<field<<std::endl; 1145 // field="EOL"; // skip 1146 } else if (CbcOrClpEnvironmentIndex < 0) { 1147 // special dispensation  taken as import name 1148 CbcOrClpRead_mode; 1149 field = "import"; 1150 } 1151 } else { 1152 if (field != "") { 1153 // take off  1154 field = field.substr(1); 1155 } else { 1156 // special dispensation  taken as import  1157 CbcOrClpRead_mode; 1158 field = "import"; 1159 } 1160 } 1161 } else { 1162 field = ""; 1163 } 1164 } else { 1165 field = CoinReadNextField(); 1166 } 1167 } 1168 // if = then modify and save 1169 std::string::size_type found = field.find('='); 1170 if (found != std::string::npos) { 1171 afterEquals = field.substr(found + 1); 1172 field = field.substr(0, found); 1173 } 1174 //std::cout<<field<<std::endl; 1175 return field; 1171 1176 } 1172 1177 std::string 1173 1178 CoinReadGetString(int argc, const char *argv[]) 1174 1179 { 1175 std::string field="EOL"; 1176 if (afterEquals=="") { 1177 if (CbcOrClpRead_mode>0) { 1178 if (CbcOrClpRead_mode<argcCbcOrClpEnvironmentIndex>=0) { 1179 if(CbcOrClpEnvironmentIndex<0) { 1180 if (argv[CbcOrClpRead_mode][0]!='') { 1181 field = argv[CbcOrClpRead_mode++]; 1182 } else if (!strcmp(argv[CbcOrClpRead_mode],"")) { 1183 field = argv[CbcOrClpRead_mode++]; 1184 //  means import from stdin 1185 field = ""; 1186 } 1187 } else { 1188 fillEnv(); 1189 field=line; 1190 } 1191 } 1180 std::string field = "EOL"; 1181 if (afterEquals == "") { 1182 if (CbcOrClpRead_mode > 0) { 1183 if (CbcOrClpRead_mode < argc  CbcOrClpEnvironmentIndex >= 0) { 1184 if (CbcOrClpEnvironmentIndex < 0) { 1185 if (argv[CbcOrClpRead_mode][0] != '') { 1186 field = argv[CbcOrClpRead_mode++]; 1187 } else if (!strcmp(argv[CbcOrClpRead_mode], "")) { 1188 field = argv[CbcOrClpRead_mode++]; 1189 //  means import from stdin 1190 field = ""; 1191 } 1192 } else { 1193 fillEnv(); 1194 field = line; 1195 } 1196 } 1197 } else { 1198 field = CoinReadNextField(); 1199 } 1192 1200 } else { 1193 field=CoinReadNextField(); 1194 } 1195 } else { 1196 field=afterEquals; 1197 afterEquals = ""; 1198 } 1199 //std::cout<<field<<std::endl; 1200 return field; 1201 field = afterEquals; 1202 afterEquals = ""; 1203 } 1204 //std::cout<<field<<std::endl; 1205 return field; 1201 1206 } 1202 1207 // valid 0  okay, 1 bad, 2 not there 1203 1208 int 1204 CoinReadGetIntField(int argc, const char *argv[],int * valid) 1205 { 1206 std::string field="EOL"; 1207 if (afterEquals=="") { 1208 if (CbcOrClpRead_mode>0) { 1209 if (CbcOrClpRead_mode<argcCbcOrClpEnvironmentIndex>=0) { 1210 if(CbcOrClpEnvironmentIndex<0) { 1211 // may be negative value so do not check for  1212 field = argv[CbcOrClpRead_mode++]; 1213 } else { 1214 fillEnv(); 1215 field=line; 1216 } 1217 } 1209 CoinReadGetIntField(int argc, const char *argv[], int * valid) 1210 { 1211 std::string field = "EOL"; 1212 if (afterEquals == "") { 1213 if (CbcOrClpRead_mode > 0) { 1214 if (CbcOrClpRead_mode < argc  CbcOrClpEnvironmentIndex >= 0) { 1215 if (CbcOrClpEnvironmentIndex < 0) { 1216 // may be negative value so do not check for  1217 field = argv[CbcOrClpRead_mode++]; 1218 } else { 1219 fillEnv(); 1220 field = line; 1221 } 1222 } 1223 } else { 1224 field = CoinReadNextField(); 1225 } 1218 1226 } else { 1219 field=CoinReadNextField(); 1220 } 1221 } else { 1222 field=afterEquals; 1223 afterEquals = ""; 1224 } 1225 int value=0; 1226 //std::cout<<field<<std::endl; 1227 if (field!="EOL") { 1228 const char * start = field.c_str(); 1229 char * endPointer = NULL; 1230 // check valid 1231 value = strtol(start,&endPointer,10); 1232 if (*endPointer=='\0') { 1233 *valid = 0; 1227 field = afterEquals; 1228 afterEquals = ""; 1229 } 1230 int value = 0; 1231 //std::cout<<field<<std::endl; 1232 if (field != "EOL") { 1233 const char * start = field.c_str(); 1234 char * endPointer = NULL; 1235 // check valid 1236 value = strtol(start, &endPointer, 10); 1237 if (*endPointer == '\0') { 1238 *valid = 0; 1239 } else { 1240 *valid = 1; 1241 std::cout << "String of " << field; 1242 } 1234 1243 } else { 1235 *valid = 1; 1236 std::cout<<"String of "<<field; 1237 } 1238 } else { 1239 *valid=2; 1240 } 1241 return value; 1244 *valid = 2; 1245 } 1246 return value; 1242 1247 } 1243 1248 double 1244 CoinReadGetDoubleField(int argc, const char *argv[],int * valid) 1245 { 1246 std::string field="EOL"; 1247 if (afterEquals=="") { 1248 if (CbcOrClpRead_mode>0) { 1249 if (CbcOrClpRead_mode<argcCbcOrClpEnvironmentIndex>=0) { 1250 if(CbcOrClpEnvironmentIndex<0) { 1251 // may be negative value so do not check for  1252 field = argv[CbcOrClpRead_mode++]; 1253 } else { 1254 fillEnv(); 1255 field=line; 1256 } 1257 } 1249 CoinReadGetDoubleField(int argc, const char *argv[], int * valid) 1250 { 1251 std::string field = "EOL"; 1252 if (afterEquals == "") { 1253 if (CbcOrClpRead_mode > 0) { 1254 if (CbcOrClpRead_mode < argc  CbcOrClpEnvironmentIndex >= 0) { 1255 if (CbcOrClpEnvironmentIndex < 0) { 1256 // may be negative value so do not check for  1257 field = argv[CbcOrClpRead_mode++]; 1258 } else { 1259 fillEnv(); 1260 field = line; 1261 } 1262 } 1263 } else { 1264 field = CoinReadNextField(); 1265 } 1258 1266 } else { 1259 field=CoinReadNextField(); 1260 } 1261 } else { 1262 field=afterEquals; 1263 afterEquals = ""; 1264 } 1265 double value=0.0; 1266 //std::cout<<field<<std::endl; 1267 if (field!="EOL") { 1268 const char * start = field.c_str(); 1269 char * endPointer = NULL; 1270 // check valid 1271 value = strtod(start,&endPointer); 1272 if (*endPointer=='\0') { 1273 *valid = 0; 1267 field = afterEquals; 1268 afterEquals = ""; 1269 } 1270 double value = 0.0; 1271 //std::cout<<field<<std::endl; 1272 if (field != "EOL") { 1273 const char * start = field.c_str(); 1274 char * endPointer = NULL; 1275 // check valid 1276 value = strtod(start, &endPointer); 1277 if (*endPointer == '\0') { 1278 *valid = 0; 1279 } else { 1280 *valid = 1; 1281 std::cout << "String of " << field; 1282 } 1274 1283 } else { 1275 *valid = 1; 1276 std::cout<<"String of "<<field; 1277 } 1278 } else { 1279 *valid=2; 1280 } 1281 return value; 1284 *valid = 2; 1285 } 1286 return value; 1282 1287 } 1283 1288 /* 1284 1289 Subroutine to establish the cbc parameter array. See the description of 1285 class CbcOrClpParam for details. Pulled from C..Main() for clarity. 1290 class CbcOrClpParam for details. Pulled from C..Main() for clarity. 1286 1291 */ 1287 void 1292 void 1288 1293 establishParams (int &numberParameters, CbcOrClpParam *const parameters) 1289 1294 { 1290 numberParameters=0;1291 parameters[numberParameters++]=1292 CbcOrClpParam("?","For help",GENERALQUERY,7,0);1293 parameters[numberParameters++]=1294 CbcOrClpParam("???","For help",FULLGENERALQUERY,7,0);1295 parameters[numberParameters++]=1296 CbcOrClpParam("","From stdin",1297 STDIN,3,0);1298 parameters[numberParameters++]=1299 CbcOrClpParam("allC!ommands","Whether to print less used commands",1300 "no",ALLCOMMANDS);1301 parameters[numberParameters1].append("more");1302 parameters[numberParameters1].append("all");1303 parameters[numberParameters1].setLonghelp1304 ( 1305 "For the sake of your sanity, only the more useful and simple commands \1295 numberParameters = 0; 1296 parameters[numberParameters++] = 1297 CbcOrClpParam("?", "For help", CBC_PARAM_GENERALQUERY, 7, 0); 1298 parameters[numberParameters++] = 1299 CbcOrClpParam("???", "For help", CBC_PARAM_FULLGENERALQUERY, 7, 0); 1300 parameters[numberParameters++] = 1301 CbcOrClpParam("", "From stdin", 1302 CLP_PARAM_ACTION_STDIN, 3, 0); 1303 parameters[numberParameters++] = 1304 CbcOrClpParam("allC!ommands", "Whether to print less used commands", 1305 "no", CLP_PARAM_STR_ALLCOMMANDS); 1306 parameters[numberParameters1].append("more"); 1307 parameters[numberParameters1].append("all"); 1308 parameters[numberParameters1].setLonghelp 1309 ( 1310 "For the sake of your sanity, only the more useful and simple commands \ 1306 1311 are printed out on ?." 1307 );1308 #ifdef COIN_HAS_CBC 1309 parameters[numberParameters++] =1310 CbcOrClpParam("allow!ableGap","Stop when gap between best possible and \1312 ); 1313 #ifdef COIN_HAS_CBC 1314 parameters[numberParameters++] = 1315 CbcOrClpParam("allow!ableGap", "Stop when gap between best possible and \ 1311 1316 best less than this", 1312 0.0,1.0e20,ALLOWABLEGAP);1313 parameters[numberParameters1].setDoubleValue(0.0);1314 parameters[numberParameters1].setLonghelp1315 ( 1316 "If the gap between best solution and best possible solution is less than this \1317 0.0, 1.0e20, CBC_PARAM_DBL_ALLOWABLEGAP); 1318 parameters[numberParameters1].setDoubleValue(0.0); 1319 parameters[numberParameters1].setLonghelp 1320 ( 1321 "If the gap between best solution and best possible solution is less than this \ 1317 1322 then the search will be terminated. Also see ratioGap." 1318 );1323 ); 1319 1324 #endif 1320 1325 #ifdef COIN_HAS_CLP 1321 parameters[numberParameters++]=1322 CbcOrClpParam("allS!lack","Set basis back to all slack and reset solution",1323 ALLSLACK,3);1324 parameters[numberParameters1].setLonghelp1325 ( 1326 "Mainly useful for tuning purposes. Normally the first dual or primal will be using an all slack \1326 parameters[numberParameters++] = 1327 CbcOrClpParam("allS!lack", "Set basis back to all slack and reset solution", 1328 CLP_PARAM_ACTION_ALLSLACK, 3); 1329 parameters[numberParameters1].setLonghelp 1330 ( 1331 "Mainly useful for tuning purposes. Normally the first dual or primal will be using an all slack \ 1327 1332 basis anyway." 1328 );1329 #endif 1330 #ifdef COIN_HAS_CBC 1331 parameters[numberParameters++]=1332 CbcOrClpParam("artif!icialCost","Costs >= this treated as artificials in feasibility pump",1333 0.0,COIN_DBL_MAX,ARTIFICIALCOST,1);1334 parameters[numberParameters1].setDoubleValue(0.0);1335 parameters[numberParameters1].setLonghelp 1336 ( 1337 "0.0 off  otherwise variables with costs >= this are treated as artificials and fixed to lower bound in feasibility pump"1338 );1333 ); 1334 #endif 1335 #ifdef COIN_HAS_CBC 1336 parameters[numberParameters++] = 1337 CbcOrClpParam("artif!icialCost", "Costs >= this treated as artificials in feasibility pump", 1338 0.0, COIN_DBL_MAX, CBC_PARAM_DBL_ARTIFICIALCOST, 1); 1339 parameters[numberParameters1].setDoubleValue(0.0); 1340 parameters[numberParameters1].setLonghelp 1341 ( 1342 "0.0 off  otherwise variables with costs >= this are treated as artificials and fixed to lower bound in feasibility pump" 1343 ); 1339 1344 #endif 1340 1345 #ifdef COIN_HAS_CLP 1341 parameters[numberParameters++]=1342 CbcOrClpParam("auto!Scale","Whether to scale objective, rhs and bounds of problem if they look odd",1343 "off",AUTOSCALE,7,0);1344 parameters[numberParameters1].append("on");1345 parameters[numberParameters1].setLonghelp1346 ( 1347 "If you think you may get odd objective values or large equality rows etc then\1346 parameters[numberParameters++] = 1347 CbcOrClpParam("auto!Scale", "Whether to scale objective, rhs and bounds of problem if they look odd", 1348 "off", CLP_PARAM_STR_AUTOSCALE, 7, 0); 1349 parameters[numberParameters1].append("on"); 1350 parameters[numberParameters1].setLonghelp 1351 ( 1352 "If you think you may get odd objective values or large equality rows etc then\ 1348 1353 it may be worth setting this true. It is still experimental and you may prefer\ 1349 1354 to use objective!Scale and rhs!Scale." 1350 );1351 parameters[numberParameters++]=1352 CbcOrClpParam("barr!ier","Solve using primal dual predictor corrector algorithm",1353 1354 parameters[numberParameters1].setLonghelp1355 ( 1356 "This command solves the current model using the primal dual predictor \1355 ); 1356 parameters[numberParameters++] = 1357 CbcOrClpParam("barr!ier", "Solve using primal dual predictor corrector algorithm", 1358 CLP_PARAM_ACTION_BARRIER); 1359 parameters[numberParameters1].setLonghelp 1360 ( 1361 "This command solves the current model using the primal dual predictor \ 1357 1362 corrector algorithm. You may want to link in an alternative \ 1358 1363 ordering and factorization. It will also solve models \ 1359 1364 with quadratic objectives." 1360 1361 );1362 parameters[numberParameters++]=1363 CbcOrClpParam("basisI!n","Import basis from bas file",1364 BASISIN,3);1365 parameters[numberParameters1].setLonghelp1366 ( 1367 "This will read an MPS format basis file from the given file name. It will use the default\1365 1366 ); 1367 parameters[numberParameters++] = 1368 CbcOrClpParam("basisI!n", "Import basis from bas file", 1369 CLP_PARAM_ACTION_BASISIN, 3); 1370 parameters[numberParameters1].setLonghelp 1371 ( 1372 "This will read an MPS format basis file from the given file name. It will use the default\ 1368 1373 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 1369 1374 is initialized to '', i.e. it must be set. If you have libz then it can read compressed\ 1370 1375 files 'xxxxxxxx.gz' or xxxxxxxx.bz2." 1371 );1372 parameters[numberParameters++]=1373 CbcOrClpParam("basisO!ut","Export basis as bas file",1374 1375 parameters[numberParameters1].setLonghelp1376 ( 1377 "This will write an MPS format basis file to the given file name. It will use the default\1376 ); 1377 parameters[numberParameters++] = 1378 CbcOrClpParam("basisO!ut", "Export basis as bas file", 1379 CLP_PARAM_ACTION_BASISOUT); 1380 parameters[numberParameters1].setLonghelp 1381 ( 1382 "This will write an MPS format basis file to the given file name. It will use the default\ 1378 1383 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 1379 1384 is initialized to 'default.bas'." 1380 );1381 parameters[numberParameters++]=1382 CbcOrClpParam("biasLU","Whether factorization biased towards U",1383 "UU",BIASLU,2,0);1384 parameters[numberParameters1].append("UX");1385 parameters[numberParameters1].append("LX");1386 parameters[numberParameters1].append("LL");1387 parameters[numberParameters1].setCurrentOption("LX");1388 #endif 1389 #ifdef COIN_HAS_CBC 1390 parameters[numberParameters++]=1391 CbcOrClpParam("branch!AndCut","Do Branch and Cut",1392 1393 parameters[numberParameters1].setLonghelp1394 ( 1395 "This does branch and cut. There are many parameters which can affect the performance. \1385 ); 1386 parameters[numberParameters++] = 1387 CbcOrClpParam("biasLU", "Whether factorization biased towards U", 1388 "UU", CLP_PARAM_STR_BIASLU, 2, 0); 1389 parameters[numberParameters1].append("UX"); 1390 parameters[numberParameters1].append("LX"); 1391 parameters[numberParameters1].append("LL"); 1392 parameters[numberParameters1].setCurrentOption("LX"); 1393 #endif 1394 #ifdef COIN_HAS_CBC 1395 parameters[numberParameters++] = 1396 CbcOrClpParam("branch!AndCut", "Do Branch and Cut", 1397 CBC_PARAM_ACTION_BAB); 1398 parameters[numberParameters1].setLonghelp 1399 ( 1400 "This does branch and cut. There are many parameters which can affect the performance. \ 1396 1401 First just try with default settings and look carefully at the log file. Did cuts help? Did they take too long? \ 1397 1402 Look at output to see which cuts were effective and then do some tuning. You will see that the \ … … 1408 1413 and trustPseudoCosts parameters. If cuts did a good job, then you may wish to \ 1409 1414 have more rounds of cuts  see passC!uts and passT!ree." 1410 );1411 #endif 1412 parameters[numberParameters++]=1413 CbcOrClpParam("bscale","Whether to scale in barrier (and ordering speed)",1414 "off",BARRIERSCALE,7,0);1415 parameters[numberParameters1].append("on");1416 parameters[numberParameters1].append("off1");1417 parameters[numberParameters1].append("on1");1418 parameters[numberParameters1].append("off2");1419 parameters[numberParameters1].append("on2");1420 parameters[numberParameters++]=1421 CbcOrClpParam("chol!esky","Which cholesky algorithm",1422 "native",CHOLESKY,7);1423 parameters[numberParameters1].append("dense");1424 //#ifdef FOREIGN_BARRIER1415 ); 1416 #endif 1417 parameters[numberParameters++] = 1418 CbcOrClpParam("bscale", "Whether to scale in barrier (and ordering speed)", 1419 "off", CLP_PARAM_STR_BARRIERSCALE, 7, 0); 1420 parameters[numberParameters1].append("on"); 1421 parameters[numberParameters1].append("off1"); 1422 parameters[numberParameters1].append("on1"); 1423 parameters[numberParameters1].append("off2"); 1424 parameters[numberParameters1].append("on2"); 1425 parameters[numberParameters++] = 1426 CbcOrClpParam("chol!esky", "Which cholesky algorithm", 1427 "native", CLP_PARAM_STR_CHOLESKY, 7); 1428 parameters[numberParameters1].append("dense"); 1429 //#ifdef FOREIGN_BARRIER 1425 1430 #ifdef WSSMP_BARRIER 1426 parameters[numberParameters1].append("fudge!Long");1427 parameters[numberParameters1].append("wssmp");1431 parameters[numberParameters1].append("fudge!Long"); 1432 parameters[numberParameters1].append("wssmp"); 1428 1433 #else 1429 parameters[numberParameters1].append("fudge!Long_dummy");1430 parameters[numberParameters1].append("wssmp_dummy");1434 parameters[numberParameters1].append("fudge!Long_dummy"); 1435 parameters[numberParameters1].append("wssmp_dummy"); 1431 1436 #endif 1432 1437 #ifdef UFL_BARRIER 1433 parameters[numberParameters1].append("Uni!versityOfFlorida");1438 parameters[numberParameters1].append("Uni!versityOfFlorida"); 1434 1439 #else 1435 parameters[numberParameters1].append("Uni!versityOfFlorida_dummy");1440 parameters[numberParameters1].append("Uni!versityOfFlorida_dummy"); 1436 1441 #endif 1437 1442 #ifdef TAUCS_BARRIER 1438 parameters[numberParameters1].append("Taucs");1443 parameters[numberParameters1].append("Taucs"); 1439 1444 #else 1440 parameters[numberParameters1].append("Taucs_dummy");1445 parameters[numberParameters1].append("Taucs_dummy"); 1441 1446 #endif 1442 1447 #ifdef MUMPS_BARRIER 1443 parameters[numberParameters1].append("Mumps");1448 parameters[numberParameters1].append("Mumps"); 1444 1449 #else 1445 parameters[numberParameters1].append("Mumps_dummy");1446 #endif 1447 parameters[numberParameters1].setLonghelp1448 ( 1449 "For a barrier code to be effective it needs a good Cholesky ordering and factorization. \1450 parameters[numberParameters1].append("Mumps_dummy"); 1451 #endif 1452 parameters[numberParameters1].setLonghelp 1453 ( 1454 "For a barrier code to be effective it needs a good Cholesky ordering and factorization. \ 1450 1455 The native ordering and factorization is not state of the art, although acceptable. \ 1451 1456 You may want to link in one from another source. See Makefile.locations for some \ 1452 1457 possibilities." 1453 );1454 //#endif1455 #ifdef COIN_HAS_CBC 1456 parameters[numberParameters++]=1457 CbcOrClpParam("clique!Cuts","Whether to use Clique cuts",1458 "off",CLIQUECUTS);1459 parameters[numberParameters1].append("on");1460 parameters[numberParameters1].append("root");1461 parameters[numberParameters1].append("ifmove");1462 parameters[numberParameters1].append("forceOn");1463 parameters[numberParameters1].append("onglobal");1464 parameters[numberParameters1].setLonghelp1465 ( 1466 "This switches on clique cuts (either at root or in entire tree) \1458 ); 1459 //#endif 1460 #ifdef COIN_HAS_CBC 1461 parameters[numberParameters++] = 1462 CbcOrClpParam("clique!Cuts", "Whether to use Clique cuts", 1463 "off", CBC_PARAM_STR_CLIQUECUTS); 1464 parameters[numberParameters1].append("on"); 1465 parameters[numberParameters1].append("root"); 1466 parameters[numberParameters1].append("ifmove"); 1467 parameters[numberParameters1].append("forceOn"); 1468 parameters[numberParameters1].append("onglobal"); 1469 parameters[numberParameters1].setLonghelp 1470 ( 1471 "This switches on clique cuts (either at root or in entire tree) \ 1467 1472 See branchAndCut for information on options." 1468 );1469 parameters[numberParameters++]=1470 CbcOrClpParam("combine!Solutions","Whether to use combine solution heuristic",1471 "off",COMBINE);1472 parameters[numberParameters1].append("on");1473 parameters[numberParameters1].append("both");1474 parameters[numberParameters1].append("before");1475 parameters[numberParameters1].setLonghelp1476 ( 1477 "This switches on a heuristic which does branch and cut on the problem given by just \1473 ); 1474 parameters[numberParameters++] = 1475 CbcOrClpParam("combine!Solutions", "Whether to use combine solution heuristic", 1476 "off", CBC_PARAM_STR_COMBINE); 1477 parameters[numberParameters1].append("on"); 1478 parameters[numberParameters1].append("both"); 1479 parameters[numberParameters1].append("before"); 1480 parameters[numberParameters1].setLonghelp 1481 ( 1482 "This switches on a heuristic which does branch and cut on the problem given by just \ 1478 1483 using variables which have appeared in one or more solutions. \ 1479 1484 It obviously only tries after two or more solutions. \ 1480 1485 See Rounding for meaning of on,both,before" 1481 );1482 parameters[numberParameters++]=1483 CbcOrClpParam("combine2!Solutions","Whether to use crossover solution heuristic",1484 "off",CROSSOVER2);1485 parameters[numberParameters1].append("on");1486 parameters[numberParameters1].append("both");1487 parameters[numberParameters1].append("before");1488 parameters[numberParameters1].setLonghelp1489 ( 1490 "This switches on a heuristic which does branch and cut on the problem given by \1486 ); 1487 parameters[numberParameters++] = 1488 CbcOrClpParam("combine2!Solutions", "Whether to use crossover solution heuristic", 1489 "off", CBC_PARAM_STR_CROSSOVER2); 1490 parameters[numberParameters1].append("on"); 1491 parameters[numberParameters1].append("both"); 1492 parameters[numberParameters1].append("before"); 1493 parameters[numberParameters1].setLonghelp 1494 ( 1495 "This switches on a heuristic which does branch and cut on the problem given by \ 1491 1496 fixing variables which have same value in two or more solutions. \ 1492 1497 It obviously only tries after two or more solutions. \ 1493 1498 See Rounding for meaning of on,both,before" 1494 );1495 parameters[numberParameters++]=1496 CbcOrClpParam("cost!Strategy","How to use costs as priorities",1497 "off",COSTSTRATEGY);1498 parameters[numberParameters1].append("pri!orities");1499 parameters[numberParameters1].append("column!Order?");1500 parameters[numberParameters1].append("01f!irst?");1501 parameters[numberParameters1].append("01l!ast?");1502 parameters[numberParameters1].append("length!?");1503 parameters[numberParameters1].setLonghelp1504 ( 1505 "This orders the variables in order of their absolute costs  with largest cost ones being branched on \1499 ); 1500 parameters[numberParameters++] = 1501 CbcOrClpParam("cost!Strategy", "How to use costs as priorities", 1502 "off", CBC_PARAM_STR_COSTSTRATEGY); 1503 parameters[numberParameters1].append("pri!orities"); 1504 parameters[numberParameters1].append("column!Order?"); 1505 parameters[numberParameters1].append("01f!irst?"); 1506 parameters[numberParameters1].append("01l!ast?"); 1507 parameters[numberParameters1].append("length!?"); 1508 parameters[numberParameters1].setLonghelp 1509 ( 1510 "This orders the variables in order of their absolute costs  with largest cost ones being branched on \ 1506 1511 first. This primitive strategy can be surprsingly effective. The column order\ 1507 1512 option is obviously not on costs but easy to code here." 1508 );1509 parameters[numberParameters++]=1510 CbcOrClpParam("cplex!Use","Whether to use Cplex!",1511 "off",CPX);1512 parameters[numberParameters1].append("on");1513 parameters[numberParameters1].setLonghelp1514 ( 1515 " If the user has Cplex, but wants to use some of Cbc's heuristics \1513 ); 1514 parameters[numberParameters++] = 1515 CbcOrClpParam("cplex!Use", "Whether to use Cplex!", 1516 "off", CBC_PARAM_STR_CPX); 1517 parameters[numberParameters1].append("on"); 1518 parameters[numberParameters1].setLonghelp 1519 ( 1520 " If the user has Cplex, but wants to use some of Cbc's heuristics \ 1516 1521 then you can! If this is on, then Cbc will get to the root node and then \ 1517 1522 hand over to Cplex. If heuristics find a solution this can be significantly \ … … 1520 1525 off preprocessing, although for difficult problems it is worth trying \ 1521 1526 both." 1522 );1523 #endif 1524 parameters[numberParameters++]=1525 CbcOrClpParam("cpp!Generate","Generates C++ code",1526 1,50000,CPP,1);1527 parameters[numberParameters1].setLonghelp1528 ( 1529 "Once you like what the standalone solver does then this allows \1527 ); 1528 #endif 1529 parameters[numberParameters++] = 1530 CbcOrClpParam("cpp!Generate", "Generates C++ code", 1531 1, 50000, CLP_PARAM_INT_CPP, 1); 1532 parameters[numberParameters1].setLonghelp 1533 ( 1534 "Once you like what the standalone solver does then this allows \ 1530 1535 you to generate user_driver.cpp which approximates the code. \ 1531 1536 0 gives simplest driver, 1 generates saves and restores, 2 \ … … 1534 1539 This is now deprecated as you can call standalone solver  see \ 1535 1540 Cbc/examples/driver4.cpp." 1536 1541 ); 1537 1542 #ifdef COIN_HAS_CLP 1538 parameters[numberParameters++]=1539 CbcOrClpParam("crash","Whether to create basis for problem",1540 "off",CRASH);1541 parameters[numberParameters1].append("on");1542 parameters[numberParameters1].append("so!low_halim");1543 parameters[numberParameters1].append("ha!lim_solow(JJF mods)");1544 // parameters[numberParameters1].append("4");1545 // parameters[numberParameters1].append("5");1546 parameters[numberParameters1].setLonghelp1547 ( 1548 "If crash is set on and there is an all slack basis then Clp will flip or put structural\1543 parameters[numberParameters++] = 1544 CbcOrClpParam("crash", "Whether to create basis for problem", 1545 "off", CLP_PARAM_STR_CRASH); 1546 parameters[numberParameters1].append("on"); 1547 parameters[numberParameters1].append("so!low_halim"); 1548 parameters[numberParameters1].append("ha!lim_solow(JJF mods)"); 1549 // parameters[numberParameters1].append("4"); 1550 // parameters[numberParameters1].append("5"); 1551 parameters[numberParameters1].setLonghelp 1552 ( 1553 "If crash is set on and there is an all slack basis then Clp will flip or put structural\ 1549 1554 variables into basis with the aim of getting dual feasible. On the whole dual seems to be\ 1550 1555 better without it and there are alternative types of 'crash' for primal e.g. 'idiot' or 'sprint'. \ 1551 I have also added a variant due to Solow and Halim which is as on but just flip."); 1552 parameters[numberParameters++]=1553 CbcOrClpParam("cross!over","Whether to get a basic solution after barrier",1554 "on",CROSSOVER);1555 parameters[numberParameters1].append("off");1556 parameters[numberParameters1].append("maybe");1557 parameters[numberParameters1].append("presolve");1558 parameters[numberParameters1].setLonghelp1559 ( 1560 "Interior point algorithms do not obtain a basic solution (and \1556 I have also added a variant due to Solow and Halim which is as on but just flip."); 1557 parameters[numberParameters++] = 1558 CbcOrClpParam("cross!over", "Whether to get a basic solution after barrier", 1559 "on", CLP_PARAM_STR_CROSSOVER); 1560 parameters[numberParameters1].append("off"); 1561 parameters[numberParameters1].append("maybe"); 1562 parameters[numberParameters1].append("presolve"); 1563 parameters[numberParameters1].setLonghelp 1564 ( 1565 "Interior point algorithms do not obtain a basic solution (and \ 1561 1566 the feasibility criterion is a bit suspect (JJF)). This option will crossover \ 1562 1567 to a basic solution suitable for ranging or branch and cut. With the current state \ 1563 1568 of quadratic it may be a good idea to switch off crossover for quadratic (and maybe \ 1564 1569 presolve as well)  the option maybe does this." 1565 1566 #endif 1567 #ifdef COIN_HAS_CBC 1568 parameters[numberParameters++]=1569 CbcOrClpParam("csv!Statistics","Create one line of statistics",1570 CSVSTATISTICS,2,1);1571 parameters[numberParameters1].setLonghelp1572 ( 1573 "This appends statistics to given file name. It will use the default\1570 ); 1571 #endif 1572 #ifdef COIN_HAS_CBC 1573 parameters[numberParameters++] = 1574 CbcOrClpParam("csv!Statistics", "Create one line of statistics", 1575 CLP_PARAM_ACTION_CSVSTATISTICS, 2, 1); 1576 parameters[numberParameters1].setLonghelp 1577 ( 1578 "This appends statistics to given file name. It will use the default\ 1574 1579 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 1575 1580 is initialized to '', i.e. it must be set. Adds header if file empty or does not exist." 1576 );1577 parameters[numberParameters++]=1578 CbcOrClpParam("cutD!epth","Depth in tree at which to do cuts",1579 1,999999,CUTDEPTH);1580 parameters[numberParameters1].setLonghelp1581 ( 1582 "Cut generators may be  off, on only at root, on if they look possible \1581 ); 1582 parameters[numberParameters++] = 1583 CbcOrClpParam("cutD!epth", "Depth in tree at which to do cuts", 1584 1, 999999, CBC_PARAM_INT_CUTDEPTH); 1585 parameters[numberParameters1].setLonghelp 1586 ( 1587 "Cut generators may be  off, on only at root, on if they look possible \ 1583 1588 and on. If they are done every node then that is that, but it may be worth doing them \ 1584 1589 every so often. The original method was every so many nodes but it is more logical \ 1585 1590 to do it whenever depth in tree is a multiple of K. This option does that and defaults \ 1586 1591 to 1 (off > code decides)." 1587 1588 parameters[numberParameters1].setIntValue(1);1589 parameters[numberParameters++]=1590 CbcOrClpParam("cutL!ength","Length of a cut",1591 1,COIN_INT_MAX,CUTLENGTH);1592 parameters[numberParameters1].setLonghelp1593 ( 1594 "At present this only applies to Gomory cuts. 1 (default) leaves as is. \1592 ); 1593 parameters[numberParameters1].setIntValue(1); 1594 parameters[numberParameters++] = 1595 CbcOrClpParam("cutL!ength", "Length of a cut", 1596 1, COIN_INT_MAX, CBC_PARAM_INT_CUTLENGTH); 1597 parameters[numberParameters1].setLonghelp 1598 ( 1599 "At present this only applies to Gomory cuts. 1 (default) leaves as is. \ 1595 1600 Any value >0 says that all cuts <= this length can be generated both at \ 1596 1601 root node and in tree. 0 says to use some dynamic lengths. If value >=10,000,000 \ 1597 1602 then the length in tree is value%10000000  so 10000100 means unlimited length \ 1598 1603 at root and 100 in tree." 1599 1600 parameters[numberParameters1].setIntValue(1);1601 parameters[numberParameters++]=1602 CbcOrClpParam("cuto!ff","All solutions must be better than this",1603 1.0e60,1.0e60,CUTOFF);1604 parameters[numberParameters1].setDoubleValue(1.0e50);1605 parameters[numberParameters1].setLonghelp1606 ( 1607 "All solutions must be better than this value (in a minimization sense). \1604 ); 1605 parameters[numberParameters1].setIntValue(1); 1606 parameters[numberParameters++] = 1607 CbcOrClpParam("cuto!ff", "All solutions must be better than this", 1608 1.0e60, 1.0e60, CBC_PARAM_DBL_CUTOFF); 1609 parameters[numberParameters1].setDoubleValue(1.0e50); 1610 parameters[numberParameters1].setLonghelp 1611 ( 1612 "All solutions must be better than this value (in a minimization sense). \ 1608 1613 This is also set by code whenever it obtains a solution and is set to value of \ 1609 1614 objective for solution minus cutoff increment." 1610 1611 parameters[numberParameters++]=1612 CbcOrClpParam("cuts!OnOff","Switches all cuts on or off",1613 "off",CUTSSTRATEGY);1614 parameters[numberParameters1].append("on");1615 parameters[numberParameters1].append("root");1616 parameters[numberParameters1].append("ifmove");1617 parameters[numberParameters1].append("forceOn");1618 parameters[numberParameters1].setLonghelp1619 ( 1620 "This can be used to switch on or off all cuts (apart from Reduce and Split). Then you can do \1615 ); 1616 parameters[numberParameters++] = 1617 CbcOrClpParam("cuts!OnOff", "Switches all cuts on or off", 1618 "off", CBC_PARAM_STR_CUTSSTRATEGY); 1619 parameters[numberParameters1].append("on"); 1620 parameters[numberParameters1].append("root"); 1621 parameters[numberParameters1].append("ifmove"); 1622 parameters[numberParameters1].append("forceOn"); 1623 parameters[numberParameters1].setLonghelp 1624 ( 1625 "This can be used to switch on or off all cuts (apart from Reduce and Split). Then you can do \ 1621 1626 individual ones off or on \ 1622 1627 See branchAndCut for information on options." 1623 );1624 parameters[numberParameters++]=1625 CbcOrClpParam("debug!In","read valid solution from file",1626 DEBUG,7,1);1627 parameters[numberParameters1].setLonghelp1628 ( 1629 "This will read a solution file from the given file name. It will use the default\1628 ); 1629 parameters[numberParameters++] = 1630 CbcOrClpParam("debug!In", "read valid solution from file", 1631 CLP_PARAM_ACTION_DEBUG, 7, 1); 1632 parameters[numberParameters1].setLonghelp 1633 ( 1634 "This will read a solution file from the given file name. It will use the default\ 1630 1635 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 1631 1636 is initialized to '', i.e. it must be set.\n\n\ … … 1634 1639 you can do a good run with debug set to 'create' and then switch on the cuts you suspect and \ 1635 1640 rerun with debug set to 'debug.file' The create case has same effect as saveSolution." 1636 );1637 #endif 1641 ); 1642 #endif 1638 1643 #ifdef COIN_HAS_CLP 1639 1644 #if CLP_MULTIPLE_FACTORIZATIONS >0 1640 parameters[numberParameters++]=1641 CbcOrClpParam("dense!Threshold","Whether to use dense factorization",1642 1,10000,DENSE,1);1643 parameters[numberParameters1].setLonghelp1644 ( 1645 "If processed problem <= this use dense factorization"1646 );1647 parameters[numberParameters1].setIntValue(1);1648 #endif 1649 #endif 1650 #ifdef COIN_HAS_CBC 1651 parameters[numberParameters++]=1652 CbcOrClpParam("depth!MiniBab","Depth at which to try mini BAB",1653 COIN_INT_MAX,COIN_INT_MAX,DEPTHMINIBAB);1654 parameters[numberParameters1].setIntValue(1);1655 parameters[numberParameters1].setLonghelp1656 ( 1657 "Rather a complicated parameter but can be useful. 1 means off for large problems but on as if 12 for problems where rows+columns<500, 2 \1645 parameters[numberParameters++] = 1646 CbcOrClpParam("dense!Threshold", "Whether to use dense factorization", 1647 1, 10000, CBC_PARAM_INT_DENSE, 1); 1648 parameters[numberParameters1].setLonghelp 1649 ( 1650 "If processed problem <= this use dense factorization" 1651 ); 1652 parameters[numberParameters1].setIntValue(1); 1653 #endif 1654 #endif 1655 #ifdef COIN_HAS_CBC 1656 parameters[numberParameters++] = 1657 CbcOrClpParam("depth!MiniBab", "Depth at which to try mini BAB", 1658 COIN_INT_MAX, COIN_INT_MAX, CBC_PARAM_INT_DEPTHMINIBAB); 1659 parameters[numberParameters1].setIntValue(1); 1660 parameters[numberParameters1].setLonghelp 1661 ( 1662 "Rather a complicated parameter but can be useful. 1 means off for large problems but on as if 12 for problems where rows+columns<500, 2 \ 1658 1663 means use Cplex if it is linked in. Otherwise if negative then go into depth first complete search fast branch and bound when depth>= value2 (so 3 will use this at depth>=1). This mode is only switched on after 500 nodes. If you really want to switch it off for small problems then set this to 999. If >=0 the value doesn't matter very much. The code will do approximately 100 nodes of fast branch and bound every now and then at depth>=5. The actual logic is too twisted to describe here." 1659 );1660 parameters[numberParameters++]=1661 CbcOrClpParam("dextra3","Extra double parameter 3",1662 COIN_DBL_MAX,COIN_DBL_MAX,DEXTRA3,0);1663 parameters[numberParameters1].setDoubleValue(0.0);1664 parameters[numberParameters++]=1665 CbcOrClpParam("dextra4","Extra double parameter 4",1666 COIN_DBL_MAX,COIN_DBL_MAX,DEXTRA4,0);1667 parameters[numberParameters1].setDoubleValue(0.0);1668 parameters[numberParameters++]=1669 CbcOrClpParam("dextra5","Extra double parameter 5",1670 COIN_DBL_MAX,COIN_DBL_MAX,DEXTRA5,0);1671 parameters[numberParameters1].setDoubleValue(0.0);1672 parameters[numberParameters++]=1673 CbcOrClpParam("Dins","Whether to try Distance Induced Neighborhood Search",1674 "off",DINS);1675 parameters[numberParameters1].append("on");1676 parameters[numberParameters1].append("both");1677 parameters[numberParameters1].append("before");1678 parameters[numberParameters1].append("often");1679 parameters[numberParameters1].setLonghelp1680 ( 1681 "This switches on Distance induced neighborhood Search. \1664 ); 1665 parameters[numberParameters++] = 1666 CbcOrClpParam("dextra3", "Extra double parameter 3", 1667 COIN_DBL_MAX, COIN_DBL_MAX, CBC_PARAM_DBL_DEXTRA3, 0); 1668 parameters[numberParameters1].setDoubleValue(0.0); 1669 parameters[numberParameters++] = 1670 CbcOrClpParam("dextra4", "Extra double parameter 4", 1671 COIN_DBL_MAX, COIN_DBL_MAX, CBC_PARAM_DBL_DEXTRA4, 0); 1672 parameters[numberParameters1].setDoubleValue(0.0); 1673 parameters[numberParameters++] = 1674 CbcOrClpParam("dextra5", "Extra double parameter 5", 1675 COIN_DBL_MAX, COIN_DBL_MAX, CBC_PARAM_DBL_DEXTRA5, 0); 1676 parameters[numberParameters1].setDoubleValue(0.0); 1677 parameters[numberParameters++] = 1678 CbcOrClpParam("Dins", "Whether to try Distance Induced Neighborhood Search", 1679 "off", CBC_PARAM_STR_DINS); 1680 parameters[numberParameters1].append("on"); 1681 parameters[numberParameters1].append("both"); 1682 parameters[numberParameters1].append("before"); 1683 parameters[numberParameters1].append("often"); 1684 parameters[numberParameters1].setLonghelp 1685 ( 1686 "This switches on Distance induced neighborhood Search. \ 1682 1687 See Rounding for meaning of on,both,before" 1683 );1684 #endif 1685 parameters[numberParameters++]=1686 CbcOrClpParam("direction","Minimize or Maximize",1687 "min!imize",DIRECTION);1688 parameters[numberParameters1].append("max!imize");1689 parameters[numberParameters1].append("zero");1690 parameters[numberParameters1].setLonghelp1691 ( 1692 "The default is minimize  use 'direction maximize' for maximization.\n\1688 ); 1689 #endif 1690 parameters[numberParameters++] = 1691 CbcOrClpParam("direction", "Minimize or Maximize", 1692 "min!imize", CLP_PARAM_STR_DIRECTION); 1693 parameters[numberParameters1].append("max!imize"); 1694 parameters[numberParameters1].append("zero"); 1695 parameters[numberParameters1].setLonghelp 1696 ( 1697 "The default is minimize  use 'direction maximize' for maximization.\n\ 1693 1698 You can also use the parameters 'maximize' or 'minimize'." 1694 );1695 parameters[numberParameters++]=1696 CbcOrClpParam("directory","Set Default directory for import etc.",1697 1698 parameters[numberParameters1].setLonghelp1699 ( 1700 "This sets the directory which import, export, saveModel, restoreModel etc will use.\1699 ); 1700 parameters[numberParameters++] = 1701 CbcOrClpParam("directory", "Set Default directory for import etc.", 1702 CLP_PARAM_ACTION_DIRECTORY); 1703 parameters[numberParameters1].setLonghelp 1704 ( 1705 "This sets the directory which import, export, saveModel, restoreModel etc will use.\ 1701 1706 It is initialized to './'" 1702 );1703 parameters[numberParameters++]=1704 CbcOrClpParam("dirSample","Set directory where the COINOR sample problems are.",1705 DIRSAMPLE,7,1);1706 parameters[numberParameters1].setLonghelp1707 ( 1708 "This sets the directory where the COINOR sample problems reside. It is\1707 ); 1708 parameters[numberParameters++] = 1709 CbcOrClpParam("dirSample", "Set directory where the COINOR sample problems are.", 1710 CLP_PARAM_ACTION_DIRSAMPLE, 7, 1); 1711 parameters[numberParameters1].setLonghelp 1712 ( 1713 "This sets the directory where the COINOR sample problems reside. It is\ 1709 1714 used only when unitTest is passed to clp. clp will pick up the test problems\ 1710 1715 from this directory.\ 1711 1716 It is initialized to '../../Data/Sample'" 1712 );1713 parameters[numberParameters++]=1714 CbcOrClpParam("dirNetlib","Set directory where the netlib problems are.",1715 DIRNETLIB,7,1);1716 parameters[numberParameters1].setLonghelp1717 ( 1718 "This sets the directory where the netlib problems reside. One can get\1717 ); 1718 parameters[numberParameters++] = 1719 CbcOrClpParam("dirNetlib", "Set directory where the netlib problems are.", 1720 CLP_PARAM_ACTION_DIRNETLIB, 7, 1); 1721 parameters[numberParameters1].setLonghelp 1722 ( 1723 "This sets the directory where the netlib problems reside. One can get\ 1719 1724 the netlib problems from COINOR or from the main netlib site. This\ 1720 1725 parameter is used only when netlib is passed to clp. clp will pick up the\ … … 1722 1727 then the problems must be uncompressed.\ 1723 1728 It is initialized to '../../Data/Netlib'" 1724 );1725 parameters[numberParameters++]=1726 CbcOrClpParam("dirMiplib","Set directory where the miplib 2003 problems are.",1727 DIRMIPLIB,7,1);1728 parameters[numberParameters1].setLonghelp1729 ( 1730 "This sets the directory where the miplib 2003 problems reside. One can\1729 ); 1730 parameters[numberParameters++] = 1731 CbcOrClpParam("dirMiplib", "Set directory where the miplib 2003 problems are.", 1732 CBC_PARAM_ACTION_DIRMIPLIB, 7, 1); 1733 parameters[numberParameters1].setLonghelp 1734 ( 1735 "This sets the directory where the miplib 2003 problems reside. One can\ 1731 1736 get the miplib problems from COINOR or from the main miplib site. This\ 1732 1737 parameter is used only when miplib is passed to cbc. cbc will pick up the\ … … 1734 1739 then the problems must be uncompressed.\ 1735 1740 It is initialized to '../../Data/miplib3'" 1736 );1737 #ifdef COIN_HAS_CBC 1738 parameters[numberParameters++]=1739 CbcOrClpParam("diveO!pt","Diving options",1740 1,200000,DIVEOPT,1);1741 parameters[numberParameters1].setLonghelp1742 ( 1743 "If >2 && <8 then modify diving options  \1741 ); 1742 #ifdef COIN_HAS_CBC 1743 parameters[numberParameters++] = 1744 CbcOrClpParam("diveO!pt", "Diving options", 1745 1, 200000, CBC_PARAM_INT_DIVEOPT, 1); 1746 parameters[numberParameters1].setLonghelp 1747 ( 1748 "If >2 && <8 then modify diving options  \ 1744 1749 \t3 only at root and if no solution, \ 1745 1750 \t4 only at root and if this heuristic has not got solution, \ … … 1747 1752 \t6 decay, \ 1748 1753 \t7 run up to 2 times if solution found 4 otherwise." 1749 );1750 parameters[numberParameters1].setIntValue(1);1751 parameters[numberParameters++]=1752 CbcOrClpParam("DivingS!ome","Whether to try Diving heuristics",1753 "off",DIVINGS);1754 parameters[numberParameters1].append("on");1755 parameters[numberParameters1].append("both");1756 parameters[numberParameters1].append("before");1757 parameters[numberParameters1].setLonghelp1758 ( 1759 "This switches on a random diving heuristic at various times. \1754 ); 1755 parameters[numberParameters1].setIntValue(1); 1756 parameters[numberParameters++] = 1757 CbcOrClpParam("DivingS!ome", "Whether to try Diving heuristics", 1758 "off", CBC_PARAM_STR_DIVINGS); 1759 parameters[numberParameters1].append("on"); 1760 parameters[numberParameters1].append("both"); 1761 parameters[numberParameters1].append("before"); 1762 parameters[numberParameters1].setLonghelp 1763 ( 1764 "This switches on a random diving heuristic at various times. \ 1760 1765 C  Coefficient, F  Fractional, G  Guided, L  LineSearch, P  PseudoCost, V  VectorLength. \ 1761 1766 You may prefer to use individual on/off \ 1762 1767 See Rounding for meaning of on,both,before" 1763 );1764 parameters[numberParameters++]=1765 CbcOrClpParam("DivingC!oefficient","Whether to try DiveCoefficient",1766 "off",DIVINGC);1767 parameters[numberParameters1].append("on");1768 parameters[numberParameters1].append("both");1769 parameters[numberParameters1].append("before");1770 parameters[numberParameters++]=1771 CbcOrClpParam("DivingF!ractional","Whether to try DiveFractional",1772 "off",DIVINGF);1773 parameters[numberParameters1].append("on");1774 parameters[numberParameters1].append("both");1775 parameters[numberParameters1].append("before");1776 parameters[numberParameters++]=1777 CbcOrClpParam("DivingG!uided","Whether to try DiveGuided",1778 "off",DIVINGG);1779 parameters[numberParameters1].append("on");1780 parameters[numberParameters1].append("both");1781 parameters[numberParameters1].append("before");1782 parameters[numberParameters++]=1783 CbcOrClpParam("DivingL!ineSearch","Whether to try DiveLineSearch",1784 "off",DIVINGL);1785 parameters[numberParameters1].append("on");1786 parameters[numberParameters1].append("both");1787 parameters[numberParameters1].append("before");1788 parameters[numberParameters++]=1789 CbcOrClpParam("DivingP!seudoCost","Whether to try DivePseudoCost",1790 "off",DIVINGP);1791 parameters[numberParameters1].append("on");1792 parameters[numberParameters1].append("both");1793 parameters[numberParameters1].append("before");1794 parameters[numberParameters++]=1795 CbcOrClpParam("DivingV!ectorLength","Whether to try DiveVectorLength",1796 "off",DIVINGV);1797 parameters[numberParameters1].append("on");1798 parameters[numberParameters1].append("both");1799 parameters[numberParameters1].append("before");1800 parameters[numberParameters++]=1801 CbcOrClpParam("doH!euristic","Do heuristics before any preprocessing",1802 DOHEURISTIC,3);1803 parameters[numberParameters1].setLonghelp1804 ( 1805 "Normally heuristics are done in branch and bound. It may be useful to do them outside. \1768 ); 1769 parameters[numberParameters++] = 1770 CbcOrClpParam("DivingC!oefficient", "Whether to try DiveCoefficient", 1771 "off", CBC_PARAM_STR_DIVINGC); 1772 parameters[numberParameters1].append("on"); 1773 parameters[numberParameters1].append("both"); 1774 parameters[numberParameters1].append("before"); 1775 parameters[numberParameters++] = 1776 CbcOrClpParam("DivingF!ractional", "Whether to try DiveFractional", 1777 "off", CBC_PARAM_STR_DIVINGF); 1778 parameters[numberParameters1].append("on"); 1779 parameters[numberParameters1].append("both"); 1780 parameters[numberParameters1].append("before"); 1781 parameters[numberParameters++] = 1782 CbcOrClpParam("DivingG!uided", "Whether to try DiveGuided", 1783 "off", CBC_PARAM_STR_DIVINGG); 1784 parameters[numberParameters1].append("on"); 1785 parameters[numberParameters1].append("both"); 1786 parameters[numberParameters1].append("before"); 1787 parameters[numberParameters++] = 1788 CbcOrClpParam("DivingL!ineSearch", "Whether to try DiveLineSearch", 1789 "off", CBC_PARAM_STR_DIVINGL); 1790 parameters[numberParameters1].append("on"); 1791 parameters[numberParameters1].append("both"); 1792 parameters[numberParameters1].append("before"); 1793 parameters[numberParameters++] = 1794 CbcOrClpParam("DivingP!seudoCost", "Whether to try DivePseudoCost", 1795 "off", CBC_PARAM_STR_DIVINGP); 1796 parameters[numberParameters1].append("on"); 1797 parameters[numberParameters1].append("both"); 1798 parameters[numberParameters1].append("before"); 1799 parameters[numberParameters++] = 1800 CbcOrClpParam("DivingV!ectorLength", "Whether to try DiveVectorLength", 1801 "off", CBC_PARAM_STR_DIVINGV); 1802 parameters[numberParameters1].append("on"); 1803 parameters[numberParameters1].append("both"); 1804 parameters[numberParameters1].append("before"); 1805 parameters[numberParameters++] = 1806 CbcOrClpParam("doH!euristic", "Do heuristics before any preprocessing", 1807 CBC_PARAM_ACTION_DOHEURISTIC, 3); 1808 parameters[numberParameters1].setLonghelp 1809 ( 1810 "Normally heuristics are done in branch and bound. It may be useful to do them outside. \ 1806 1811 Only those heuristics with 'both' or 'before' set will run. \ 1807 1812 Doing this may also set cutoff, which can help with preprocessing." 1808 );1813 ); 1809 1814 #endif 1810 1815 #ifdef COIN_HAS_CLP 1811 parameters[numberParameters++]=1812 CbcOrClpParam("dualB!ound","Initially algorithm acts as if no \1816 parameters[numberParameters++] = 1817 CbcOrClpParam("dualB!ound", "Initially algorithm acts as if no \ 1813 1818 gap between bounds exceeds this value", 1814 1.0e20,1.0e12,DUALBOUND);1815 parameters[numberParameters1].setLonghelp1816 ( 1817 "The dual algorithm in Clp is a single phase algorithm as opposed to a two phase\1819 1.0e20, 1.0e12, CLP_PARAM_DBL_DUALBOUND); 1820 parameters[numberParameters1].setLonghelp 1821 ( 1822 "The dual algorithm in Clp is a single phase algorithm as opposed to a two phase\ 1818 1823 algorithm where you first get feasible then optimal. If a problem has both upper and\ 1819 1824 lower bounds then it is trivial to get dual feasible by setting non basic variables\ … … 1824 1829 the code may go all the way and then have to increase the bounds. OSL had a heuristic to\ 1825 1830 adjust bounds, maybe we need that here." 1826 1827 parameters[numberParameters++]=1828 CbcOrClpParam("dualize","Solves dual reformulation",1829 0,3,DUALIZE,1);1830 parameters[numberParameters1].setLonghelp1831 ( 1832 "Don't even think about it."1833 );1834 parameters[numberParameters++]=1835 CbcOrClpParam("dualP!ivot","Dual pivot choice algorithm",1836 "auto!matic",DUALPIVOT,7,1);1837 parameters[numberParameters1].append("dant!zig");1838 parameters[numberParameters1].append("partial");1839 parameters[numberParameters1].append("steep!est");1840 parameters[numberParameters1].setLonghelp1841 ( 1842 "Clp can use any pivot selection algorithm which the user codes as long as it\1831 ); 1832 parameters[numberParameters++] = 1833 CbcOrClpParam("dualize", "Solves dual reformulation", 1834 0, 3, CLP_PARAM_INT_DUALIZE, 1); 1835 parameters[numberParameters1].setLonghelp 1836 ( 1837 "Don't even think about it." 1838 ); 1839 parameters[numberParameters++] = 1840 CbcOrClpParam("dualP!ivot", "Dual pivot choice algorithm", 1841 "auto!matic", CLP_PARAM_STR_DUALPIVOT, 7, 1); 1842 parameters[numberParameters1].append("dant!zig"); 1843 parameters[numberParameters1].append("partial"); 1844 parameters[numberParameters1].append("steep!est"); 1845 parameters[numberParameters1].setLonghelp 1846 ( 1847 "Clp can use any pivot selection algorithm which the user codes as long as it\ 1843 1848 implements the features in the abstract pivot base class. The Dantzig method is implemented\ 1844 1849 to show a simple method but its use is deprecated. Steepest is the method of choice and there\ … … 1846 1851 Partial switches this on while automatic decides at each iteration based on information\ 1847 1852 about the factorization." 1848 );1849 parameters[numberParameters++]=1850 CbcOrClpParam("dualS!implex","Do dual simplex algorithm",1851 1852 parameters[numberParameters1].setLonghelp1853 ( 1854 "This command solves the current model using the dual steepest edge algorithm.\1853 ); 1854 parameters[numberParameters++] = 1855 CbcOrClpParam("dualS!implex", "Do dual simplex algorithm", 1856 CLP_PARAM_ACTION_DUALSIMPLEX); 1857 parameters[numberParameters1].setLonghelp 1858 ( 1859 "This command solves the current model using the dual steepest edge algorithm.\ 1855 1860 The time and iterations may be affected by settings such as presolve, scaling, crash\ 1856 1861 and also by dual pivot method, fake bound on variables and dual and primal tolerances." 1857 1858 #endif 1859 parameters[numberParameters++]=1860 CbcOrClpParam("dualT!olerance","For an optimal solution \1862 ); 1863 #endif 1864 parameters[numberParameters++] = 1865 CbcOrClpParam("dualT!olerance", "For an optimal solution \ 1861 1866 no dual infeasibility may exceed this value", 1862 1.0e20,1.0e12,DUALTOLERANCE);1863 parameters[numberParameters1].setLonghelp1864 ( 1865 "Normally the default tolerance is fine, but you may want to increase it a\1867 1.0e20, 1.0e12, CLP_PARAM_DBL_DUALTOLERANCE); 1868 parameters[numberParameters1].setLonghelp 1869 ( 1870 "Normally the default tolerance is fine, but you may want to increase it a\ 1866 1871 bit if a dual run seems to be having a hard time. One method which can be faster is \ 1867 1872 to use a large tolerance e.g. 1.0e4 and dual and then clean up problem using primal and the \ 1868 1873 correct tolerance (remembering to switch off presolve for this final short clean up phase)." 1869 );1874 ); 1870 1875 #ifdef COIN_HAS_CLP 1871 parameters[numberParameters++]=1872 CbcOrClpParam("either!Simplex","Do dual or primal simplex algorithm",1873 1874 parameters[numberParameters1].setLonghelp1875 ( 1876 "This command solves the current model using the dual or primal algorithm,\1876 parameters[numberParameters++] = 1877 CbcOrClpParam("either!Simplex", "Do dual or primal simplex algorithm", 1878 CLP_PARAM_ACTION_EITHERSIMPLEX); 1879 parameters[numberParameters1].setLonghelp 1880 ( 1881 "This command solves the current model using the dual or primal algorithm,\ 1877 1882 based on a dubious analysis of model." 1878 1879 #endif 1880 parameters[numberParameters++]=1881 CbcOrClpParam("end","Stops clp execution",1882 1883 parameters[numberParameters1].setLonghelp1884 ( 1885 "This stops execution ; end, exit, quit and stop are synonyms"1886 );1887 parameters[numberParameters++]=1888 CbcOrClpParam("environ!ment","Read commands from environment",1889 ENVIRONMENT,7,0);1890 parameters[numberParameters1].setLonghelp1891 ( 1892 "This starts reading from environment variable CBC_CLP_ENVIRONMENT."1893 1894 parameters[numberParameters++]=1895 CbcOrClpParam("error!sAllowed","Whether to allow import errors",1896 "off",ERRORSALLOWED,3);1897 parameters[numberParameters1].append("on");1898 parameters[numberParameters1].setLonghelp1899 ( 1900 "The default is not to use any model which had errors when reading the mps file.\1883 ); 1884 #endif 1885 parameters[numberParameters++] = 1886 CbcOrClpParam("end", "Stops clp execution", 1887 CLP_PARAM_ACTION_EXIT); 1888 parameters[numberParameters1].setLonghelp 1889 ( 1890 "This stops execution ; end, exit, quit and stop are synonyms" 1891 ); 1892 parameters[numberParameters++] = 1893 CbcOrClpParam("environ!ment", "Read commands from environment", 1894 CLP_PARAM_ACTION_ENVIRONMENT, 7, 0); 1895 parameters[numberParameters1].setLonghelp 1896 ( 1897 "This starts reading from environment variable CBC_CLP_ENVIRONMENT." 1898 ); 1899 parameters[numberParameters++] = 1900 CbcOrClpParam("error!sAllowed", "Whether to allow import errors", 1901 "off", CLP_PARAM_STR_ERRORSALLOWED, 3); 1902 parameters[numberParameters1].append("on"); 1903 parameters[numberParameters1].setLonghelp 1904 ( 1905 "The default is not to use any model which had errors when reading the mps file.\ 1901 1906 Setting this to 'on' will allow all errors from which the code can recover\ 1902 1907 simply by ignoring the error. There are some errors from which the code can not recover \ 1903 1908 e.g. no ENDATA. This has to be set before import i.e. errorsAllowed on import xxxxxx.mps." 1904 1905 parameters[numberParameters++]=1906 CbcOrClpParam("exit","Stops clp execution",1907 1908 parameters[numberParameters1].setLonghelp1909 ( 1910 "This stops the execution of Clp, end, exit, quit and stop are synonyms"1911 );1912 #ifdef COIN_HAS_CBC 1913 parameters[numberParameters++]=1914 CbcOrClpParam("exp!eriment","Whether to use testing features",1915 1,200,EXPERIMENT,0);1916 parameters[numberParameters1].setLonghelp1917 ( 1918 "Defines how adventurous you want to be in using new ideas. \1909 ); 1910 parameters[numberParameters++] = 1911 CbcOrClpParam("exit", "Stops clp execution", 1912 CLP_PARAM_ACTION_EXIT); 1913 parameters[numberParameters1].setLonghelp 1914 ( 1915 "This stops the execution of Clp, end, exit, quit and stop are synonyms" 1916 ); 1917 #ifdef COIN_HAS_CBC 1918 parameters[numberParameters++] = 1919 CbcOrClpParam("exp!eriment", "Whether to use testing features", 1920 1, 200, CBC_PARAM_INT_EXPERIMENT, 0); 1921 parameters[numberParameters1].setLonghelp 1922 ( 1923 "Defines how adventurous you want to be in using new ideas. \ 1919 1924 0 then no new ideas, 1 fairly sensible, 2 a bit dubious, 3 you are on your own!" 1920 );1921 parameters[numberParameters1].setIntValue(0);1922 #endif 1923 parameters[numberParameters++]=1924 CbcOrClpParam("export","Export model as mps file",1925 1926 parameters[numberParameters1].setLonghelp1927 ( 1928 "This will write an MPS format file to the given file name. It will use the default\1925 ); 1926 parameters[numberParameters1].setIntValue(0); 1927 #endif 1928 parameters[numberParameters++] = 1929 CbcOrClpParam("export", "Export model as mps file", 1930 CLP_PARAM_ACTION_EXPORT); 1931 parameters[numberParameters1].setLonghelp 1932 ( 1933 "This will write an MPS format file to the given file name. It will use the default\ 1929 1934 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 1930 1935 is initialized to 'default.mps'. \ 1931 1936 It can be useful to get rid of the original names and go over to using Rnnnnnnn and Cnnnnnnn. This can be done by setting 'keepnames' off before importing mps file." 1932 );1933 #ifdef COIN_HAS_CBC 1934 parameters[numberParameters++]=1935 CbcOrClpParam("extra1","Extra integer parameter 1",1936 COIN_INT_MAX,COIN_INT_MAX,EXTRA1,0);1937 parameters[numberParameters1].setIntValue(1);1938 parameters[numberParameters++]=1939 CbcOrClpParam("extra2","Extra integer parameter 2",1940 100,COIN_INT_MAX,EXTRA2,0);1941 parameters[numberParameters1].setIntValue(1);1942 parameters[numberParameters++]=1943 CbcOrClpParam("extra3","Extra integer parameter 3",1944 1,COIN_INT_MAX,EXTRA3,0);1945 parameters[numberParameters1].setIntValue(1);1946 parameters[numberParameters++]=1947 CbcOrClpParam("extra4","Extra integer parameter 4",1948 1,COIN_INT_MAX,EXTRA4,0);1949 parameters[numberParameters1].setIntValue(1);1950 parameters[numberParameters1].setLonghelp1951 ( 1952 "This switches on yet more special options!! \1937 ); 1938 #ifdef COIN_HAS_CBC 1939 parameters[numberParameters++] = 1940 CbcOrClpParam("extra1", "Extra integer parameter 1", 1941 COIN_INT_MAX, COIN_INT_MAX, CBC_PARAM_INT_EXTRA1, 0); 1942 parameters[numberParameters1].setIntValue(1); 1943 parameters[numberParameters++] = 1944 CbcOrClpParam("extra2", "Extra integer parameter 2", 1945 100, COIN_INT_MAX, CBC_PARAM_INT_EXTRA2, 0); 1946 parameters[numberParameters1].setIntValue(1); 1947 parameters[numberParameters++] = 1948 CbcOrClpParam("extra3", "Extra integer parameter 3", 1949 1, COIN_INT_MAX, CBC_PARAM_INT_EXTRA3, 0); 1950 parameters[numberParameters1].setIntValue(1); 1951 parameters[numberParameters++] = 1952 CbcOrClpParam("extra4", "Extra integer parameter 4", 1953 1, COIN_INT_MAX, CBC_PARAM_INT_EXTRA4, 0); 1954 parameters[numberParameters1].setIntValue(1); 1955 parameters[numberParameters1].setLonghelp 1956 ( 1957 "This switches on yet more special options!! \ 1953 1958 The bottom digit is a strategy when to used shadow price stuff e.g. 3 \ 1954 1959 means use until a solution is found. The next two digits say what sort \ … … 1958 1963 \t8000  increase minimum drop gradually\n\ 1959 1964 \t16000  switches on alternate gomory criterion" 1960 );1965 ); 1961 1966 #endif 1962 1967 #ifdef COIN_HAS_CLP 1963 parameters[numberParameters++]=1964 CbcOrClpParam("fact!orization","Which factorization to use",1965 "normal",FACTORIZATION);1966 parameters[numberParameters1].append("dense");1967 parameters[numberParameters1].append("simple");1968 parameters[numberParameters1].append("osl");1969 parameters[numberParameters1].setLonghelp1970 ( 1971 "The default is to use the normal CoinFactorization, but \1968 parameters[numberParameters++] = 1969 CbcOrClpParam("fact!orization", "Which factorization to use", 1970 "normal", CLP_PARAM_STR_FACTORIZATION); 1971 parameters[numberParameters1].append("dense"); 1972 parameters[numberParameters1].append("simple"); 1973 parameters[numberParameters1].append("osl"); 1974 parameters[numberParameters1].setLonghelp 1975 ( 1976 "The default is to use the normal CoinFactorization, but \ 1972 1977 other choices are a dense one, osl's or one designed for small problems." 1973 );1974 parameters[numberParameters++]=1975 CbcOrClpParam("fakeB!ound","All bounds <= this value  DEBUG",1976 1.0,1.0e15,FAKEBOUND,0);1977 #ifdef COIN_HAS_CBC 1978 parameters[numberParameters++]=1979 CbcOrClpParam("feas!ibilityPump","Whether to try Feasibility Pump",1980 "off",FPUMP);1981 parameters[numberParameters1].append("on");1982 parameters[numberParameters1].append("both");1983 parameters[numberParameters1].append("before");1984 parameters[numberParameters1].setLonghelp1985 ( 1986 "This switches on feasibility pump heuristic at root. This is due to Fischetti, Lodi and Glover \1978 ); 1979 parameters[numberParameters++] = 1980 CbcOrClpParam("fakeB!ound", "All bounds <= this value  DEBUG", 1981 1.0, 1.0e15, CLP_PARAM_ACTION_FAKEBOUND, 0); 1982 #ifdef COIN_HAS_CBC 1983 parameters[numberParameters++] = 1984 CbcOrClpParam("feas!ibilityPump", "Whether to try Feasibility Pump", 1985 "off", CBC_PARAM_STR_FPUMP); 1986 parameters[numberParameters1].append("on"); 1987 parameters[numberParameters1].append("both"); 1988 parameters[numberParameters1].append("before"); 1989 parameters[numberParameters1].setLonghelp 1990 ( 1991 "This switches on feasibility pump heuristic at root. This is due to Fischetti, Lodi and Glover \ 1987 1992 and uses a sequence of Lps to try and get an integer feasible solution. \ 1988 1993 Some fine tuning is available by passFeasibilityPump and also pumpTune. \ 1989 1994 See Rounding for meaning of on,both,before" 1990 );1991 parameters[numberParameters++]=1992 CbcOrClpParam("fix!OnDj","Try heuristic based on fixing variables with \1995 ); 1996 parameters[numberParameters++] = 1997 CbcOrClpParam("fix!OnDj", "Try heuristic based on fixing variables with \ 1993 1998 reduced costs greater than this", 1994 1.0e20,1.0e20,DJFIX,1);1995 parameters[numberParameters1].setLonghelp1996 ( 1997 "If this is set integer variables with reduced costs greater than this will be fixed \1998 before branch and bound  use with extreme caution!" 1999 );2000 parameters[numberParameters++] =2001 CbcOrClpParam("flow!CoverCuts","Whether to use Flow Cover cuts",2002 "off",FLOWCUTS);1999 1.0e20, 1.0e20, CBC_PARAM_DBL_DJFIX, 1); 2000 parameters[numberParameters1].setLonghelp 2001 ( 2002 "If this is set integer variables with reduced costs greater than this will be fixed \ 2003 before branch and bound  use with extreme caution!" 2004 ); 2005 parameters[numberParameters++] = 2006 CbcOrClpParam("flow!CoverCuts", "Whether to use Flow Cover cuts", 2007 "off", CBC_PARAM_STR_FLOWCUTS); 2003 2008 parameters[numberParameters1].append("on"); 2004 2009 parameters[numberParameters1].append("root"); … … 2008 2013 parameters[numberParameters1].setLonghelp 2009 2014 ( 2010 "This switches on flow cover cuts (either at root or in entire tree) \2015 "This switches on flow cover cuts (either at root or in entire tree) \ 2011 2016 See branchAndCut for information on options." 2012 );2013 parameters[numberParameters++] =2014 CbcOrClpParam("force!Solution","Whether to use given solution as crash for BAB",2015 1,20000000,USESOLUTION);2017 ); 2018 parameters[numberParameters++] = 2019 CbcOrClpParam("force!Solution", "Whether to use given solution as crash for BAB", 2020 1, 20000000, CLP_PARAM_INT_USESOLUTION); 2016 2021 parameters[numberParameters1].setIntValue(1); 2017 2022 parameters[numberParameters1].setLonghelp 2018 2023 ( 2019 "1 off. If 1 then tries to branch to solution given by AMPL or priorities file. \2024 "1 off. If 1 then tries to branch to solution given by AMPL or priorities file. \ 2020 2025 If 0 then just tries to set as best solution \ 2021 2026 If >1 then also does that many nodes on fixed problem." 2022 );2023 parameters[numberParameters++]=2024 CbcOrClpParam("fraction!forBAB","Fraction in feasibility pump",2025 1.0e5,1.1,SMALLBAB,1);2026 parameters[numberParameters1].setDoubleValue(0.5);2027 parameters[numberParameters1].setLonghelp2028 ( 2029 "After a pass in feasibility pump, variables which have not moved \2027 ); 2028 parameters[numberParameters++] = 2029 CbcOrClpParam("fraction!forBAB", "Fraction in feasibility pump", 2030 1.0e5, 1.1, CBC_PARAM_DBL_SMALLBAB, 1); 2031 parameters[numberParameters1].setDoubleValue(0.5); 2032 parameters[numberParameters1].setLonghelp 2033 ( 2034 "After a pass in feasibility pump, variables which have not moved \ 2030 2035 about are fixed and if the preprocessed model is small enough a few nodes \ 2031 2036 of branch and bound are done on reduced problem. Small problem has to be less than this fraction of original." 2032 );2033 #endif 2034 parameters[numberParameters++]=2035 CbcOrClpParam("gamma!(Delta)","Whether to regularize barrier",2036 "off",GAMMA,7,1);2037 parameters[numberParameters1].append("on");2038 parameters[numberParameters1].append("gamma");2039 parameters[numberParameters1].append("delta");2040 parameters[numberParameters1].append("onstrong");2041 parameters[numberParameters1].append("gammastrong");2042 parameters[numberParameters1].append("deltastrong");2043 #endif 2044 #ifdef COIN_HAS_CBC 2045 parameters[numberParameters++]=2046 CbcOrClpParam("gomory!Cuts","Whether to use Gomory cuts",2047 "off",GOMORYCUTS);2048 parameters[numberParameters1].append("on");2049 parameters[numberParameters1].append("root");2050 parameters[numberParameters1].append("ifmove");2051 parameters[numberParameters1].append("forceOn");2052 parameters[numberParameters1].append("onglobal");2053 parameters[numberParameters1].append("forceandglobal");2054 parameters[numberParameters1].append("forceLongOn");2055 parameters[numberParameters1].append("long");2056 parameters[numberParameters1].setLonghelp2057 ( 2058 "The original cuts  beware of imitations! Having gone out of favor, they are now more \2037 ); 2038 #endif 2039 parameters[numberParameters++] = 2040 CbcOrClpParam("gamma!(Delta)", "Whether to regularize barrier", 2041 "off", CLP_PARAM_STR_GAMMA, 7, 1); 2042 parameters[numberParameters1].append("on"); 2043 parameters[numberParameters1].append("gamma"); 2044 parameters[numberParameters1].append("delta"); 2045 parameters[numberParameters1].append("onstrong"); 2046 parameters[numberParameters1].append("gammastrong"); 2047 parameters[numberParameters1].append("deltastrong"); 2048 #endif 2049 #ifdef COIN_HAS_CBC 2050 parameters[numberParameters++] = 2051 CbcOrClpParam("gomory!Cuts", "Whether to use Gomory cuts", 2052 "off", CBC_PARAM_STR_GOMORYCUTS); 2053 parameters[numberParameters1].append("on"); 2054 parameters[numberParameters1].append("root"); 2055 parameters[numberParameters1].append("ifmove"); 2056 parameters[numberParameters1].append("forceOn"); 2057 parameters[numberParameters1].append("onglobal"); 2058 parameters[numberParameters1].append("forceandglobal"); 2059 parameters[numberParameters1].append("forceLongOn"); 2060 parameters[numberParameters1].append("long"); 2061 parameters[numberParameters1].setLonghelp 2062 ( 2063 "The original cuts  beware of imitations! Having gone out of favor, they are now more \ 2059 2064 fashionable as LP solvers are more robust and they interact well with other cuts. They will almost always \ 2060 2065 give cuts (although in this executable they are limited as to number of variables in cut). \ 2061 2066 However the cuts may be dense so it is worth experimenting (Long allows any length). \ 2062 2067 See branchAndCut for information on options." 2063 );2064 parameters[numberParameters++]=2065 CbcOrClpParam("greedy!Heuristic","Whether to use a greedy heuristic",2066 "off",GREEDY);2067 parameters[numberParameters1].append("on");2068 parameters[numberParameters1].append("both");2069 parameters[numberParameters1].append("before");2070 //parameters[numberParameters1].append("root");2071 parameters[numberParameters1].setLonghelp2072 ( 2073 "Switches on a greedy heuristic which will try and obtain a solution. It may just fix a \2068 ); 2069 parameters[numberParameters++] = 2070 CbcOrClpParam("greedy!Heuristic", "Whether to use a greedy heuristic", 2071 "off", CBC_PARAM_STR_GREEDY); 2072 parameters[numberParameters1].append("on"); 2073 parameters[numberParameters1].append("both"); 2074 parameters[numberParameters1].append("before"); 2075 //parameters[numberParameters1].append("root"); 2076 parameters[numberParameters1].setLonghelp 2077 ( 2078 "Switches on a greedy heuristic which will try and obtain a solution. It may just fix a \ 2074 2079 percentage of variables and then try a small branch and cut run. \ 2075 2080 See Rounding for meaning of on,both,before" 2076 );2077 parameters[numberParameters++]=2078 CbcOrClpParam("heur!isticsOnOff","Switches most heuristics on or off",2079 "off",HEURISTICSTRATEGY);2080 parameters[numberParameters1].append("on");2081 parameters[numberParameters1].setLonghelp2082 ( 2083 "This can be used to switch on or off all heuristics. Then you can do \2081 ); 2082 parameters[numberParameters++] = 2083 CbcOrClpParam("heur!isticsOnOff", "Switches most heuristics on or off", 2084 "off", CBC_PARAM_STR_HEURISTICSTRATEGY); 2085 parameters[numberParameters1].append("on"); 2086 parameters[numberParameters1].setLonghelp 2087 ( 2088 "This can be used to switch on or off all heuristics. Then you can do \ 2084 2089 individual ones off or on. CbcTreeLocal is not included as it dramatically \ 2085 2090 alters search." 2086 );2087 #endif 2088 parameters[numberParameters++]=2089 CbcOrClpParam("help","Print out version, nonstandard options and some help",2090 HELP,3);2091 parameters[numberParameters1].setLonghelp2092 ( 2093 "This prints out some help to get user started. If you have printed this then \2091 ); 2092 #endif 2093 parameters[numberParameters++] = 2094 CbcOrClpParam("help", "Print out version, nonstandard options and some help", 2095 CLP_PARAM_ACTION_HELP, 3); 2096 parameters[numberParameters1].setLonghelp 2097 ( 2098 "This prints out some help to get user started. If you have printed this then \ 2094 2099 you should be past that stage:)" 2095 );2096 #ifdef COIN_HAS_CBC 2097 parameters[numberParameters++]=2098 CbcOrClpParam("hOp!tions","Heuristic options",2099 9999999,9999999,HOPTIONS,1);2100 parameters[numberParameters1].setLonghelp2101 ( 2102 "1 says stop heuristic immediately allowable gap reached. \2100 ); 2101 #ifdef COIN_HAS_CBC 2102 parameters[numberParameters++] = 2103 CbcOrClpParam("hOp!tions", "Heuristic options", 2104 9999999, 9999999, CBC_PARAM_INT_HOPTIONS, 1); 2105 parameters[numberParameters1].setLonghelp 2106 ( 2107 "1 says stop heuristic immediately allowable gap reached. \ 2103 2108 Others are for feasibility pump  \ 2104 2109 2 says do exact number of passes given, \ 2105 2110 4 only applies if initial cutoff given and says relax after 50 passes, \ 2106 2111 while 8 will adapt cutoff rhs after first solution if it looks as if code is stalling." 2107 );2108 parameters[numberParameters1].setIntValue(0);2109 parameters[numberParameters++]=2110 CbcOrClpParam("hot!StartMaxIts","Maximum iterations on hot start",2111 0,COIN_INT_MAX,MAXHOTITS);2112 ); 2113 parameters[numberParameters1].setIntValue(0); 2114 parameters[numberParameters++] = 2115 CbcOrClpParam("hot!StartMaxIts", "Maximum iterations on hot start", 2116 0, COIN_INT_MAX, CBC_PARAM_INT_MAXHOTITS); 2112 2117 #endif 2113 2118 #ifdef COIN_HAS_CLP 2114 parameters[numberParameters++]=2115 CbcOrClpParam("idiot!Crash","Whether to try idiot crash",2116 1,99999999,IDIOT);2117 parameters[numberParameters1].setLonghelp2118 ( 2119 "This is a type of 'crash' which works well on some homogeneous problems.\2119 parameters[numberParameters++] = 2120 CbcOrClpParam("idiot!Crash", "Whether to try idiot crash", 2121 1, 99999999, CLP_PARAM_INT_IDIOT); 2122 parameters[numberParameters1].setLonghelp 2123 ( 2124 "This is a type of 'crash' which works well on some homogeneous problems.\ 2120 2125 It works best on problems with unit elements and rhs but will do something to any model. It should only be\ 2121 2126 used before primal. It can be set to 1 when the code decides for itself whether to use it,\ 2122 2127 0 to switch off or n > 0 to do n passes." 2123 );2124 #endif 2125 parameters[numberParameters++]=2126 CbcOrClpParam("import","Import model from mps file",2127 IMPORT,3);2128 parameters[numberParameters1].setLonghelp2129 ( 2130 "This will read an MPS format file from the given file name. It will use the default\2128 ); 2129 #endif 2130 parameters[numberParameters++] = 2131 CbcOrClpParam("import", "Import model from mps file", 2132 CLP_PARAM_ACTION_IMPORT, 3); 2133 parameters[numberParameters1].setLonghelp 2134 ( 2135 "This will read an MPS format file from the given file name. It will use the default\ 2131 2136 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 2132 2137 is initialized to '', i.e. it must be set. If you have libgz then it can read compressed\ 2133 2138 files 'xxxxxxxx.gz' or 'xxxxxxxx.bz2'. \ 2134 2139 If 'keepnames' is off, then names are dropped > Rnnnnnnn and Cnnnnnnn." 2135 2136 #ifdef COIN_HAS_CBC 2137 parameters[numberParameters++]=2138 CbcOrClpParam("inc!rement","A valid solution must be at least this \2140 ); 2141 #ifdef COIN_HAS_CBC 2142 parameters[numberParameters++] = 2143 CbcOrClpParam("inc!rement", "A valid solution must be at least this \ 2139 2144 much better than last integer solution", 2140 1.0e20,1.0e20,INCREMENT);2141 parameters[numberParameters1].setLonghelp2142 ( 2143 "Whenever a solution is found the bound on solutions is set to solution (in a minimization\2145 1.0e20, 1.0e20, CBC_PARAM_DBL_INCREMENT); 2146 parameters[numberParameters1].setLonghelp 2147 ( 2148 "Whenever a solution is found the bound on solutions is set to solution (in a minimization\ 2144 2149 sense) plus this. If it is not set then the code will try and work one out e.g. if \ 2145 2150 all objective coefficients are multiples of 0.01 and only integer variables have entries in \ 2146 2151 objective then this can be set to 0.01. Be careful if you set this negative!" 2147 );2148 parameters[numberParameters++]=2149 CbcOrClpParam("inf!easibilityWeight","Each integer infeasibility is expected \2152 ); 2153 parameters[numberParameters++] = 2154 CbcOrClpParam("inf!easibilityWeight", "Each integer infeasibility is expected \ 2150 2155 to cost this much", 2151 0.0,1.0e20,INFEASIBILITYWEIGHT,1);2152 parameters[numberParameters1].setLonghelp2153 ( 2154 "A primitive way of deciding which node to explore next. Satisfying each integer infeasibility is \2156 0.0, 1.0e20, CBC_PARAM_DBL_INFEASIBILITYWEIGHT, 1); 2157 parameters[numberParameters1].setLonghelp 2158 ( 2159 "A primitive way of deciding which node to explore next. Satisfying each integer infeasibility is \ 2155 2160 expected to cost this much." 2156 );2157 parameters[numberParameters++]=2158 CbcOrClpParam("initialS!olve","Solve to continuous",2159 2160 parameters[numberParameters1].setLonghelp2161 ( 2162 "This just solves the problem to continuous  without adding any cuts"2163 );2164 parameters[numberParameters++]=2165 CbcOrClpParam("integerT!olerance","For an optimal solution \2161 ); 2162 parameters[numberParameters++] = 2163 CbcOrClpParam("initialS!olve", "Solve to continuous", 2164 CLP_PARAM_ACTION_SOLVECONTINUOUS); 2165 parameters[numberParameters1].setLonghelp 2166 ( 2167 "This just solves the problem to continuous  without adding any cuts" 2168 ); 2169 parameters[numberParameters++] = 2170 CbcOrClpParam("integerT!olerance", "For an optimal solution \ 2166 2171 no integer variable may be this away from an integer value", 2167 1.0e20,0.5,INTEGERTOLERANCE);2168 parameters[numberParameters1].setLonghelp2169 ( 2170 "Beware of setting this smaller than the primal tolerance."2171 );2172 #endif 2172 1.0e20, 0.5, CBC_PARAM_DBL_INTEGERTOLERANCE); 2173 parameters[numberParameters1].setLonghelp 2174 ( 2175 "Beware of setting this smaller than the primal tolerance." 2176 ); 2177 #endif 2173 2178 #ifdef COIN_HAS_CLP 2174 parameters[numberParameters++]=2175 CbcOrClpParam("keepN!ames","Whether to keep names from import",2176 "on",KEEPNAMES);2177 parameters[numberParameters1].append("off");2178 parameters[numberParameters1].setLonghelp2179 ( 2180 "It saves space to get rid of names so if you need to you can set this to off. \2179 parameters[numberParameters++] = 2180 CbcOrClpParam("keepN!ames", "Whether to keep names from import", 2181 "on", CLP_PARAM_STR_KEEPNAMES); 2182 parameters[numberParameters1].append("off"); 2183 parameters[numberParameters1].setLonghelp 2184 ( 2185 "It saves space to get rid of names so if you need to you can set this to off. \ 2181 2186 This needs to be set before the import of model  so keepnames off import xxxxx.mps." 2182 );2183 parameters[numberParameters++]=2184 CbcOrClpParam("KKT","Whether to use KKT factorization",2185 "off",KKT,7,1);2186 parameters[numberParameters1].append("on");2187 #endif 2188 #ifdef COIN_HAS_CBC 2189 parameters[numberParameters++]=2190 CbcOrClpParam("knapsack!Cuts","Whether to use Knapsack cuts",2191 "off",KNAPSACKCUTS);2192 parameters[numberParameters1].append("on");2193 parameters[numberParameters1].append("root");2194 parameters[numberParameters1].append("ifmove");2195 parameters[numberParameters1].append("forceOn");2196 parameters[numberParameters1].append("onglobal");2197 parameters[numberParameters1].append("forceandglobal");2198 parameters[numberParameters1].setLonghelp2199 ( 2200 "This switches on knapsack cuts (either at root or in entire tree) \2187 ); 2188 parameters[numberParameters++] = 2189 CbcOrClpParam("KKT", "Whether to use KKT factorization", 2190 "off", CLP_PARAM_STR_KKT, 7, 1); 2191 parameters[numberParameters1].append("on"); 2192 #endif 2193 #ifdef COIN_HAS_CBC 2194 parameters[numberParameters++] = 2195 CbcOrClpParam("knapsack!Cuts", "Whether to use Knapsack cuts", 2196 "off", CBC_PARAM_STR_KNAPSACKCUTS); 2197 parameters[numberParameters1].append("on"); 2198 parameters[numberParameters1].append("root"); 2199 parameters[numberParameters1].append("ifmove"); 2200 parameters[numberParameters1].append("forceOn"); 2201 parameters[numberParameters1].append("onglobal"); 2202 parameters[numberParameters1].append("forceandglobal"); 2203 parameters[numberParameters1].setLonghelp 2204 ( 2205 "This switches on knapsack cuts (either at root or in entire tree) \ 2201 2206 See branchAndCut for information on options." 2202 );2203 parameters[numberParameters++]=2204 CbcOrClpParam("lift!AndProjectCuts","Whether to use Lift and Project cuts",2205 "off",LANDPCUTS);2206 parameters[numberParameters1].append("on");2207 parameters[numberParameters1].append("root");2208 parameters[numberParameters1].append("ifmove");2209 parameters[numberParameters1].append("forceOn");2210 parameters[numberParameters1].setLonghelp2211 ( 2212 "Lift and project cuts  may be expensive to compute. \2207 ); 2208 parameters[numberParameters++] = 2209 CbcOrClpParam("lift!AndProjectCuts", "Whether to use Lift and Project cuts", 2210 "off", CBC_PARAM_STR_LANDPCUTS); 2211 parameters[numberParameters1].append("on"); 2212 parameters[numberParameters1].append("root"); 2213 parameters[numberParameters1].append("ifmove"); 2214 parameters[numberParameters1].append("forceOn"); 2215 parameters[numberParameters1].setLonghelp 2216 ( 2217 "Lift and project cuts  may be expensive to compute. \ 2213 2218 See branchAndCut for information on options." 2214 );2215 parameters[numberParameters++]=2216 CbcOrClpParam("local!TreeSearch","Whether to use local treesearch",2217 "off",LOCALTREE);2218 parameters[numberParameters1].append("on");2219 parameters[numberParameters1].setLonghelp2220 ( 2221 "This switches on a local search algorithm when a solution is found. This is from \2219 ); 2220 parameters[numberParameters++] = 2221 CbcOrClpParam("local!TreeSearch", "Whether to use local treesearch", 2222 "off", CBC_PARAM_STR_LOCALTREE); 2223 parameters[numberParameters1].append("on"); 2224 parameters[numberParameters1].setLonghelp 2225 ( 2226 "This switches on a local search algorithm when a solution is found. This is from \ 2222 2227 Fischetti and Lodi and is not really a heuristic although it can be used as one. \ 2223 2228 When used from Coin solve it has limited functionality. It is not switched on when \ 2224 2229 heuristics are switched on." 2225 );2230 ); 2226 2231 #endif 2227 2232 #ifndef COIN_HAS_CBC 2228 parameters[numberParameters++]=2229 CbcOrClpParam("log!Level","Level of detail in Solver output",2230 1,63,SOLVERLOGLEVEL);2233 parameters[numberParameters++] = 2234 CbcOrClpParam("log!Level", "Level of detail in Solver output", 2235 1, 63, CLP_PARAM_INT_SOLVERLOGLEVEL); 2231 2236 #else 2232 parameters[numberParameters++]=2233 CbcOrClpParam("log!Level","Level of detail in Coin branch and Cut output",2234 63,63,LOGLEVEL);2235 parameters[numberParameters1].setIntValue(1);2236 #endif 2237 parameters[numberParameters1].setLonghelp2238 ( 2239 "If 0 then there should be no output in normal circumstances. 1 is probably the best\2237 parameters[numberParameters++] = 2238 CbcOrClpParam("log!Level", "Level of detail in Coin branch and Cut output", 2239 63, 63, CLP_PARAM_INT_LOGLEVEL); 2240 parameters[numberParameters1].setIntValue(1); 2241 #endif 2242 parameters[numberParameters1].setLonghelp 2243 ( 2244 "If 0 then there should be no output in normal circumstances. 1 is probably the best\ 2240 2245 value for most uses, while 2 and 3 give more information." 2241 );2242 parameters[numberParameters++]=2243 CbcOrClpParam("max!imize","Set optimization direction to maximize",2244 MAXIMIZE,7);2245 parameters[numberParameters1].setLonghelp2246 ( 2247 "The default is minimize  use 'maximize' for maximization.\n\2246 ); 2247 parameters[numberParameters++] = 2248 CbcOrClpParam("max!imize", "Set optimization direction to maximize", 2249 CLP_PARAM_ACTION_MAXIMIZE, 7); 2250 parameters[numberParameters1].setLonghelp 2251 ( 2252 "The default is minimize  use 'maximize' for maximization.\n\ 2248 2253 You can also use the parameters 'direction maximize'." 2249 );2254 ); 2250 2255 #ifdef COIN_HAS_CLP 2251 parameters[numberParameters++]=2252 CbcOrClpParam("maxF!actor","Maximum number of iterations between \2256 parameters[numberParameters++] = 2257 CbcOrClpParam("maxF!actor", "Maximum number of iterations between \ 2253 2258 refactorizations", 2254 1,999999,MAXFACTOR);2255 parameters[numberParameters1].setLonghelp2256 ( 2257 "If this is at its initial value of 200 then in this executable clp will guess at a\2259 1, 999999, CLP_PARAM_INT_MAXFACTOR); 2260 parameters[numberParameters1].setLonghelp 2261 ( 2262 "If this is at its initial value of 200 then in this executable clp will guess at a\ 2258 2263 value to use. Otherwise the user can set a value. The code may decide to refactorize\ 2259 2264 earlier for accuracy." 2260 );2261 parameters[numberParameters++]=2262 CbcOrClpParam("maxIt!erations","Maximum number of iterations before \2265 ); 2266 parameters[numberParameters++] = 2267 CbcOrClpParam("maxIt!erations", "Maximum number of iterations before \ 2263 2268 stopping", 2264 0,2147483647,MAXITERATION);2265 parameters[numberParameters1].setLonghelp2266 ( 2267 "This can be used for testing purposes. The corresponding library call\n\2269 0, 2147483647, CLP_PARAM_INT_MAXITERATION); 2270 parameters[numberParameters1].setLonghelp 2271 ( 2272 "This can be used for testing purposes. The corresponding library call\n\ 2268 2273 \tsetMaximumIterations(value)\n can be useful. If the code stops on\ 2269 2274 seconds or by an interrupt this will be treated as stopping on maximum iterations. This is ignored in branchAndCut  use maxN!odes." 2270 );2271 #endif 2272 #ifdef COIN_HAS_CBC 2273 parameters[numberParameters++]=2274 CbcOrClpParam("maxN!odes","Maximum number of nodes to do",2275 1,2147483647,MAXNODES);2276 parameters[numberParameters1].setLonghelp2277 ( 2278 "This is a repeatable way to limit search. Normally using time is easier \2275 ); 2276 #endif 2277 #ifdef COIN_HAS_CBC 2278 parameters[numberParameters++] = 2279 CbcOrClpParam("maxN!odes", "Maximum number of nodes to do", 2280 1, 2147483647, CBC_PARAM_INT_MAXNODES); 2281 parameters[numberParameters1].setLonghelp 2282 ( 2283 "This is a repeatable way to limit search. Normally using time is easier \ 2279 2284 but then the results may not be repeatable." 2280 );2281 parameters[numberParameters++]=2282 CbcOrClpParam("maxS!olutions","Maximum number of solutions to get",2283 1,2147483647,MAXSOLS);2284 parameters[numberParameters1].setLonghelp2285 ( 2286 "You may want to stop after (say) two solutions or an hour. \2287 This is checked every node in tree, so it is possible to get more solutions from heuristics." 2288 );2289 #endif 2290 parameters[numberParameters++]=2291 CbcOrClpParam("min!imize","Set optimization direction to minimize",2292 MINIMIZE,7);2293 parameters[numberParameters1].setLonghelp2294 ( 2295 "The default is minimize  use 'maximize' for maximization.\n\2285 ); 2286 parameters[numberParameters++] = 2287 CbcOrClpParam("maxS!olutions", "Maximum number of solutions to get", 2288 1, 2147483647, CBC_PARAM_INT_MAXSOLS); 2289 parameters[numberParameters1].setLonghelp 2290 ( 2291 "You may want to stop after (say) two solutions or an hour. \ 2292 This is checked every node in tree, so it is possible to get more solutions from heuristics." 2293 ); 2294 #endif 2295 parameters[numberParameters++] = 2296 CbcOrClpParam("min!imize", "Set optimization direction to minimize", 2297 CLP_PARAM_ACTION_MINIMIZE, 7); 2298 parameters[numberParameters1].setLonghelp 2299 ( 2300 "The default is minimize  use 'maximize' for maximization.\n\ 2296 2301 This should only be necessary if you have previously set maximization \ 2297 2302 You can also use the parameters 'direction minimize'." 2298 2299 #ifdef COIN_HAS_CBC 2300 parameters[numberParameters++]=2301 CbcOrClpParam("mipO!ptions","Dubious options for mip",2302 0,COIN_INT_MAX,MIPOPTIONS,0);2303 parameters[numberParameters++]=2304 CbcOrClpParam("more!MipOptions","More dubious options for mip",2305 1,COIN_INT_MAX,MOREMIPOPTIONS,0);2306 parameters[numberParameters++]=2307 CbcOrClpParam("mixed!IntegerRoundingCuts","Whether to use Mixed Integer Rounding cuts",2308 "off",MIXEDCUTS);2309 parameters[numberParameters1].append("on");2310 parameters[numberParameters1].append("root");2311 parameters[numberParameters1].append("ifmove");2312 parameters[numberParameters1].append("forceOn");2313 parameters[numberParameters1].append("onglobal");2314 parameters[numberParameters1].setLonghelp2315 ( 2316 "This switches on mixed integer rounding cuts (either at root or in entire tree) \2303 ); 2304 #ifdef COIN_HAS_CBC 2305 parameters[numberParameters++] = 2306 CbcOrClpParam("mipO!ptions", "Dubious options for mip", 2307 0, COIN_INT_MAX, CBC_PARAM_INT_MIPOPTIONS, 0); 2308 parameters[numberParameters++] = 2309 CbcOrClpParam("more!MipOptions", "More dubious options for mip", 2310 1, COIN_INT_MAX, CBC_PARAM_INT_MOREMIPOPTIONS, 0); 2311 parameters[numberParameters++] = 2312 CbcOrClpParam("mixed!IntegerRoundingCuts", "Whether to use Mixed Integer Rounding cuts", 2313 "off", CBC_PARAM_STR_MIXEDCUTS); 2314 parameters[numberParameters1].append("on"); 2315 parameters[numberParameters1].append("root"); 2316 parameters[numberParameters1].append("ifmove"); 2317 parameters[numberParameters1].append("forceOn"); 2318 parameters[numberParameters1].append("onglobal"); 2319 parameters[numberParameters1].setLonghelp 2320 ( 2321 "This switches on mixed integer rounding cuts (either at root or in entire tree) \ 2317 2322 See branchAndCut for information on options." 2318 );2319 #endif 2320 parameters[numberParameters++]=2321 CbcOrClpParam("mess!ages","Controls if Clpnnnn is printed",2322 "off",MESSAGES);2323 parameters[numberParameters1].append("on");2324 parameters[numberParameters1].setLonghelp2323 ); 2324 #endif 2325 parameters[numberParameters++] = 2326 CbcOrClpParam("mess!ages", "Controls if Clpnnnn is printed", 2327 "off", CLP_PARAM_STR_MESSAGES); 2328 parameters[numberParameters1].append("on"); 2329 parameters[numberParameters1].setLonghelp 2325 2330 ("The default behavior is to put out messages such as:\n\ 2326 2331 Clp0005 2261 Objective 109.024 Primal infeas 944413 (758)\n\ … … 2328 2333 to turn them back on if you want to be able to 'grep' for particular messages or if\ 2329 2334 you intend to override the behavior of a particular message. This only affects Clp not Cbc." 2330 2331 #ifdef COIN_HAS_CBC 2332 parameters[numberParameters++]=2333 CbcOrClpParam("moreT!une","Yet more dubious ideas for feasibility pump",2334 0,100000000,FPUMPTUNE2,0);2335 parameters[numberParameters1].setLonghelp2336 ( 2337 "Yet more ideas for Feasibility Pump \n\2335 ); 2336 #ifdef COIN_HAS_CBC 2337 parameters[numberParameters++] = 2338 CbcOrClpParam("moreT!une", "Yet more dubious ideas for feasibility pump", 2339 0, 100000000, CBC_PARAM_INT_FPUMPTUNE2, 0); 2340 parameters[numberParameters1].setLonghelp 2341 ( 2342 "Yet more ideas for Feasibility Pump \n\ 2338 2343 \t/100000 == 1 use box constraints and original obj in cleanup\n\ 2339 2344 \t/1000 == 1 Pump will run twice if no solution found\n\ … … 2343 2348 \t/100 == 2,3.. allow more iterations per pass\n\ 2344 2349 \t n fix if value of variable same for last n iterations." 2345 );2346 parameters[numberParameters1].setIntValue(0);2347 parameters[numberParameters++]=2348 CbcOrClpParam("miplib","Do some of miplib test set",2349 MIPLIB,3,1);2350 parameters[numberParameters++]=2351 CbcOrClpParam("naive!Heuristics","Whether to try some stupid heuristic",2352 "off",NAIVE,7,1);2353 parameters[numberParameters1].append("on");2354 parameters[numberParameters1].append("both");2355 parameters[numberParameters1].append("before");2356 parameters[numberParameters1].setLonghelp2357 ( 2358 "Really silly stuff e.g. fix all integers with costs to zero!. \2359 Doh option does heuristic before preprocessing" ); 2360 #endif 2350 ); 2351 parameters[numberParameters1].setIntValue(0); 2352 parameters[numberParameters++] = 2353 CbcOrClpParam("miplib", "Do some of miplib test set", 2354 CBC_PARAM_ACTION_MIPLIB, 3, 1); 2355 parameters[numberParameters++] = 2356 CbcOrClpParam("naive!Heuristics", "Whether to try some stupid heuristic", 2357 "off", CBC_PARAM_STR_NAIVE, 7, 1); 2358 parameters[numberParameters1].append("on"); 2359 parameters[numberParameters1].append("both"); 2360 parameters[numberParameters1].append("before"); 2361 parameters[numberParameters1].setLonghelp 2362 ( 2363 "Really silly stuff e.g. fix all integers with costs to zero!. \ 2364 Doh option does heuristic before preprocessing" ); 2365 #endif 2361 2366 #ifdef COIN_HAS_CLP 2362 parameters[numberParameters++]=2363 CbcOrClpParam("netlib","Solve entire netlib test set",2364 NETLIB_EITHER,3,1);2365 parameters[numberParameters1].setLonghelp2366 ( 2367 "This exercises the unit test for clp and then solves the netlib test set using dual or primal.\2367 parameters[numberParameters++] = 2368 CbcOrClpParam("netlib", "Solve entire netlib test set", 2369 CLP_PARAM_ACTION_NETLIB_EITHER, 3, 1); 2370 parameters[numberParameters1].setLonghelp 2371 ( 2372 "This exercises the unit test for clp and then solves the netlib test set using dual or primal.\ 2368 2373 The user can set options before e.g. clp presolve off netlib" 2369 );2370 parameters[numberParameters++]=2371 CbcOrClpParam("netlibB!arrier","Solve entire netlib test set with barrier",2372 NETLIB_BARRIER,3,1);2373 parameters[numberParameters1].setLonghelp2374 ( 2375 "This exercises the unit test for clp and then solves the netlib test set using barrier.\2374 ); 2375 parameters[numberParameters++] = 2376 CbcOrClpParam("netlibB!arrier", "Solve entire netlib test set with barrier", 2377 CLP_PARAM_ACTION_NETLIB_BARRIER, 3, 1); 2378 parameters[numberParameters1].setLonghelp 2379 ( 2380 "This exercises the unit test for clp and then solves the netlib test set using barrier.\ 2376 2381 The user can set options before e.g. clp kkt on netlib" 2377 );2378 parameters[numberParameters++]=2379 CbcOrClpParam("netlibD!ual","Solve entire netlib test set (dual)",2380 NETLIB_DUAL,3,1);2381 parameters[numberParameters1].setLonghelp2382 ( 2383 "This exercises the unit test for clp and then solves the netlib test set using dual.\2382 ); 2383 parameters[numberParameters++] = 2384 CbcOrClpParam("netlibD!ual", "Solve entire netlib test set (dual)", 2385 CLP_PARAM_ACTION_NETLIB_DUAL, 3, 1); 2386 parameters[numberParameters1].setLonghelp 2387 ( 2388 "This exercises the unit test for clp and then solves the netlib test set using dual.\ 2384 2389 The user can set options before e.g. clp presolve off netlib" 2385 );2386 parameters[numberParameters++]=2387 CbcOrClpParam("netlibP!rimal","Solve entire netlib test set (primal)",2388 NETLIB_PRIMAL,3,1);2389 parameters[numberParameters1].setLonghelp2390 ( 2391 "This exercises the unit test for clp and then solves the netlib test set using primal.\2390 ); 2391 parameters[numberParameters++] = 2392 CbcOrClpParam("netlibP!rimal", "Solve entire netlib test set (primal)", 2393 CLP_PARAM_ACTION_NETLIB_PRIMAL, 3, 1); 2394 parameters[numberParameters1].setLonghelp 2395 ( 2396 "This exercises the unit test for clp and then solves the netlib test set using primal.\ 2392 2397 The user can set options before e.g. clp presolve off netlibp" 2393 );2394 parameters[numberParameters++]=2395 CbcOrClpParam("netlibT!une","Solve entire netlib test set with 'best' algorithm",2396 NETLIB_TUNE,3,1);2397 parameters[numberParameters1].setLonghelp2398 ( 2399 "This exercises the unit test for clp and then solves the netlib test set using whatever \2398 ); 2399 parameters[numberParameters++] = 2400 CbcOrClpParam("netlibT!une", "Solve entire netlib test set with 'best' algorithm", 2401 CLP_PARAM_ACTION_NETLIB_TUNE, 3, 1); 2402 parameters[numberParameters1].setLonghelp 2403 ( 2404 "This exercises the unit test for clp and then solves the netlib test set using whatever \ 2400 2405 works best. I know this is cheating but it also stresses the code better by doing a \ 2401 2406 mixture of stuff. The best algorithm was chosen on a Linux ThinkPad using native cholesky \ 2402 2407 with University of Florida ordering." 2403 );2404 parameters[numberParameters++]=2405 CbcOrClpParam("network","Tries to make network matrix",2406 NETWORK,7,0);2407 parameters[numberParameters1].setLonghelp2408 ( 2409 "Clp will go faster if the matrix can be converted to a network. The matrix\2408 ); 2409 parameters[numberParameters++] = 2410 CbcOrClpParam("network", "Tries to make network matrix", 2411 CLP_PARAM_ACTION_NETWORK, 7, 0); 2412 parameters[numberParameters1].setLonghelp 2413 ( 2414 "Clp will go faster if the matrix can be converted to a network. The matrix\ 2410 2415 operations may be a bit faster with more efficient storage, but the main advantage\ 2411 2416 comes from using a network factorization. It will probably not be as fast as a \ 2412 2417 specialized network code." 2413 );2414 #ifdef COIN_HAS_CBC 2415 parameters[numberParameters++]=2416 CbcOrClpParam("node!Strategy","What strategy to use to select nodes",2417 "hybrid",NODESTRATEGY);2418 parameters[numberParameters1].append("fewest");2419 parameters[numberParameters1].append("depth");2420 parameters[numberParameters1].append("upfewest");2421 parameters[numberParameters1].append("downfewest");2422 parameters[numberParameters1].append("updepth");2423 parameters[numberParameters1].append("downdepth");2424 parameters[numberParameters1].setLonghelp2425 ( 2426 "Normally before a solution the code will choose node with fewest infeasibilities. \2418 ); 2419 #ifdef COIN_HAS_CBC 2420 parameters[numberParameters++] = 2421 CbcOrClpParam("node!Strategy", "What strategy to use to select nodes", 2422 "hybrid", CBC_PARAM_STR_NODESTRATEGY); 2423 parameters[numberParameters1].append("fewest"); 2424 parameters[numberParameters1].append("depth"); 2425 parameters[numberParameters1].append("upfewest"); 2426 parameters[numberParameters1].append("downfewest"); 2427 parameters[numberParameters1].append("updepth"); 2428 parameters[numberParameters1].append("downdepth"); 2429 parameters[numberParameters1].setLonghelp 2430 ( 2431 "Normally before a solution the code will choose node with fewest infeasibilities. \ 2427 2432 You can choose depth as the criterion. You can also say if up or down branch must \ 2428 2433 be done first (the up down choice will carry on after solution). \ 2429 2434 Default has now been changed to hybrid which is breadth first on small depth nodes then fewest." 2430 );2431 parameters[numberParameters++]=2432 CbcOrClpParam("numberA!nalyze","Number of analysis iterations",2433 COIN_INT_MAX,COIN_INT_MAX,NUMBERANALYZE,0);2434 parameters[numberParameters1].setLonghelp2435 ( 2436 "This says how many iterations to spend at root node analyzing problem. \2435 ); 2436 parameters[numberParameters++] = 2437 CbcOrClpParam("numberA!nalyze", "Number of analysis iterations", 2438 COIN_INT_MAX, COIN_INT_MAX, CBC_PARAM_INT_NUMBERANALYZE, 0); 2439 parameters[numberParameters1].setLonghelp 2440 ( 2441 "This says how many iterations to spend at root node analyzing problem. \ 2437 2442 This is a first try and will hopefully become more sophisticated." 2438 );2439 #endif 2440 parameters[numberParameters++]=2441 CbcOrClpParam("objective!Scale","Scale factor to apply to objective",2442 1.0e20,1.0e20,OBJSCALE,1);2443 parameters[numberParameters1].setLonghelp2444 ( 2445 "If the objective function has some very large values, you may wish to scale them\2443 ); 2444 #endif 2445 parameters[numberParameters++] = 2446 CbcOrClpParam("objective!Scale", "Scale factor to apply to objective", 2447 1.0e20, 1.0e20, CLP_PARAM_DBL_OBJSCALE, 1); 2448 parameters[numberParameters1].setLonghelp 2449 ( 2450 "If the objective function has some very large values, you may wish to scale them\ 2446 2451 internally by this amount. It can also be set by autoscale. It is applied after scaling. You are unlikely to need this." 2447 );2448 parameters[numberParameters1].setDoubleValue(1.0);2449 #endif 2450 #ifdef COIN_HAS_CBC 2451 parameters[numberParameters++]=2452 CbcOrClpParam("outDup!licates","takes duplicate rows etc out of integer model",2453 OUTDUPROWS,7,0);2454 #endif 2455 parameters[numberParameters++]=2456 CbcOrClpParam("output!Format","Which output format to use",2457 1,6,OUTPUTFORMAT);2458 parameters[numberParameters1].setLonghelp2459 ( 2460 "Normally export will be done using normal representation for numbers and two values\2452 ); 2453 parameters[numberParameters1].setDoubleValue(1.0); 2454 #endif 2455 #ifdef COIN_HAS_CBC 2456 parameters[numberParameters++] = 2457 CbcOrClpParam("outDup!licates", "takes duplicate rows etc out of integer model", 2458 CLP_PARAM_ACTION_OUTDUPROWS, 7, 0); 2459 #endif 2460 parameters[numberParameters++] = 2461 CbcOrClpParam("output!Format", "Which output format to use", 2462 1, 6, CLP_PARAM_INT_OUTPUTFORMAT); 2463 parameters[numberParameters1].setLonghelp 2464 ( 2465 "Normally export will be done using normal representation for numbers and two values\ 2461 2466 per line. You may want to do just one per line (for grep or suchlike) and you may wish\ 2462 2467 to save with absolute accuracy using a coded version of the IEEE value. A value of 2 is normal.\ … … 2464 2469 gives greater precision, while 5,6 give IEEE values. When used for exporting a basis 1 does not save \ 2465 2470 values, 2 saves values, 3 with greater accuracy and 4 in IEEE." 2466 2467 #ifdef COIN_HAS_CBC 2468 parameters[numberParameters++]=2469 CbcOrClpParam("passC!uts","Number of cut passes at root node",2470 9999999,9999999,CUTPASS);2471 parameters[numberParameters1].setLonghelp2472 ( 2473 "The default is 100 passes if less than 500 columns, 100 passes (but \2471 ); 2472 #ifdef COIN_HAS_CBC 2473 parameters[numberParameters++] = 2474 CbcOrClpParam("passC!uts", "Number of cut passes at root node", 2475 9999999, 9999999, CBC_PARAM_INT_CUTPASS); 2476 parameters[numberParameters1].setLonghelp 2477 ( 2478 "The default is 100 passes if less than 500 columns, 100 passes (but \ 2474 2479 stop if drop small if less than 5000 columns, 20 otherwise" 2475 );2476 parameters[numberParameters++]=2477 CbcOrClpParam("passF!easibilityPump","How many passes in feasibility pump",2478 0,10000,FPUMPITS);2479 parameters[numberParameters1].setLonghelp2480 ( 2481 "This fine tunes Feasibility Pump by doing more or fewer passes."2482 );2483 parameters[numberParameters1].setIntValue(20);2484 #endif 2480 ); 2481 parameters[numberParameters++] = 2482 CbcOrClpParam("passF!easibilityPump", "How many passes in feasibility pump", 2483 0, 10000, CBC_PARAM_INT_FPUMPITS); 2484 parameters[numberParameters1].setLonghelp 2485 ( 2486 "This fine tunes Feasibility Pump by doing more or fewer passes." 2487 ); 2488 parameters[numberParameters1].setIntValue(20); 2489 #endif 2485 2490 #ifdef COIN_HAS_CLP 2486 parameters[numberParameters++]=2487 CbcOrClpParam("passP!resolve","How many passes in presolve",2488 200,100,PRESOLVEPASS,1);2489 parameters[numberParameters1].setLonghelp2490 ( 2491 "Normally Presolve does 5 passes but you may want to do less to make it\2491 parameters[numberParameters++] = 2492 CbcOrClpParam("passP!resolve", "How many passes in presolve", 2493 200, 100, CLP_PARAM_INT_PRESOLVEPASS, 1); 2494 parameters[numberParameters1].setLonghelp 2495 ( 2496 "Normally Presolve does 5 passes but you may want to do less to make it\ 2492 2497 more lightweight or do more if improvements are still being made. As Presolve will return\ 2493 2498 if nothing is being taken out, you should not normally need to use this fine tuning." 2494 2495 #endif 2496 #ifdef COIN_HAS_CBC 2497 parameters[numberParameters++]=2498 CbcOrClpParam("passT!reeCuts","Number of cut passes in tree",2499 9999999,9999999,CUTPASSINTREE);2500 parameters[numberParameters1].setLonghelp2501 ( 2502 "The default is one pass"2503 );2504 #endif 2499 ); 2500 #endif 2501 #ifdef COIN_HAS_CBC 2502 parameters[numberParameters++] = 2503 CbcOrClpParam("passT!reeCuts", "Number of cut passes in tree", 2504 9999999, 9999999, CBC_PARAM_INT_CUTPASSINTREE); 2505 parameters[numberParameters1].setLonghelp 2506 ( 2507 "The default is one pass" 2508 ); 2509 #endif 2505 2510 #ifdef COIN_HAS_CLP 2506 parameters[numberParameters++]=2507 CbcOrClpParam("pertV!alue","Method of perturbation",2508 5000,102,PERTVALUE,1);2509 parameters[numberParameters++]=2510 CbcOrClpParam("perturb!ation","Whether to perturb problem",2511 "on",PERTURBATION);2512 parameters[numberParameters1].append("off");2513 parameters[numberParameters1].setLonghelp2514 ( 2515 "Perturbation helps to stop cycling, but Clp uses other measures for this.\2511 parameters[numberParameters++] = 2512 CbcOrClpParam("pertV!alue", "Method of perturbation", 2513 5000, 102, CLP_PARAM_INT_PERTVALUE, 1); 2514 parameters[numberParameters++] = 2515 CbcOrClpParam("perturb!ation", "Whether to perturb problem", 2516 "on", CLP_PARAM_STR_PERTURBATION); 2517 parameters[numberParameters1].append("off"); 2518 parameters[numberParameters1].setLonghelp 2519 ( 2520 "Perturbation helps to stop cycling, but Clp uses other measures for this.\ 2516 2521 However large problems and especially ones with unit elements and unit rhs or costs\ 2517 2522 benefit from perturbation. Normally Clp tries to be intelligent, but you can switch this off.\ 2518 2523 The Clp library has this off by default. This program has it on by default." 2519 );2520 parameters[numberParameters++]=2521 CbcOrClpParam("PFI","Whether to use Product Form of Inverse in simplex",2522 "off",PFI,7,0);2523 parameters[numberParameters1].append("on");2524 parameters[numberParameters1].setLonghelp2525 ( 2526 "By default clp uses ForrestTomlin LU update. If you are masochistic you can switch it off."2527 );2528 #endif 2529 #ifdef COIN_HAS_CBC 2530 parameters[numberParameters++]=2531 CbcOrClpParam("pivotAndC!omplement","Whether to try Pivot and Complement heuristic",2532 "off",PIVOTANDCOMPLEMENT);2533 parameters[numberParameters1].append("on");2534 parameters[numberParameters1].append("both");2535 parameters[numberParameters1].append("before");2536 parameters[numberParameters1].setLonghelp2537 ( 2538 "stuff needed. \2539 Doh option does heuristic before preprocessing" ); 2540 parameters[numberParameters++]=2541 CbcOrClpParam("pivotAndF!ix","Whether to try Pivot and Fix heuristic",2542 "off",PIVOTANDFIX);2543 parameters[numberParameters1].append("on");2544 parameters[numberParameters1].append("both");2545 parameters[numberParameters1].append("before");2546 parameters[numberParameters1].setLonghelp2547 ( 2548 "stuff needed. \2549 Doh option does heuristic before preprocessing" ); 2550 #endif 2524 ); 2525 parameters[numberParameters++] = 2526 CbcOrClpParam("PFI", "Whether to use Product Form of Inverse in simplex", 2527 "off", CLP_PARAM_STR_PFI, 7, 0); 2528 parameters[numberParameters1].append("on"); 2529 parameters[numberParameters1].setLonghelp 2530 ( 2531 "By default clp uses ForrestTomlin LU update. If you are masochistic you can switch it off." 2532 ); 2533 #endif 2534 #ifdef COIN_HAS_CBC 2535 parameters[numberParameters++] = 2536 CbcOrClpParam("pivotAndC!omplement", "Whether to try Pivot and Complement heuristic", 2537 "off", CBC_PARAM_STR_PIVOTANDCOMPLEMENT); 2538 parameters[numberParameters1].append("on"); 2539 parameters[numberParameters1].append("both"); 2540 parameters[numberParameters1].append("before"); 2541 parameters[numberParameters1].setLonghelp 2542 ( 2543 "stuff needed. \ 2544 Doh option does heuristic before preprocessing" ); 2545 parameters[numberParameters++] = 2546 CbcOrClpParam("pivotAndF!ix", "Whether to try Pivot and Fix heuristic", 2547 "off", CBC_PARAM_STR_PIVOTANDFIX); 2548 parameters[numberParameters1].append("on"); 2549 parameters[numberParameters1].append("both"); 2550 parameters[numberParameters1].append("before"); 2551 parameters[numberParameters1].setLonghelp 2552 ( 2553 "stuff needed. \ 2554 Doh option does heuristic before preprocessing" ); 2555 #endif 2551 2556 #ifdef COIN_HAS_CLP 2552 parameters[numberParameters++]=2553 CbcOrClpParam("plus!Minus","Tries to make + 1 matrix",2554 PLUSMINUS,7,0);2555 parameters[numberParameters1].setLonghelp2556 ( 2557 "Clp will go slightly faster if the matrix can be converted so that the elements are\2557 parameters[numberParameters++] = 2558 CbcOrClpParam("plus!Minus", "Tries to make + 1 matrix", 2559 CLP_PARAM_ACTION_PLUSMINUS, 7, 0); 2560 parameters[numberParameters1].setLonghelp 2561 ( 2562 "Clp will go slightly faster if the matrix can be converted so that the elements are\ 2558 2563 not stored and are known to be unit. The main advantage is memory use. Clp may automatically\ 2559 2564 see if it can convert the problem so you should not need to use this." 2560 );2561 parameters[numberParameters++]=2562 CbcOrClpParam("pO!ptions","Dubious print options",2563 0,COIN_INT_MAX,PRINTOPTIONS,1);2564 parameters[numberParameters1].setIntValue(0);2565 parameters[numberParameters1].setLonghelp2566 ( 2567 "If this is > 0 then presolve will give more information and branch and cut will give statistics"2568 );2569 parameters[numberParameters++]=2570 CbcOrClpParam("preO!pt","Presolve options",2571 0,COIN_INT_MAX,PRESOLVEOPTIONS,0);2572 #endif 2573 parameters[numberParameters++]=2574 CbcOrClpParam("presolve","Whether to presolve problem",2575 "on",PRESOLVE);2576 parameters[numberParameters1].append("off");2577 parameters[numberParameters1].append("more");2578 parameters[numberParameters1].append("file");2579 parameters[numberParameters1].setLonghelp2580 ( 2581 "Presolve analyzes the model to find such things as redundant equations, equations\2565 ); 2566 parameters[numberParameters++] = 2567 CbcOrClpParam("pO!ptions", "Dubious print options", 2568 0, COIN_INT_MAX, CLP_PARAM_INT_PRINTOPTIONS, 1); 2569 parameters[numberParameters1].setIntValue(0); 2570 parameters[numberParameters1].setLonghelp 2571 ( 2572 "If this is > 0 then presolve will give more information and branch and cut will give statistics" 2573 ); 2574 parameters[numberParameters++] = 2575 CbcOrClpParam("preO!pt", "Presolve options", 2576 0, COIN_INT_MAX, CLP_PARAM_INT_PRESOLVEOPTIONS, 0); 2577 #endif 2578 parameters[numberParameters++] = 2579 CbcOrClpParam("presolve", "Whether to presolve problem", 2580 "on", CLP_PARAM_STR_PRESOLVE); 2581 parameters[numberParameters1].append("off"); 2582 parameters[numberParameters1].append("more"); 2583 parameters[numberParameters1].append("file"); 2584 parameters[numberParameters1].setLonghelp 2585 ( 2586 "Presolve analyzes the model to find such things as redundant equations, equations\ 2582 2587 which fix some variables, equations which can be transformed into bounds etc etc. For the\ 2583 2588 initial solve of any problem this is worth doing unless you know that it will have no effect. \ 2584 2589 on will normally do 5 passes while using 'more' will do 10. If the problem is very large you may need \ 2585 2590 to write the original to file using 'file'." 2586 );2587 #ifdef COIN_HAS_CBC 2588 parameters[numberParameters++]=2589 CbcOrClpParam("preprocess","Whether to use integer preprocessing",2590 "off",PREPROCESS);2591 parameters[numberParameters1].append("on");2592 parameters[numberParameters1].append("save");2593 parameters[numberParameters1].append("equal");2594 parameters[numberParameters1].append("sos");2595 parameters[numberParameters1].append("trysos");2596 parameters[numberParameters1].append("equalall");2597 parameters[numberParameters1].append("strategy");2598 parameters[numberParameters1].append("aggregate");2599 parameters[numberParameters1].append("forcesos");2600 parameters[numberParameters1].setLonghelp2601 ( 2602 "This tries to reduce size of model in a similar way to presolve and \2591 ); 2592 #ifdef COIN_HAS_CBC 2593 parameters[numberParameters++] = 2594 CbcOrClpParam("preprocess", "Whether to use integer preprocessing", 2595 "off", CBC_PARAM_STR_PREPROCESS); 2596 parameters[numberParameters1].append("on"); 2597 parameters[numberParameters1].append("save"); 2598 parameters[numberParameters1].append("equal"); 2599 parameters[numberParameters1].append("sos"); 2600 parameters[numberParameters1].append("trysos"); 2601 parameters[numberParameters1].append("equalall"); 2602 parameters[numberParameters1].append("strategy"); 2603 parameters[numberParameters1].append("aggregate"); 2604 parameters[numberParameters1].append("forcesos"); 2605 parameters[numberParameters1].setLonghelp 2606 ( 2607 "This tries to reduce size of model in a similar way to presolve and \ 2603 2608 it also tries to strengthen the model  this can be very useful and is worth trying. \ 2604 2609 Save option saves on file presolved.mps. equal will turn <= cliques into \ … … 2607 2612 valid inequalities into equalities with integer slacks. strategy is as \ 2608 2613 on but uses CbcStrategy." 2609 );2614 ); 2610 2615 #endif 2611 2616 #ifdef COIN_HAS_CLP 2612 parameters[numberParameters++]=2613 CbcOrClpParam("preT!olerance","Tolerance to use in presolve",2614 1.0e20,1.0e12,PRESOLVETOLERANCE);2615 parameters[numberParameters1].setLonghelp2616 ( 2617 "The default is 1.0e8  you may wish to try 1.0e7 if presolve says the problem is \2617 parameters[numberParameters++] = 2618 CbcOrClpParam("preT!olerance", "Tolerance to use in presolve", 2619 1.0e20, 1.0e12, CLP_PARAM_DBL_PRESOLVETOLERANCE); 2620 parameters[numberParameters1].setLonghelp 2621 ( 2622 "The default is 1.0e8  you may wish to try 1.0e7 if presolve says the problem is \ 2618 2623 infeasible and you have awkward numbers and you are sure the problem is really feasible." 2619 );2620 parameters[numberParameters++]=2621 CbcOrClpParam("primalP!ivot","Primal pivot choice algorithm",2622 "auto!matic",PRIMALPIVOT,7,1);2623 parameters[numberParameters1].append("exa!ct");2624 parameters[numberParameters1].append("dant!zig");2625 parameters[numberParameters1].append("part!ial");2626 parameters[numberParameters1].append("steep!est");2627 parameters[numberParameters1].append("change");2628 parameters[numberParameters1].append("sprint");2629 parameters[numberParameters1].setLonghelp2630 ( 2631 "Clp can use any pivot selection algorithm which the user codes as long as it\2624 ); 2625 parameters[numberParameters++] = 2626 CbcOrClpParam("primalP!ivot", "Primal pivot choice algorithm", 2627 "auto!matic", CLP_PARAM_STR_PRIMALPIVOT, 7, 1); 2628 parameters[numberParameters1].append("exa!ct"); 2629 parameters[numberParameters1].append("dant!zig"); 2630 parameters[numberParameters1].append("part!ial"); 2631 parameters[numberParameters1].append("steep!est"); 2632 parameters[numberParameters1].append("change"); 2633 parameters[numberParameters1].append("sprint"); 2634 parameters[numberParameters1].setLonghelp 2635 ( 2636 "Clp can use any pivot selection algorithm which the user codes as long as it\ 2632 2637 implements the features in the abstract pivot base class. The Dantzig method is implemented\ 2633 2638 to show a simple method but its use is deprecated. Exact devex is the method of choice and there\ … … 2635 2640 Partial switches this on while change initially does dantzig until the factorization\ 2636 2641 becomes denser. This is still a work in progress." 2637 );2638 parameters[numberParameters++]=2639 CbcOrClpParam("primalS!implex","Do primal simplex algorithm",2640 2641 parameters[numberParameters1].setLonghelp2642 ( 2643 "This command solves the current model using the primal algorithm.\2642 ); 2643 parameters[numberParameters++] = 2644 CbcOrClpParam("primalS!implex", "Do primal simplex algorithm", 2645 CLP_PARAM_ACTION_PRIMALSIMPLEX); 2646 parameters[numberParameters1].setLonghelp 2647 ( 2648 "This command solves the current model using the primal algorithm.\ 2644 2649 The default is to use exact devex.\ 2645 2650 The time and iterations may be affected by settings such as presolve, scaling, crash\ 2646 2651 and also by column selection method, infeasibility weight and dual and primal tolerances." 2647 2648 #endif 2649 parameters[numberParameters++]=2650 CbcOrClpParam("primalT!olerance","For an optimal solution \2652 ); 2653 #endif 2654 parameters[numberParameters++] = 2655 CbcOrClpParam("primalT!olerance", "For an optimal solution \ 2651 2656 no primal infeasibility may exceed this value", 2652 1.0e20,1.0e12,PRIMALTOLERANCE);2653 parameters[numberParameters1].setLonghelp2654 ( 2655 "Normally the default tolerance is fine, but you may want to increase it a\2657 1.0e20, 1.0e12, CLP_PARAM_DBL_PRIMALTOLERANCE); 2658 parameters[numberParameters1].setLonghelp 2659 ( 2660 "Normally the default tolerance is fine, but you may want to increase it a\ 2656 2661 bit if a primal run seems to be having a hard time" 2657 );2662 ); 2658 2663 #ifdef COIN_HAS_CLP 2659 parameters[numberParameters++]=2660 CbcOrClpParam("primalW!eight","Initially algorithm acts as if it \2664 parameters[numberParameters++] = 2665 CbcOrClpParam("primalW!eight", "Initially algorithm acts as if it \ 2661 2666 costs this much to be infeasible", 2662 1.0e20,1.0e20,PRIMALWEIGHT);2663 parameters[numberParameters1].setLonghelp2664 ( 2665 "The primal algorithm in Clp is a single phase algorithm as opposed to a two phase\2667 1.0e20, 1.0e20, CLP_PARAM_DBL_PRIMALWEIGHT); 2668 parameters[numberParameters1].setLonghelp 2669 ( 2670 "The primal algorithm in Clp is a single phase algorithm as opposed to a two phase\ 2666 2671 algorithm where you first get feasible then optimal. So Clp is minimizing this weight times\ 2667 2672 the sum of primal infeasibilities plus the true objective function (in minimization sense).\ … … 2670 2675 OSL had a heuristic to\ 2671 2676 adjust bounds, maybe we need that here." 2672 );2673 #endif 2674 parameters[numberParameters++]=2675 CbcOrClpParam("printi!ngOptions","Print options",2676 "normal",INTPRINT,3);2677 parameters[numberParameters1].append("integer");2678 parameters[numberParameters1].append("special");2679 parameters[numberParameters1].append("rows");2680 parameters[numberParameters1].append("all");2681 parameters[numberParameters1].append("csv");2682 parameters[numberParameters1].setLonghelp2683 ( 2684 "This changes the amount and format of printing a solution:\nnormal  nonzero column variables \n\2677 ); 2678 #endif 2679 parameters[numberParameters++] = 2680 CbcOrClpParam("printi!ngOptions", "Print options", 2681 "normal", CLP_PARAM_STR_INTPRINT, 3); 2682 parameters[numberParameters1].append("integer"); 2683 parameters[numberParameters1].append("special"); 2684 parameters[numberParameters1].append("rows"); 2685 parameters[numberParameters1].append("all"); 2686 parameters[numberParameters1].append("csv"); 2687 parameters[numberParameters1].setLonghelp 2688 ( 2689 "This changes the amount and format of printing a solution:\nnormal  nonzero column variables \n\ 2685 2690 integer  nonzero integer column variables\n\ 2686 2691 special  in format suitable for OsiRowCutDebugger\n\ … … 2689 2694 \nFor noninteger problems 'integer' and 'special' act like 'normal'. \ 2690 2695 Also see printMask for controlling output." 2691 );2692 parameters[numberParameters++]=2693 CbcOrClpParam("printM!ask","Control printing of solution on a mask",2694 PRINTMASK,3);2695 parameters[numberParameters1].setLonghelp2696 ( 2697 "If set then only those names which match mask are printed in a solution. \2696 ); 2697 parameters[numberParameters++] = 2698 CbcOrClpParam("printM!ask", "Control printing of solution on a mask", 2699 CLP_PARAM_ACTION_PRINTMASK, 3); 2700 parameters[numberParameters1].setLonghelp 2701 ( 2702 "If set then only those names which match mask are printed in a solution. \ 2698 2703 '?' matches any character and '*' matches any set of characters. \ 2699 2704 The default is '' i.e. unset so all variables are printed. \ 2700 2705 This is only active if model has names." 2701 );2702 #ifdef COIN_HAS_CBC 2703 parameters[numberParameters++]=2704 CbcOrClpParam("prio!rityIn","Import priorities etc from file",2705 PRIORITYIN,3);2706 parameters[numberParameters1].setLonghelp2707 ( 2708 "This will read a file with priorities from the given file name. It will use the default\2706 ); 2707 #ifdef COIN_HAS_CBC 2708 parameters[numberParameters++] = 2709 CbcOrClpParam("prio!rityIn", "Import priorities etc from file", 2710 CBC_PARAM_ACTION_PRIORITYIN, 3); 2711 parameters[numberParameters1].setLonghelp 2712 ( 2713 "This will read a file with priorities from the given file name. It will use the default\ 2709 2714 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 2710 2715 is initialized to '', i.e. it must be set. This can not read from compressed files. \ 2711 2716 File is in csv format with allowed headings  name, number, priority, direction, up, down, solution. Exactly one of\ 2712 2717 name and number must be given." 2713 );2714 parameters[numberParameters++]=2715 CbcOrClpParam("probing!Cuts","Whether to use Probing cuts",2716 "off",PROBINGCUTS);2717 parameters[numberParameters1].append("on");2718 parameters[numberParameters1].append("root");2719 parameters[numberParameters1].append("ifmove");2720 parameters[numberParameters1].append("forceOn");2721 parameters[numberParameters1].append("onglobal");2722 parameters[numberParameters1].append("forceonglobal");2723 parameters[numberParameters1].append("forceOnBut");2724 parameters[numberParameters1].append("forceOnStrong");2725 parameters[numberParameters1].append("forceOnButStrong");2726 parameters[numberParameters1].append("strongRoot");2727 parameters[numberParameters1].setLonghelp2728 ( 2729 "This switches on probing cuts (either at root or in entire tree) \2718 ); 2719 parameters[numberParameters++] = 2720 CbcOrClpParam("probing!Cuts", "Whether to use Probing cuts", 2721 "off", CBC_PARAM_STR_PROBINGCUTS); 2722 parameters[numberParameters1].append("on"); 2723 parameters[numberParameters1].append("root"); 2724 parameters[numberParameters1].append("ifmove"); 2725 parameters[numberParameters1].append("forceOn"); 2726 parameters[numberParameters1].append("onglobal"); 2727 parameters[numberParameters1].append("forceonglobal"); 2728 parameters[numberParameters1].append("forceOnBut"); 2729 parameters[numberParameters1].append("forceOnStrong"); 2730 parameters[numberParameters1].append("forceOnButStrong"); 2731 parameters[numberParameters1].append("strongRoot"); 2732 parameters[numberParameters1].setLonghelp 2733 ( 2734 "This switches on probing cuts (either at root or in entire tree) \ 2730 2735 See branchAndCut for information on options. \ 2731 2736 but strong options do more probing" 2732 );2733 parameters[numberParameters++]=2734 CbcOrClpParam("pumpC!utoff","Fake cutoff for use in feasibility pump",2735 COIN_DBL_MAX,COIN_DBL_MAX,FAKECUTOFF);2736 parameters[numberParameters1].setDoubleValue(0.0);2737 parameters[numberParameters1].setLonghelp2738 ( 2739 "0.0 off  otherwise add a constraint forcing objective below this value\2737 ); 2738 parameters[numberParameters++] = 2739 CbcOrClpParam("pumpC!utoff", "Fake cutoff for use in feasibility pump", 2740 COIN_DBL_MAX, COIN_DBL_MAX, CBC_PARAM_DBL_FAKECUTOFF); 2741 parameters[numberParameters1].setDoubleValue(0.0); 2742 parameters[numberParameters1].setLonghelp 2743 ( 2744 "0.0 off  otherwise add a constraint forcing objective below this value\ 2740 2745 in feasibility pump" 2741 );2742 parameters[numberParameters++]=2743 CbcOrClpParam("pumpI!ncrement","Fake increment for use in feasibility pump",2744 COIN_DBL_MAX,COIN_DBL_MAX,FAKEINCREMENT,1);2745 parameters[numberParameters1].setDoubleValue(0.0);2746 parameters[numberParameters1].setLonghelp2747 ( 2748 "0.0 off  otherwise use as absolute increment to cutoff \2746 ); 2747 parameters[numberParameters++] = 2748 CbcOrClpParam("pumpI!ncrement", "Fake increment for use in feasibility pump", 2749 COIN_DBL_MAX, COIN_DBL_MAX, CBC_PARAM_DBL_FAKEINCREMENT, 1); 2750 parameters[numberParameters1].setDoubleValue(0.0); 2751 parameters[numberParameters1].setLonghelp 2752 ( 2753 "0.0 off  otherwise use as absolute increment to cutoff \ 2749 2754 when solution found in feasibility pump" 2750 );2751 parameters[numberParameters++]=2752 CbcOrClpParam("pumpT!une","Dubious ideas for feasibility pump",2753 0,100000000,FPUMPTUNE);2754 parameters[numberParameters1].setLonghelp2755 ( 2756 "This fine tunes Feasibility Pump \n\2755 ); 2756 parameters[numberParameters++] = 2757 CbcOrClpParam("pumpT!une", "Dubious ideas for feasibility pump", 2758 0, 100000000, CBC_PARAM_INT_FPUMPTUNE); 2759 parameters[numberParameters1].setLonghelp 2760 ( 2761 "This fine tunes Feasibility Pump \n\ 2757 2762 \t>=10000000 use as objective weight switch\n\ 2758 2763 \t>=1000000 use as accumulate switch\n\ … … 2763 2768 If accumulate is on then after a major pass, variables which have not moved \ 2764 2769 are fixed and a small branch and bound is tried." 2765 );2766 parameters[numberParameters1].setIntValue(0);2767 #endif 2768 parameters[numberParameters++]=2769 CbcOrClpParam("quit","Stops clp execution",2770 2771 parameters[numberParameters1].setLonghelp2772 ( 2773 "This stops the execution of Clp, end, exit, quit and stop are synonyms"2774 );2775 #ifdef COIN_HAS_CBC 2776 parameters[numberParameters++]=2777 CbcOrClpParam("rand!omizedRounding","Whether to try randomized rounding heuristic",2778 "off",RANDROUND);2779 parameters[numberParameters1].append("on");2780 parameters[numberParameters1].append("both");2781 parameters[numberParameters1].append("before");2782 parameters[numberParameters1].setLonghelp2783 ( 2784 "stuff needed. \2785 Doh option does heuristic before preprocessing" ); 2786 parameters[numberParameters++]=2787 CbcOrClpParam("ratio!Gap","Stop when gap between best possible and \2770 ); 2771 parameters[numberParameters1].setIntValue(0); 2772 #endif 2773 parameters[numberParameters++] = 2774 CbcOrClpParam("quit", "Stops clp execution", 2775 CLP_PARAM_ACTION_EXIT); 2776 parameters[numberParameters1].setLonghelp 2777 ( 2778 "This stops the execution of Clp, end, exit, quit and stop are synonyms" 2779 ); 2780 #ifdef COIN_HAS_CBC 2781 parameters[numberParameters++] = 2782 CbcOrClpParam("rand!omizedRounding", "Whether to try randomized rounding heuristic", 2783 "off", CBC_PARAM_STR_RANDROUND); 2784 parameters[numberParameters1].append("on"); 2785 parameters[numberParameters1].append("both"); 2786 parameters[numberParameters1].append("before"); 2787 parameters[numberParameters1].setLonghelp 2788 ( 2789 "stuff needed. \ 2790 Doh option does heuristic before preprocessing" ); 2791 parameters[numberParameters++] = 2792 CbcOrClpParam("ratio!Gap", "Stop when gap between best possible and \ 2788 2793 best less than this fraction of larger of two", 2789 0.0,1.0e20,GAPRATIO);2790 parameters[numberParameters1].setDoubleValue(0.0);2791 parameters[numberParameters1].setLonghelp2792 ( 2793 "If the gap between best solution and best possible solution is less than this fraction \2794 0.0, 1.0e20, CBC_PARAM_DBL_GAPRATIO); 2795 parameters[numberParameters1].setDoubleValue(0.0); 2796 parameters[numberParameters1].setLonghelp 2797 ( 2798 "If the gap between best solution and best possible solution is less than this fraction \ 2794 2799 of the objective value at the root node then the search will terminate. See 'allowableGap' for a \ 2795 2800 way of using absolute value rather than fraction." 2796 );2797 parameters[numberParameters++]=2798 CbcOrClpParam("readS!tored","Import stored cuts from file",2799 STOREDFILE,3,0);2801 ); 2802 parameters[numberParameters++] = 2803 CbcOrClpParam("readS!tored", "Import stored cuts from file", 2804 CLP_PARAM_ACTION_STOREDFILE, 3, 0); 2800 2805 #endif 2801 2806 #ifdef COIN_HAS_CLP 2802 parameters[numberParameters++]=2803 CbcOrClpParam("reallyO!bjectiveScale","Scale factor to apply to objective in place",2804 1.0e20,1.0e20,OBJSCALE2,0);2805 parameters[numberParameters1].setLonghelp2806 ( 2807 "You can set this to 1.0 to test maximization or other to stress code"2808 );2809 parameters[numberParameters1].setDoubleValue(1.0);2810 parameters[numberParameters++]=2811 CbcOrClpParam("reallyS!cale","Scales model in place",2812 REALLY_SCALE,7,0);2813 #endif 2814 #ifdef COIN_HAS_CBC 2815 parameters[numberParameters++] =2816 CbcOrClpParam("reduce!AndSplitCuts","Whether to use ReduceandSplit cuts",2817 "off",REDSPLITCUTS);2807 parameters[numberParameters++] = 2808 CbcOrClpParam("reallyO!bjectiveScale", "Scale factor to apply to objective in place", 2809 1.0e20, 1.0e20, CLP_PARAM_DBL_OBJSCALE2, 0); 2810 parameters[numberParameters1].setLonghelp 2811 ( 2812 "You can set this to 1.0 to test maximization or other to stress code" 2813 ); 2814 parameters[numberParameters1].setDoubleValue(1.0); 2815 parameters[numberParameters++] = 2816 CbcOrClpParam("reallyS!cale", "Scales model in place", 2817 CLP_PARAM_ACTION_REALLY_SCALE, 7, 0); 2818 #endif 2819 #ifdef COIN_HAS_CBC 2820 parameters[numberParameters++] = 2821 CbcOrClpParam("reduce!AndSplitCuts", "Whether to use ReduceandSplit cuts", 2822 "off", CBC_PARAM_STR_REDSPLITCUTS); 2818 2823 parameters[numberParameters1].append("on"); 2819 2824 parameters[numberParameters1].append("root"); … … 2822 2827 parameters[numberParameters1].setLonghelp 2823 2828 ( 2824 "This switches on reduce and split cuts (either at root or in entire tree) \2829 "This switches on reduce and split cuts (either at root or in entire tree) \ 2825 2830 See branchAndCut for information on options." 2826 );2827 parameters[numberParameters++]=2828 CbcOrClpParam("residual!CapacityCuts","Whether to use Residual Capacity cuts",2829 "off",RESIDCUTS);2830 parameters[numberParameters1].append("on");2831 parameters[numberParameters1].append("root");2832 parameters[numberParameters1].append("ifmove");2833 parameters[numberParameters1].append("forceOn");2834 parameters[numberParameters1].setLonghelp2835 ( 2836 "Residual capacity cuts. \2831 ); 2832 parameters[numberParameters++] = 2833 CbcOrClpParam("residual!CapacityCuts", "Whether to use Residual Capacity cuts", 2834 "off", CBC_PARAM_STR_RESIDCUTS); 2835 parameters[numberParameters1].append("on"); 2836 parameters[numberParameters1].append("root"); 2837 parameters[numberParameters1].append("ifmove"); 2838 parameters[numberParameters1].append("forceOn"); 2839 parameters[numberParameters1].setLonghelp 2840 ( 2841 "Residual capacity cuts. \ 2837 2842 See branchAndCut for information on options." 2838 );2843 ); 2839 2844 #endif 2840 2845 #ifdef COIN_HAS_CLP 2841 parameters[numberParameters++]=2842 CbcOrClpParam("restore!Model","Restore model from binary file",2843 RESTORE,7,1);2844 parameters[numberParameters1].setLonghelp2845 ( 2846 "This reads data save by saveModel from the given file. It will use the default\2846 parameters[numberParameters++] = 2847 CbcOrClpParam("restore!Model", "Restore model from binary file", 2848 CLP_PARAM_ACTION_RESTORE, 7, 1); 2849 parameters[numberParameters1].setLonghelp 2850 ( 2851 "This reads data save by saveModel from the given file. It will use the default\ 2847 2852 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 2848 2853 is initialized to 'default.prob'." 2849 );2850 parameters[numberParameters++]=2851 CbcOrClpParam("reverse","Reverses sign of objective",2852 REVERSE,7,0);2853 parameters[numberParameters1].setLonghelp2854 ( 2855 "Useful for testing if maximization works correctly"2856 );2857 parameters[numberParameters++]=2858 CbcOrClpParam("rhs!Scale","Scale factor to apply to rhs and bounds",2859 1.0e20,1.0e20,RHSSCALE,0);2860 parameters[numberParameters1].setLonghelp2861 ( 2862 "If the rhs or bounds have some very large meaningful values, you may wish to scale them\2854 ); 2855 parameters[numberParameters++] = 2856 CbcOrClpParam("reverse", "Reverses sign of objective", 2857 CLP_PARAM_ACTION_REVERSE, 7, 0); 2858 parameters[numberParameters1].setLonghelp 2859 ( 2860 "Useful for testing if maximization works correctly" 2861 ); 2862 parameters[numberParameters++] = 2863 CbcOrClpParam("rhs!Scale", "Scale factor to apply to rhs and bounds", 2864 1.0e20, 1.0e20, CLP_PARAM_DBL_RHSSCALE, 0); 2865 parameters[numberParameters1].setLonghelp 2866 ( 2867 "If the rhs or bounds have some very large meaningful values, you may wish to scale them\ 2863 2868 internally by this amount. It can also be set by autoscale. This should not be needed." 2864 );2865 parameters[numberParameters1].setDoubleValue(1.0);2866 #endif 2867 #ifdef COIN_HAS_CBC 2868 parameters[numberParameters++]=2869 CbcOrClpParam("Rens","Whether to try Relaxation Enforced Neighborhood Search",2870 "off",RENS);2869 ); 2870 parameters[numberParameters1].setDoubleValue(1.0); 2871 #endif 2872 #ifdef COIN_HAS_CBC 2873 parameters[numberParameters++] = 2874 CbcOrClpParam("Rens", "Whether to try Relaxation Enforced Neighborhood Search", 2875 "off", CBC_PARAM_STR_RENS); 2871 2876 parameters[numberParameters1].append("on"); 2872 2877 parameters[numberParameters1].append("both"); … … 2875 2880 parameters[numberParameters1].append("1000"); 2876 2881 parameters[numberParameters1].append("10000"); 2877 parameters[numberParameters1].setLonghelp2878 ( 2879 "This switches on Relaxation enforced neighborhood Search. \2882 parameters[numberParameters1].setLonghelp 2883 ( 2884 "This switches on Relaxation enforced neighborhood Search. \ 2880 2885 on just does 50 nodes \ 2881 2886 200 or 1000 does that many nodes. \ 2882 Doh option does heuristic before preprocessing" ); 2883 parameters[numberParameters++]=2884 CbcOrClpParam("Rins","Whether to try Relaxed Induced Neighborhood Search",2885 "off",RINS);2887 Doh option does heuristic before preprocessing" ); 2888 parameters[numberParameters++] = 2889 CbcOrClpParam("Rins", "Whether to try Relaxed Induced Neighborhood Search", 2890 "off", CBC_PARAM_STR_RINS); 2886 2891 parameters[numberParameters1].append("on"); 2887 2892 parameters[numberParameters1].append("both"); 2888 2893 parameters[numberParameters1].append("before"); 2889 2894 parameters[numberParameters1].append("often"); 2890 parameters[numberParameters1].setLonghelp2891 ( 2892 "This switches on Relaxed induced neighborhood Search. \2893 Doh option does heuristic before preprocessing" ); 2894 parameters[numberParameters++]=2895 CbcOrClpParam("round!ingHeuristic","Whether to use Rounding heuristic",2896 "off",ROUNDING);2897 parameters[numberParameters1].append("on");2898 parameters[numberParameters1].append("both");2899 parameters[numberParameters1].append("before");2900 parameters[numberParameters1].setLonghelp2901 ( 2902 "This switches on a simple (but effective) rounding heuristic at each node of tree. \2895 parameters[numberParameters1].setLonghelp 2896 ( 2897 "This switches on Relaxed induced neighborhood Search. \ 2898 Doh option does heuristic before preprocessing" ); 2899 parameters[numberParameters++] = 2900 CbcOrClpParam("round!ingHeuristic", "Whether to use Rounding heuristic", 2901 "off", CBC_PARAM_STR_ROUNDING); 2902 parameters[numberParameters1].append("on"); 2903 parameters[numberParameters1].append("both"); 2904 parameters[numberParameters1].append("before"); 2905 parameters[numberParameters1].setLonghelp 2906 ( 2907 "This switches on a simple (but effective) rounding heuristic at each node of tree. \ 2903 2908 On means do in solve i.e. after preprocessing, \ 2904 2909 Before means do if doHeuristics used, off otherwise, \ 2905 2910 and both means do if doHeuristics and in solve." 2906 2911 ); 2907 2912 2908 2913 #endif 2909 parameters[numberParameters++]=2910 CbcOrClpParam("saveM!odel","Save model to binary file",2911 SAVE,7,1);2912 parameters[numberParameters1].setLonghelp2913 ( 2914 "This will save the problem to the given file name for future use\2914 parameters[numberParameters++] = 2915 CbcOrClpParam("saveM!odel", "Save model to binary file", 2916 CLP_PARAM_ACTION_SAVE, 7, 1); 2917 parameters[numberParameters1].setLonghelp 2918 ( 2919 "This will save the problem to the given file name for future use\ 2915 2920 by restoreModel. It will use the default\ 2916 2921 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 2917 2922 is initialized to 'default.prob'." 2918 );2919 parameters[numberParameters++]=2920 CbcOrClpParam("saveS!olution","saves solution to file",2921 2922 parameters[numberParameters1].setLonghelp2923 ( 2924 "This will write a binary solution file to the given file name. It will use the default\2923 ); 2924 parameters[numberParameters++] = 2925 CbcOrClpParam("saveS!olution", "saves solution to file", 2926 CLP_PARAM_ACTION_SAVESOL); 2927 parameters[numberParameters1].setLonghelp 2928 ( 2929 "This will write a binary solution file to the given file name. It will use the default\ 2925 2930 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 2926 2931 is initialized to 'solution.file'. To read the file use fread(int) twice to pick up number of rows \ … … 2928 2933 activities and reduced costs  see bottom of CbcOrClpParam.cpp for code that reads or writes file. \ 2929 2934 If name contains '_fix_read_' then does not write but reads and will fix all variables" 2930 );2931 parameters[numberParameters++]=2932 CbcOrClpParam("scal!ing","Whether to scale problem",2933 "off",SCALING);2934 parameters[numberParameters1].append("equi!librium");2935 parameters[numberParameters1].append("geo!metric");2936 parameters[numberParameters1].append("auto!matic");2937 parameters[numberParameters1].append("dynamic");2938 parameters[numberParameters1].append("rows!only");2939 parameters[numberParameters1].setLonghelp2940 ( 2941 "Scaling can help in solving problems which might otherwise fail because of lack of\2935 ); 2936 parameters[numberParameters++] = 2937 CbcOrClpParam("scal!ing", "Whether to scale problem", 2938 "off", CLP_PARAM_STR_SCALING); 2939 parameters[numberParameters1].append("equi!librium"); 2940 parameters[numberParameters1].append("geo!metric"); 2941 parameters[numberParameters1].append("auto!matic"); 2942 parameters[numberParameters1].append("dynamic"); 2943 parameters[numberParameters1].append("rows!only"); 2944 parameters[numberParameters1].setLonghelp 2945 ( 2946 "Scaling can help in solving problems which might otherwise fail because of lack of\ 2942 2947 accuracy. It can also reduce the number of iterations. It is not applied if the range\ 2943 2948 of elements is small. When unscaled it is possible that there may be small primal and/or\ 2944 2949 infeasibilities." 2945 );2946 parameters[numberParameters1].setCurrentOption(3); // say auto2950 ); 2951 parameters[numberParameters1].setCurrentOption(3); // say auto 2947 2952 #ifndef COIN_HAS_CBC 2948 parameters[numberParameters++]=2949 CbcOrClpParam("sec!onds","Maximum seconds",2950 1.0,1.0e12,TIMELIMIT);2951 parameters[numberParameters1].setLonghelp2952 ( 2953 "After this many seconds clp will act as if maximum iterations had been reached \2953 parameters[numberParameters++] = 2954 CbcOrClpParam("sec!onds", "Maximum seconds", 2955 1.0, 1.0e12, CLP_PARAM_DBL_TIMELIMIT); 2956 parameters[numberParameters1].setLonghelp 2957 ( 2958 "After this many seconds clp will act as if maximum iterations had been reached \ 2954 2959 (if value >=0)." 2955 2960 ); 2956 2961 #else 2957 parameters[numberParameters++]=2958 CbcOrClpParam("sec!onds","maximum seconds",2959 1.0,1.0e12,TIMELIMIT_BAB);2960 parameters[numberParameters1].setLonghelp2961 ( 2962 "After this many seconds coin solver will act as if maximum nodes had been reached."2963 2964 #endif 2965 parameters[numberParameters++]=2966 CbcOrClpParam("sleep","for debug",2967 DUMMY,7,0);2968 parameters[numberParameters1].setLonghelp2969 ( 2970 "If passed to solver fom ampl, then ampl will wait so that you can copy .nl file for debug."2971 );2962 parameters[numberParameters++] = 2963 CbcOrClpParam("sec!onds", "maximum seconds", 2964 1.0, 1.0e12, CBC_PARAM_DBL_TIMELIMIT_BAB); 2965 parameters[numberParameters1].setLonghelp 2966 ( 2967 "After this many seconds coin solver will act as if maximum nodes had been reached." 2968 ); 2969 #endif 2970 parameters[numberParameters++] = 2971 CbcOrClpParam("sleep", "for debug", 2972 CLP_PARAM_ACTION_DUMMY, 7, 0); 2973 parameters[numberParameters1].setLonghelp 2974 ( 2975 "If passed to solver fom ampl, then ampl will wait so that you can copy .nl file for debug." 2976 ); 2972 2977 #ifdef COIN_HAS_CLP 2973 parameters[numberParameters++]=2974 CbcOrClpParam("slp!Value","Number of slp passes before primal",2975 1,50000,SLPVALUE,1);2976 parameters[numberParameters1].setLonghelp2977 ( 2978 "If you are solving a quadratic problem using primal then it may be helpful to do some \2978 parameters[numberParameters++] = 2979 CbcOrClpParam("slp!Value", "Number of slp passes before primal", 2980 1, 50000, CLP_PARAM_INT_SLPVALUE, 1); 2981 parameters[numberParameters1].setLonghelp 2982 ( 2983 "If you are solving a quadratic problem using primal then it may be helpful to do some \ 2979 2984 sequential Lps to get a good approximate solution." 2980 );2985 ); 2981 2986 #if CLP_MULTIPLE_FACTORIZATIONS > 0 2982 parameters[numberParameters++]=2983 CbcOrClpParam("small!Factorization","Whether to use small factorization",2984 1,10000,SMALLFACT,1);2985 parameters[numberParameters1].setLonghelp2986 ( 2987 "If processed problem <= this use small factorization"2988 );2989 parameters[numberParameters1].setIntValue(1);2990 #endif 2991 #endif 2992 parameters[numberParameters++]=2993 CbcOrClpParam("solu!tion","Prints solution to file",2994 2995 parameters[numberParameters1].setLonghelp2996 ( 2997 "This will write a primitive solution file to the given file name. It will use the default\2987 parameters[numberParameters++] = 2988 CbcOrClpParam("small!Factorization", "Whether to use small factorization", 2989 1, 10000, CBC_PARAM_INT_SMALLFACT, 1); 2990 parameters[numberParameters1].setLonghelp 2991 ( 2992 "If processed problem <= this use small factorization" 2993 ); 2994 parameters[numberParameters1].setIntValue(1); 2995 #endif 2996 #endif 2997 parameters[numberParameters++] = 2998 CbcOrClpParam("solu!tion", "Prints solution to file", 2999 CLP_PARAM_ACTION_SOLUTION); 3000 parameters[numberParameters1].setLonghelp 3001 ( 3002 "This will write a primitive solution file to the given file name. It will use the default\ 2998 3003 directory given by 'directory'. A name of '$' will use the previous value for the name. This\ 2999 3004 is initialized to 'stdout'. The amount of output can be varied using printi!ngOptions or printMask." 3000 );3005 ); 3001 3006 #ifdef COIN_HAS_CLP 3002 3007 #ifdef COIN_HAS_CBC 3003 parameters[numberParameters++]=3004 CbcOrClpParam("solv!e","Solve problem",3005 3006 parameters[numberParameters1].setLonghelp3007 ( 3008 "If there are no integer variables then this just solves LP. If there are integer variables \3008 parameters[numberParameters++] = 3009 CbcOrClpParam("solv!e", "Solve problem", 3010 CBC_PARAM_ACTION_BAB); 3011 parameters[numberParameters1].setLonghelp 3012 ( 3013 "If there are no integer variables then this just solves LP. If there are integer variables \ 3009 3014 this does branch and cut." 3010 );3011 parameters[numberParameters++]=3012 CbcOrClpParam("sos!Options","Whether to use SOS from AMPL",3013 "off",SOS);3014 parameters[numberParameters1].append("on");3015 parameters[numberParameters1].setCurrentOption("on");3016 parameters[numberParameters1].setLonghelp3017 ( 3018 "Normally if AMPL says there are SOS variables they should be used, but sometime sthey should\3015 ); 3016 parameters[numberParameters++] = 3017 CbcOrClpParam("sos!Options", "Whether to use SOS from AMPL", 3018 "off", CBC_PARAM_STR_SOS); 3019 parameters[numberParameters1].append("on"); 3020 parameters[numberParameters1].setCurrentOption("on"); 3021 parameters[numberParameters1].setLonghelp 3022 ( 3023 "Normally if AMPL says there are SOS variables they should be used, but sometime sthey should\ 3019 3024 be turned off  this does so." 3020 );3021 parameters[numberParameters++]=3022 CbcOrClpParam("slog!Level","Level of detail in (LP) Solver output",3023 1,63,SOLVERLOGLEVEL);3024 parameters[numberParameters1].setLonghelp3025 ( 3026 "If 0 then there should be no output in normal circumstances. 1 is probably the best\3025 ); 3026 parameters[numberParameters++] = 3027 CbcOrClpParam("slog!Level", "Level of detail in (LP) Solver output", 3028 1, 63, CLP_PARAM_INT_SOLVERLOGLEVEL); 3029 parameters[numberParameters1].setLonghelp 3030 ( 3031 "If 0 then there should be no output in normal circumstances. 1 is probably the best\ 3027 3032 value for most uses, while 2 and 3 give more information. This parameter is only used inside MIP  for Clp use 'log'" 3028 3033 ); 3029 3034 #else 3030 // allow solve as synonym for dual3031 parameters[numberParameters++]=3032 CbcOrClpParam("solv!e","Solve problem using dual simplex",3033 3034 parameters[numberParameters1].setLonghelp3035 ( 3036 "Just so can use solve for clp as well as in cbc"3037 );3035 // allow solve as synonym for dual 3036 parameters[numberParameters++] = 3037 CbcOrClpParam("solv!e", "Solve problem using dual simplex", 3038 CBC_PARAM_ACTION_BAB); 3039 parameters[numberParameters1].setLonghelp 3040 ( 3041 "Just so can use solve for clp as well as in cbc" 3042 ); 3038 3043 #endif 3039 3044 #endif 3040 3045 #ifdef COIN_HAS_CLP 3041 parameters[numberParameters++]=3042 CbcOrClpParam("spars!eFactor","Whether factorization treated as sparse",3043 "on",SPARSEFACTOR,7,0);3044 parameters[numberParameters1].append("off");3045 parameters[numberParameters++]=3046 CbcOrClpParam("special!Options","Dubious options for Simplex  see ClpSimplex.hpp",3047 0,COIN_INT_MAX,SPECIALOPTIONS,0);3048 parameters[numberParameters++]=3049 CbcOrClpParam("sprint!Crash","Whether to try sprint crash",3050 1,5000000,SPRINT);3051 parameters[numberParameters1].setLonghelp3052 ( 3053 "For long and thin problems this program may solve a series of small problems\3046 parameters[numberParameters++] = 3047 CbcOrClpParam("spars!eFactor", "Whether factorization treated as sparse", 3048 "on", CLP_PARAM_STR_SPARSEFACTOR, 7, 0); 3049 parameters[numberParameters1].append("off"); 3050 parameters[numberParameters++] = 3051 CbcOrClpParam("special!Options", "Dubious options for Simplex  see ClpSimplex.hpp", 3052 0, COIN_INT_MAX, CLP_PARAM_INT_SPECIALOPTIONS, 0); 3053 parameters[numberParameters++] = 3054 CbcOrClpParam("sprint!Crash", "Whether to try sprint crash", 3055 1, 5000000, CLP_PARAM_INT_SPRINT); 3056 parameters[numberParameters1].setLonghelp 3057 ( 3058 "For long and thin problems this program may solve a series of small problems\ 3054 3059 created by taking a subset of the columns. I introduced the idea as 'Sprint' after\ 3055 3060 an LP code of that name of the 60's which tried the same tactic (not totally successfully).\ 3056 3061 Cplex calls it 'sifting'. 1 is automatic choice, 0 is off, n is number of passes" 3057 );3058 parameters[numberParameters++]=3059 CbcOrClpParam("stat!istics","Print some statistics",3060 3061 parameters[numberParameters1].setLonghelp3062 ( 3063 "This command prints some statistics for the current model.\3062 ); 3063 parameters[numberParameters++] = 3064 CbcOrClpParam("stat!istics", "Print some statistics", 3065 CLP_PARAM_ACTION_STATISTICS); 3066 parameters[numberParameters1].setLonghelp 3067 ( 3068 "This command prints some statistics for the current model.\ 3064 3069 If log level >1 then more is printed.\ 3065 3070 These are for presolved model if presolve on (and unscaled)." 3066 3067 #endif 3068 parameters[numberParameters++]=3069 CbcOrClpParam("stop","Stops clp execution",3070 3071 parameters[numberParameters1].setLonghelp3072 ( 3073 "This stops the execution of Clp, end, exit, quit and stop are synonyms"3074 );3075 #ifdef COIN_HAS_CBC 3076 parameters[numberParameters++]=3077 CbcOrClpParam("strat!egy","Switches on groups of features",3078 0,2,STRATEGY);3079 parameters[numberParameters1].setLonghelp3080 ( 3081 "This turns on newer features. \3071 ); 3072 #endif 3073 parameters[numberParameters++] = 3074 CbcOrClpParam("stop", "Stops clp execution", 3075 CLP_PARAM_ACTION_EXIT); 3076 parameters[numberParameters1].setLonghelp 3077 ( 3078 "This stops the execution of Clp, end, exit, quit and stop are synonyms" 3079 ); 3080 #ifdef COIN_HAS_CBC 3081 parameters[numberParameters++] = 3082 CbcOrClpParam("strat!egy", "Switches on groups of features", 3083 0, 2, CBC_PARAM_INT_STRATEGY); 3084 parameters[numberParameters1].setLonghelp 3085 ( 3086 "This turns on newer features. \ 3082 3087 Use 0 for easy problems, 1 is default, 2 is aggressive. \ 3083 3088 1 uses Gomory cuts using tolerance of 0.01 at root, \ … … 3086 3091 more aggressive. \ 3087 3092 This does not apply to unit tests (where 'experiment' may have similar effects)." 3088 );3089 parameters[numberParameters1].setIntValue(1);3093 ); 3094 parameters[numberParameters1].setIntValue(1); 3090 3095 #ifdef CBC_KEEP_DEPRECATED 3091 parameters[numberParameters++]=3092 CbcOrClpParam("strengthen","Create strengthened problem",3093 STRENGTHEN,3);3094 parameters[numberParameters1].setLonghelp3095 ( 3096 "This creates a new problem by applying the root node cuts. All tight constraints \3096 parameters[numberParameters++] = 3097 CbcOrClpParam("strengthen", "Create strengthened problem", 3098 CBC_PARAM_ACTION_STRENGTHEN, 3); 3099 parameters[numberParameters1].setLonghelp 3100 ( 3101 "This creates a new problem by applying the root node cuts. All tight constraints \ 3097 3102 will be in resulting problem" 3098 3099 #endif 3100 parameters[numberParameters++]=3101 CbcOrClpParam("strong!Branching","Number of variables to look at in strong branching",3102 0,999999,STRONGBRANCHING);3103 parameters[numberParameters1].setLonghelp3104 ( 3105 "In order to decide which variable to branch on, the code will choose up to this number \3103 ); 3104 #endif 3105 parameters[numberParameters++] = 3106 CbcOrClpParam("strong!Branching", "Number of variables to look at in strong branching", 3107 0, 999999, CBC_PARAM_INT_STRONGBRANCHING); 3108 parameters[numberParameters1].setLonghelp 3109 ( 3110 "In order to decide which variable to branch on, the code will choose up to this number \ 3106 3111 of unsatisfied variables to do mini up and down branches on. Then the most effective one is chosen. \ 3107 3112 If a variable is branched on many times then the previous average up and down costs may be used  \ 3108 3113 see number before trust." 3109 );3114 ); 3110 3115 #endif 3111 3116 #ifdef COIN_HAS_CLP 3112 parameters[numberParameters++]=3113 CbcOrClpParam("subs!titution","How long a column to substitute for in presolve",3114 0,10000,SUBSTITUTION,0);3115 parameters[numberParameters1].setLonghelp3116 ( 3117 "Normally Presolve gets rid of 'free' variables when there are no more than 3 \3117 parameters[numberParameters++] = 3118 CbcOrClpParam("subs!titution", "How long a column to substitute for in presolve", 3119 0, 10000, CLP_PARAM_INT_SUBSTITUTION, 0); 3120 parameters[numberParameters1].setLonghelp 3121 ( 3122 "Normally Presolve gets rid of 'free' variables when there are no more than 3 \ 3118 3123 variables in column. If you increase this the number of rows may decrease but number of \ 3119 3124 elements may increase." 3120 );3121 #endif 3122 #ifdef COIN_HAS_CBC 3123 parameters[numberParameters++]=3124 CbcOrClpParam("testO!si","Test OsiObject stuff",3125 1,COIN_INT_MAX,TESTOSI,0);3125 ); 3126 #endif 3127 #ifdef COIN_HAS_CBC 3128 parameters[numberParameters++] = 3129 CbcOrClpParam("testO!si", "Test OsiObject stuff", 3130 1, COIN_INT_MAX, CBC_PARAM_INT_TESTOSI, 0); 3126 3131 #endif 3127 3132 #ifdef CBC_THREAD 3128 parameters[numberParameters++]=3129 CbcOrClpParam("thread!s","Number of threads to try and use",3130 100,100000,THREADS,1);3131 parameters[numberParameters1].setLonghelp3132 ( 3133 "To use multiple threads, set threads to number wanted. It may be better \3133 parameters[numberParameters++] = 3134 CbcOrClpParam("thread!s", "Number of threads to try and use", 3135 100, 100000, CBC_PARAM_INT_THREADS, 1); 3136 parameters[numberParameters1].setLonghelp 3137 ( 3138 "To use multiple threads, set threads to number wanted. It may be better \ 3134 3139 to use one or two more than number of cpus available. If 100+n then n threads and \ 3135 3140 search is repeatable (maybe be somewhat slower), \ 3136 3141 if 200+n use threads for root cuts, 400+n threads used in subtrees." 3137 );3138 #endif 3139 #ifdef COIN_HAS_CBC 3140 parameters[numberParameters++]=3141 CbcOrClpParam("tighten!Factor","Tighten bounds using this times largest \3142 ); 3143 #endif 3144 #ifdef COIN_HAS_CBC 3145 parameters[numberParameters++] = 3146 CbcOrClpParam("tighten!Factor", "Tighten bounds using this times largest \ 3142 3147 activity at continuous solution", 3143 1.0e3,1.0e20,TIGHTENFACTOR,0);3144 parameters[numberParameters1].setLonghelp3145 ( 3146 "This sleazy trick can help on some problems."3147 );3148 1.0e3, 1.0e20, CBC_PARAM_DBL_TIGHTENFACTOR, 0); 3149 parameters[numberParameters1].setLonghelp 3150 ( 3151 "This sleazy trick can help on some problems." 3152 ); 3148 3153 #endif 3149 3154 #ifdef COIN_HAS_CLP 3150 parameters[numberParameters++]=3151 CbcOrClpParam("tightLP","Poor person's preSolve for now",3152 TIGHTEN,7,0);3153 #endif 3154 #ifdef COIN_HAS_CBC 3155 parameters[numberParameters++]=3156 CbcOrClpParam("trust!PseudoCosts","Number of branches before we trust pseudocosts",3157 3,2000000,NUMBERBEFORE);3158 parameters[numberParameters1].setLonghelp3159 ( 3160 "Using strong branching computes pseudocosts. After this many times for a variable we just \3155 parameters[numberParameters++] = 3156 CbcOrClpParam("tightLP", "Poor person's preSolve for now", 3157 CLP_PARAM_ACTION_TIGHTEN, 7, 0); 3158 #endif 3159 #ifdef COIN_HAS_CBC 3160 parameters[numberParameters++] = 3161 CbcOrClpParam("trust!PseudoCosts", "Number of branches before we trust pseudocosts", 3162 3, 2000000, CBC_PARAM_INT_NUMBERBEFORE); 3163 parameters[numberParameters1].setLonghelp 3164 ( 3165 "Using strong branching computes pseudocosts. After this many times for a variable we just \ 3161 3166 trust the pseudo costs and do not do any more strong branching." 3162 );3163 #endif 3164 #ifdef COIN_HAS_CBC 3165 parameters[numberParameters++]=3166 CbcOrClpParam("tune!PreProcess","Dubious tuning parameters",3167 0,20000000,PROCESSTUNE,1);3168 parameters[numberParameters1].se