00001 // (C) Copyright International Business Machines Corporation and Carnegie Mellon University 2006 00002 // All Rights Reserved. 00003 // This code is published under the Common Public License. 00004 // 00005 // Authors : 00006 // Laszlo Ladanyi, International Business Machines Corporation 00007 // Pierre Bonami, Carnegie Mellon University, 00008 // 00009 // Date : 03/15/2006 00010 00011 #ifndef BonminCbcParam_H 00012 #define BonminCbcParam_H 00013 00014 #include "IpoptInterface.hpp" 00015 class BonminCbcParam 00016 { 00017 public: 00026 int algo; 00028 int bbLogLevel; 00030 int logInterval; 00032 int lpLogLevel; 00034 int milpLogLevel; 00036 int oaLogLevel; 00038 double oaLogFrequency; 00041 int nlpLogLevel; 00043 int maxFailures; 00045 int failureBehavior; 00048 int maxInfeasible; 00050 double cutoffDecr; 00052 double cutoff; 00054 double allowableGap; 00056 double allowableFractionGap; 00067 int nodeSelection; 00069 int numberStrong; 00071 int minReliability; 00073 double maxTime; 00075 int maxNodes; 00077 int maxSolutions; 00079 int maxIterations; 00081 double intTol; 00083 int disableSos; 00085 int nlpSolveFrequency; 00087 double oaDecMaxTime; 00095 int milpSubSolver; 00097 int migFreq; 00099 int probFreq; 00101 int mirFreq; 00103 int coverFreq; 00104 00116 int milpSubSolver_nodeSelection; 00119 int milpSubSolver_numberStrong; 00122 int milpSubSolver_minReliability; 00124 int milpSubSolver_migFreq; 00126 int milpSubSolver_probFreq; 00128 int milpSubSolver_mirFreq; 00130 int milpSubSolver_coverFreq; 00132 FILE * fout; 00133 public: 00135 BonminCbcParam():fout(NULL) 00136 {} 00138 ~BonminCbcParam() 00139 {} 00141 bool extractParams(IpoptInterface &solver); 00143 bool operator()(IpoptInterface &solver) 00144 { 00145 return extractParams(solver); 00146 } 00147 }; 00148 00149 #endif 00150