#include <OsiCbcSolverInterface.hpp>
Inheritance diagram for OsiCbcSolverInterface:
Public Member Functions | |
virtual void | setObjSense (double s) |
Set objective function sense (1 for min (default), -1 for max,). | |
virtual void | setColSolution (const double *colsol) |
Set the primal solution column values. | |
virtual void | setRowPrice (const double *rowprice) |
Set dual solution vector. | |
Solve methods | |
virtual void | initialSolve () |
Solve initial LP relaxation. | |
virtual void | resolve () |
Resolve an LP relaxation after problem modification. | |
virtual void | branchAndBound () |
Invoke solver's built-in enumeration algorithm. | |
Parameter set/get methods | |
The set methods return true if the parameter was set to the given value, false otherwise. There can be various reasons for failure: the given parameter is not applicable for the solver (e.g., refactorization frequency for the cbc algorithm), the parameter is not yet implemented for the solver or simply the value of the parameter is out of the range the solver accepts. If a parameter setting call returns false check the details of your solver.
The get methods return true if the given parameter is applicable for the solver and is implemented. In this case the value of the parameter is returned in the second argument. Otherwise they return false. | |
bool | setIntParam (OsiIntParam key, int value) |
bool | setDblParam (OsiDblParam key, double value) |
bool | setStrParam (OsiStrParam key, const std::string &value) |
bool | getIntParam (OsiIntParam key, int &value) const |
bool | getDblParam (OsiDblParam key, double &value) const |
bool | getStrParam (OsiStrParam key, std::string &value) const |
virtual bool | setHintParam (OsiHintParam key, bool yesNo=true, OsiHintStrength strength=OsiHintTry, void *otherInformation=NULL) |
virtual bool | getHintParam (OsiHintParam key, bool &yesNo, OsiHintStrength &strength, void *&otherInformation) const |
Get a hint parameter. | |
virtual bool | getHintParam (OsiHintParam key, bool &yesNo, OsiHintStrength &strength) const |
Get a hint parameter. | |
Methods returning info on how the solution process terminated | |
virtual bool | isAbandoned () const |
Are there a numerical difficulties? | |
virtual bool | isProvenOptimal () const |
Is optimality proven? | |
virtual bool | isProvenPrimalInfeasible () const |
Is primal infeasiblity proven? | |
virtual bool | isProvenDualInfeasible () const |
Is dual infeasiblity proven? | |
virtual bool | isPrimalObjectiveLimitReached () const |
Is the given primal objective limit reached? | |
virtual bool | isDualObjectiveLimitReached () const |
Is the given dual objective limit reached? | |
virtual bool | isIterationLimitReached () const |
Iteration limit reached? | |
WarmStart related methods | |
virtual CoinWarmStart * | getEmptyWarmStart () const |
Get an empty warm start object. | |
virtual CoinWarmStart * | getWarmStart () const |
Get warmstarting information. | |
virtual bool | setWarmStart (const CoinWarmStart *warmstart) |
Set warmstarting information. | |
Hotstart related methods (primarily used in strong branching). <br> | |
The user can create a hotstart (a snapshot) of the optimization process then reoptimize over and over again always starting from there. NOTE: between hotstarted optimizations only bound changes are allowed. | |
virtual void | markHotStart () |
Create a hotstart point of the optimization process. | |
virtual void | solveFromHotStart () |
Optimize starting from the hotstart. | |
virtual void | unmarkHotStart () |
Delete the snapshot. | |
Methods related to querying the input data | |
virtual int | getNumCols () const |
Get number of columns. | |
virtual int | getNumRows () const |
Get number of rows. | |
virtual int | getNumElements () const |
Get number of nonzero elements. | |
virtual const double * | getColLower () const |
Get pointer to array[getNumCols()] of column lower bounds. | |
virtual const double * | getColUpper () const |
Get pointer to array[getNumCols()] of column upper bounds. | |
virtual const char * | getRowSense () const |
Get pointer to array[getNumRows()] of row constraint senses. | |
virtual const double * | getRightHandSide () const |
Get pointer to array[getNumRows()] of rows right-hand sides. | |
virtual const double * | getRowRange () const |
Get pointer to array[getNumRows()] of row ranges. | |
virtual const double * | getRowLower () const |
Get pointer to array[getNumRows()] of row lower bounds. | |
virtual const double * | getRowUpper () const |
Get pointer to array[getNumRows()] of row upper bounds. | |
virtual const double * | getObjCoefficients () const |
Get pointer to array[getNumCols()] of objective function coefficients. | |
virtual double | getObjSense () const |
Get objective function sense (1 for min (default), -1 for max). | |
virtual bool | isContinuous (int colNumber) const |
Return true if column is continuous. | |
virtual const CoinPackedMatrix * | getMatrixByRow () const |
Get pointer to row-wise copy of matrix. | |
virtual const CoinPackedMatrix * | getMatrixByCol () const |
Get pointer to column-wise copy of matrix. | |
virtual double | getInfinity () const |
Get solver's value for infinity. | |
Methods related to querying the solution | |
virtual const double * | getColSolution () const |
Get pointer to array[getNumCols()] of primal solution vector. | |
virtual const double * | getRowPrice () const |
Get pointer to array[getNumRows()] of dual prices. | |
virtual const double * | getReducedCost () const |
Get a pointer to array[getNumCols()] of reduced costs. | |
virtual const double * | getRowActivity () const |
Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vector. | |
virtual double | getObjValue () const |
Get objective function value. | |
virtual int | getIterationCount () const |
Get how many iterations it took to solve the problem (whatever "iteration" mean to the solver. | |
virtual std::vector< double * > | getDualRays (int maxNumRays) const |
Get as many dual rays as the solver can provide. | |
virtual std::vector< double * > | getPrimalRays (int maxNumRays) const |
Get as many primal rays as the solver can provide. | |
Changing bounds on variables and constraints | |
virtual void | setObjCoeff (int elementIndex, double elementValue) |
Set an objective function coefficient. | |
virtual void | setColLower (int elementIndex, double elementValue) |
Set a single column lower bound Use -DBL_MAX for -infinity. | |
virtual void | setColUpper (int elementIndex, double elementValue) |
Set a single column upper bound Use DBL_MAX for infinity. | |
virtual void | setColBounds (int elementIndex, double lower, double upper) |
Set a single column lower and upper bound. | |
virtual void | setColSetBounds (const int *indexFirst, const int *indexLast, const double *boundList) |
Set the bounds on a number of columns simultaneously The default implementation just invokes setColLower() and setColUpper() over and over again. | |
virtual void | setRowLower (int elementIndex, double elementValue) |
Set a single row lower bound Use -DBL_MAX for -infinity. | |
virtual void | setRowUpper (int elementIndex, double elementValue) |
Set a single row upper bound Use DBL_MAX for infinity. | |
virtual void | setRowBounds (int elementIndex, double lower, double upper) |
Set a single row lower and upper bound. | |
virtual void | setRowType (int index, char sense, double rightHandSide, double range) |
Set the type of a single row . | |
virtual void | setRowSetBounds (const int *indexFirst, const int *indexLast, const double *boundList) |
Set the bounds on a number of rows simultaneously The default implementation just invokes setRowLower() and setRowUpper() over and over again. | |
virtual void | setRowSetTypes (const int *indexFirst, const int *indexLast, const char *senseList, const double *rhsList, const double *rangeList) |
Set the type of a number of rows simultaneously The default implementation just invokes setRowType() over and over again. | |
Integrality related changing methods | |
virtual void | setContinuous (int index) |
Set the index-th variable to be a continuous variable. | |
virtual void | setInteger (int index) |
Set the index-th variable to be an integer variable. | |
virtual void | setContinuous (const int *indices, int len) |
Set the variables listed in indices (which is of length len) to be continuous variables. | |
virtual void | setInteger (const int *indices, int len) |
Set the variables listed in indices (which is of length len) to be integer variables. | |
Methods to expand a problem.<br> | |
Note that if a column is added then by default it will correspond to a continuous variable. | |
virtual void | addCol (const CoinPackedVectorBase &vec, const double collb, const double colub, const double obj) |
Add a column (primal variable) to the problem. | |
virtual void | addCol (int numberElements, const int *rows, const double *elements, const double collb, const double colub, const double obj) |
Add a column (primal variable) to the problem. | |
virtual void | addCols (const int numcols, const CoinPackedVectorBase *const *cols, const double *collb, const double *colub, const double *obj) |
Add a set of columns (primal variables) to the problem. | |
virtual void | deleteCols (const int num, const int *colIndices) |
Remove a set of columns (primal variables) from the problem. | |
virtual void | addRow (const CoinPackedVectorBase &vec, const double rowlb, const double rowub) |
Add a row (constraint) to the problem. | |
virtual void | addRow (const CoinPackedVectorBase &vec, const char rowsen, const double rowrhs, const double rowrng) |
Add a column (primal variable) to the problem. | |
virtual void | addRows (const int numrows, const CoinPackedVectorBase *const *rows, const double *rowlb, const double *rowub) |
Add a set of rows (constraints) to the problem. | |
virtual void | addRows (const int numrows, const CoinPackedVectorBase *const *rows, const char *rowsen, const double *rowrhs, const double *rowrng) |
Add a set of rows (constraints) to the problem. | |
virtual void | deleteRows (const int num, const int *rowIndices) |
Delete a set of rows (constraints) from the problem. | |
virtual void | applyRowCuts (int numberCuts, const OsiRowCut *cuts) |
Apply a collection of row cuts which are all effective. | |
virtual void | applyRowCuts (int numberCuts, const OsiRowCut **cuts) |
Apply a collection of row cuts which are all effective. | |
Methods to input a problem | |
virtual void | loadProblem (const CoinPackedMatrix &matrix, const double *collb, const double *colub, const double *obj, const double *rowlb, const double *rowub) |
Load in an problem by copying the arguments (the constraints on the rows are given by lower and upper bounds). | |
virtual void | assignProblem (CoinPackedMatrix *&matrix, double *&collb, double *&colub, double *&obj, double *&rowlb, double *&rowub) |
Load in an problem by assuming ownership of the arguments (the constraints on the rows are given by lower and upper bounds). | |
virtual void | loadProblem (const CoinPackedMatrix &matrix, const double *collb, const double *colub, const double *obj, const char *rowsen, const double *rowrhs, const double *rowrng) |
Load in an problem by copying the arguments (the constraints on the rows are given by sense/rhs/range triplets). | |
virtual void | assignProblem (CoinPackedMatrix *&matrix, double *&collb, double *&colub, double *&obj, char *&rowsen, double *&rowrhs, double *&rowrng) |
Load in an problem by assuming ownership of the arguments (the constraints on the rows are given by sense/rhs/range triplets). | |
virtual void | loadProblem (const int numcols, const int numrows, const CoinBigIndex *start, const int *index, const double *value, const double *collb, const double *colub, const double *obj, const double *rowlb, const double *rowub) |
Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps). | |
virtual void | loadProblem (const int numcols, const int numrows, const CoinBigIndex *start, const int *index, const double *value, const double *collb, const double *colub, const double *obj, const char *rowsen, const double *rowrhs, const double *rowrng) |
Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps). | |
virtual int | readMps (const char *filename, const char *extension="mps") |
Read an mps file from the given filename (defaults to Osi reader) - returns number of errors (see OsiMpsReader class). | |
virtual void | writeMps (const char *filename, const char *extension="mps", double objSense=0.0) const |
Write the problem into an mps file of the given filename. | |
virtual int | writeMpsNative (const char *filename, const char **rowNames, const char **columnNames, int formatType=0, int numberAcross=2, double objSense=0.0) const |
Write the problem into an mps file of the given filename, names may be null. | |
Message handling (extra for Cbc messages). | |
Normally I presume you would want the same language.
If not then you could use underlying model pointer | |
void | newLanguage (CoinMessages::Language language) |
Set language. | |
void | setLanguage (CoinMessages::Language language) |
Set language. | |
Cbc specific public interfaces | |
CbcModel * | getModelPtr () const |
Get pointer to Cbc model. | |
OsiSolverInterface * | getRealSolverPtr () const |
Get pointer to underlying solver. | |
void | setCutoff (double value) |
Set cutoff bound on the objective function. | |
double | getCutoff () const |
Get the cutoff bound on the objective function - always as minimize. | |
void | setMaximumNodes (int value) |
Set the CbcModel::CbcMaxNumNode maximum node limit. | |
int | getMaximumNodes () const |
Get the CbcModel::CbcMaxNumNode maximum node limit. | |
void | setMaximumSolutions (int value) |
Set the CbcModel::CbcMaxNumSol maximum number of solutions. | |
int | getMaximumSolutions () const |
Get the CbcModel::CbcMaxNumSol maximum number of solutions. | |
void | setMaximumSeconds (double value) |
Set the CbcModel::CbcMaximumSeconds maximum number of seconds. | |
double | getMaximumSeconds () const |
Get the CbcModel::CbcMaximumSeconds maximum number of seconds. | |
bool | isNodeLimitReached () const |
Node limit reached? | |
bool | isSolutionLimitReached () const |
Solution limit reached? | |
int | getNodeCount () const |
Get how many Nodes it took to solve the problem. | |
int | status () const |
Final status of problem - 0 finished, 1 stopped, 2 difficulties. | |
Constructors and destructors | |
OsiCbcSolverInterface (OsiSolverInterface *solver=NULL, CbcStrategy *strategy=NULL) | |
Default Constructor. | |
virtual OsiSolverInterface * | clone (bool copyData=true) const |
Clone. | |
OsiCbcSolverInterface (const OsiCbcSolverInterface &) | |
Copy constructor. | |
OsiCbcSolverInterface & | operator= (const OsiCbcSolverInterface &rhs) |
Assignment operator. | |
virtual | ~OsiCbcSolverInterface () |
Destructor. | |
Protected Member Functions | |
Protected methods | |
virtual void | applyRowCut (const OsiRowCut &rc) |
Apply a row cut (append to constraint matrix). | |
virtual void | applyColCut (const OsiColCut &cc) |
Apply a column cut (adjust one or more bounds). | |
Protected Attributes | |
Protected member data | |
CbcModel * | modelPtr_ |
Cbc model represented by this class instance. | |
Friends | |
void | OsiCbcSolverInterfaceUnitTest (const std::string &mpsDir, const std::string &netlibDir) |
A function that tests the methods in the OsiCbcSolverInterface class. |
Instantiation of OsiCbcSolverInterface for the Model Algorithm.
Definition at line 32 of file OsiCbcSolverInterface.hpp.
|
Default Constructor.
|
|
Copy constructor.
|
|
Destructor.
|
|
Solve initial LP relaxation.
Implements OsiSolverInterface. |
|
Resolve an LP relaxation after problem modification.
Implements OsiSolverInterface. |
|
Invoke solver's built-in enumeration algorithm.
Implements OsiSolverInterface. |
|
Reimplemented from OsiSolverInterface. |
|
Reimplemented from OsiSolverInterface. |
|
Reimplemented from OsiSolverInterface. |
|
Reimplemented from OsiSolverInterface. |
|
Reimplemented from OsiSolverInterface. |
|
Reimplemented from OsiSolverInterface. |
|
Reimplemented from OsiSolverInterface. |
|
Get a hint parameter.
Reimplemented from OsiSolverInterface. |
|
Get a hint parameter.
Reimplemented from OsiSolverInterface. |
|
Are there a numerical difficulties?
Implements OsiSolverInterface. |
|
Is optimality proven?
Implements OsiSolverInterface. |
|
Is primal infeasiblity proven?
Implements OsiSolverInterface. |
|
Is dual infeasiblity proven?
Implements OsiSolverInterface. |
|
Is the given primal objective limit reached?
Implements OsiSolverInterface. |
|
Is the given dual objective limit reached?
Implements OsiSolverInterface. |
|
Iteration limit reached?
Implements OsiSolverInterface. |
|
Get an empty warm start object. This routine returns an empty CoinWarmStartBasis object. Its purpose is to provide a way to give a client a warm start basis object of the appropriate type, which can resized and modified as desired. Implements OsiSolverInterface. |
|
Get warmstarting information.
Implements OsiSolverInterface. |
|
Set warmstarting information. Return true/false depending on whether the warmstart information was accepted or not. Implements OsiSolverInterface. |
|
Create a hotstart point of the optimization process.
Reimplemented from OsiSolverInterface. |
|
Optimize starting from the hotstart.
Reimplemented from OsiSolverInterface. |
|
Delete the snapshot.
Reimplemented from OsiSolverInterface. |
|
Get number of columns.
Implements OsiSolverInterface. |
|
Get number of rows.
Implements OsiSolverInterface. |
|
Get number of nonzero elements.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumCols()] of column lower bounds.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumCols()] of column upper bounds.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumRows()] of row constraint senses.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumRows()] of rows right-hand sides.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumRows()] of row ranges.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumRows()] of row lower bounds.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumRows()] of row upper bounds.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumCols()] of objective function coefficients.
Implements OsiSolverInterface. |
|
Get objective function sense (1 for min (default), -1 for max).
Implements OsiSolverInterface. |
|
Return true if column is continuous.
Implements OsiSolverInterface. |
|
Get pointer to row-wise copy of matrix.
Implements OsiSolverInterface. |
|
Get pointer to column-wise copy of matrix.
Implements OsiSolverInterface. |
|
Get solver's value for infinity.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumCols()] of primal solution vector.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumRows()] of dual prices.
Implements OsiSolverInterface. |
|
Get a pointer to array[getNumCols()] of reduced costs.
Implements OsiSolverInterface. |
|
Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vector.
Implements OsiSolverInterface. |
|
Get objective function value.
Implements OsiSolverInterface. |
|
Get how many iterations it took to solve the problem (whatever "iteration" mean to the solver.
Implements OsiSolverInterface. |
|
Get as many dual rays as the solver can provide. (In case of proven primal infeasibility there should be at least one.)
NOTE for implementers of solver interfaces:
NOTE for users of solver interfaces: Implements OsiSolverInterface. |
|
Get as many primal rays as the solver can provide. (In case of proven dual infeasibility there should be at least one.)
NOTE for implementers of solver interfaces:
NOTE for users of solver interfaces: Implements OsiSolverInterface. |
|
Set an objective function coefficient.
Implements OsiSolverInterface. |
|
Set a single column lower bound
Implements OsiSolverInterface. |
|
Set a single column upper bound
Implements OsiSolverInterface. |
|
Set a single column lower and upper bound.
Reimplemented from OsiSolverInterface. |
|
Set the bounds on a number of columns simultaneously
Reimplemented from OsiSolverInterface. |
|
Set a single row lower bound
Implements OsiSolverInterface. |
|
Set a single row upper bound
Implements OsiSolverInterface. |
|
Set a single row lower and upper bound.
Reimplemented from OsiSolverInterface. |
|
Set the type of a single row
Implements OsiSolverInterface. |
|
Set the bounds on a number of rows simultaneously
Reimplemented from OsiSolverInterface. |
|
Set the type of a number of rows simultaneously
Reimplemented from OsiSolverInterface. |
|
Set the index-th variable to be a continuous variable.
Implements OsiSolverInterface. |
|
Set the index-th variable to be an integer variable.
Implements OsiSolverInterface. |
|
Set the variables listed in indices (which is of length len) to be continuous variables.
Reimplemented from OsiSolverInterface. |
|
Set the variables listed in indices (which is of length len) to be integer variables.
Reimplemented from OsiSolverInterface. |
|
Set objective function sense (1 for min (default), -1 for max,).
Implements OsiSolverInterface. |
|
Set the primal solution column values. colsol[numcols()] is an array of values of the problem column variables. These values are copied to memory owned by the solver object or the solver. They will be returned as the result of colsol() until changed by another call to setColsol() or by a call to any solver routine. Whether the solver makes use of the solution in any way is solver-dependent. Implements OsiSolverInterface. |
|
Set dual solution vector. rowprice[numrows()] is an array of values of the problem row dual variables. These values are copied to memory owned by the solver object or the solver. They will be returned as the result of rowprice() until changed by another call to setRowprice() or by a call to any solver routine. Whether the solver makes use of the solution in any way is solver-dependent. Implements OsiSolverInterface. |
|
Add a column (primal variable) to the problem.
Implements OsiSolverInterface. |
|
Add a column (primal variable) to the problem.
Reimplemented from OsiSolverInterface. |
|
Add a set of columns (primal variables) to the problem. The default implementation simply makes repeated calls to addCol(). Reimplemented from OsiSolverInterface. |
|
Remove a set of columns (primal variables) from the problem. The solver interface for a basis-oriented solver will maintain valid warm start information if all deleted variables are nonbasic. Implements OsiSolverInterface. |
|
Add a row (constraint) to the problem.
Implements OsiSolverInterface. |
|
Add a column (primal variable) to the problem.
Implements OsiSolverInterface. |
|
Add a set of rows (constraints) to the problem. The default implementation simply makes repeated calls to addRow(). Reimplemented from OsiSolverInterface. |
|
Add a set of rows (constraints) to the problem. The default implementation simply makes repeated calls to addRow(). Reimplemented from OsiSolverInterface. |
|
Delete a set of rows (constraints) from the problem. The solver interface for a basis-oriented solver will maintain valid warm start information if all deleted rows are loose. Implements OsiSolverInterface. |
|
Apply a collection of row cuts which are all effective. applyCuts seems to do one at a time which seems inefficient. Reimplemented from OsiSolverInterface. |
|
Apply a collection of row cuts which are all effective. applyCuts seems to do one at a time which seems inefficient. This uses array of pointers Reimplemented from OsiSolverInterface. |
|
Load in an problem by copying the arguments (the constraints on the rows are given by lower and upper bounds). If a pointer is 0 then the following values are the default:
Implements OsiSolverInterface. |
|
Load in an problem by assuming ownership of the arguments (the constraints on the rows are given by lower and upper bounds).
For default values see the previous method. Implements OsiSolverInterface. |
|
Load in an problem by copying the arguments (the constraints on the rows are given by sense/rhs/range triplets). If a pointer is 0 then the following values are the default:
Implements OsiSolverInterface. |
|
Load in an problem by assuming ownership of the arguments (the constraints on the rows are given by sense/rhs/range triplets).
For default values see the previous method. Implements OsiSolverInterface. |
|
Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps).
Implements OsiSolverInterface. |
|
Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps).
Implements OsiSolverInterface. |
|
Read an mps file from the given filename (defaults to Osi reader) - returns number of errors (see OsiMpsReader class).
Reimplemented from OsiSolverInterface. |
|
Write the problem into an mps file of the given filename. If objSense is non zero then -1.0 forces the code to write a maximization objective and +1.0 to write a minimization one. If 0.0 then solver can do what it wants Implements OsiSolverInterface. |
|
Write the problem into an mps file of the given filename, names may be null. formatType is 0 - normal 1 - extra accuracy 2 - IEEE hex (later) Returns non-zero on I/O error Reimplemented from OsiSolverInterface. |
|
Set language.
Reimplemented from OsiSolverInterface. Referenced by setLanguage(). |
|
Set language.
Reimplemented from OsiSolverInterface. Definition at line 570 of file OsiCbcSolverInterface.hpp. References newLanguage(). |
|
Get pointer to Cbc model.
Definition at line 578 of file OsiCbcSolverInterface.hpp. |
|
Get pointer to underlying solver.
Definition at line 581 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Set cutoff bound on the objective function.
Definition at line 584 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Get the cutoff bound on the objective function - always as minimize.
Definition at line 587 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Set the CbcModel::CbcMaxNumNode maximum node limit.
Definition at line 590 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Get the CbcModel::CbcMaxNumNode maximum node limit.
Definition at line 593 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Set the CbcModel::CbcMaxNumSol maximum number of solutions.
Definition at line 596 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Get the CbcModel::CbcMaxNumSol maximum number of solutions.
Definition at line 599 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Set the CbcModel::CbcMaximumSeconds maximum number of seconds.
Definition at line 602 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Get the CbcModel::CbcMaximumSeconds maximum number of seconds.
Definition at line 605 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Node limit reached?
Definition at line 608 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Solution limit reached?
Definition at line 611 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Get how many Nodes it took to solve the problem.
Definition at line 614 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Final status of problem - 0 finished, 1 stopped, 2 difficulties.
Definition at line 617 of file OsiCbcSolverInterface.hpp. References modelPtr_. |
|
Clone.
Implements OsiSolverInterface. |
|
Assignment operator.
|
|
Apply a row cut (append to constraint matrix).
Implements OsiSolverInterface. |
|
Apply a column cut (adjust one or more bounds).
Implements OsiSolverInterface. |
|
A function that tests the methods in the OsiCbcSolverInterface class. The only reason for it not to be a member method is that this way it doesn't have to be compiled into the library. And that's a gain, because the library should be compiled with optimization on, but this method should be compiled with debugging. Also, if this method is compiled with optimization, the compilation takes 10-15 minutes and the machine pages (has 256M core memory!)... |
|
Cbc model represented by this class instance.
Definition at line 662 of file OsiCbcSolverInterface.hpp. Referenced by getCutoff(), getMaximumNodes(), getMaximumSeconds(), getMaximumSolutions(), getNodeCount(), getRealSolverPtr(), isNodeLimitReached(), isSolutionLimitReached(), setCutoff(), setMaximumNodes(), setMaximumSeconds(), setMaximumSolutions(), and status(). |