Cbc
2.10.10
|
Cbc Solver Interface. More...
#include <OsiCbcSolverInterface.hpp>
Public Member Functions | |
Solve methods | |
virtual void | initialSolve () |
Solve initial LP relaxation. More... | |
virtual void | resolve () |
Resolve an LP relaxation after problem modification. More... | |
virtual void | branchAndBound () |
Invoke solver's built-in enumeration algorithm. More... | |
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. More... | |
virtual bool | getHintParam (OsiHintParam key, bool &yesNo, OsiHintStrength &strength) const |
Get a hint parameter. More... | |
Methods returning info on how the solution process terminated | |
virtual bool | isAbandoned () const |
Are there a numerical difficulties? More... | |
virtual bool | isProvenOptimal () const |
Is optimality proven? More... | |
virtual bool | isProvenPrimalInfeasible () const |
Is primal infeasiblity proven? More... | |
virtual bool | isProvenDualInfeasible () const |
Is dual infeasiblity proven? More... | |
virtual bool | isPrimalObjectiveLimitReached () const |
Is the given primal objective limit reached? More... | |
virtual bool | isDualObjectiveLimitReached () const |
Is the given dual objective limit reached? More... | |
virtual bool | isIterationLimitReached () const |
Iteration limit reached? More... | |
WarmStart related methods | |
virtual CoinWarmStart * | getEmptyWarmStart () const |
Get an empty warm start object. More... | |
virtual CoinWarmStart * | getWarmStart () const |
Get warmstarting information. More... | |
virtual bool | setWarmStart (const CoinWarmStart *warmstart) |
Set warmstarting information. More... | |
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.
| |
virtual void | markHotStart () |
Create a hotstart point of the optimization process. More... | |
virtual void | solveFromHotStart () |
Optimize starting from the hotstart. More... | |
virtual void | unmarkHotStart () |
Delete the snapshot. More... | |
Methods related to querying the input data | |
virtual int | getNumCols () const |
Get number of columns. More... | |
virtual int | getNumRows () const |
Get number of rows. More... | |
virtual CoinBigIndex | getNumElements () const |
Get number of nonzero elements. More... | |
virtual const double * | getColLower () const |
Get pointer to array[getNumCols()] of column lower bounds. More... | |
virtual const double * | getColUpper () const |
Get pointer to array[getNumCols()] of column upper bounds. More... | |
virtual const char * | getRowSense () const |
Get pointer to array[getNumRows()] of row constraint senses. More... | |
virtual const double * | getRightHandSide () const |
Get pointer to array[getNumRows()] of rows right-hand sides. More... | |
virtual const double * | getRowRange () const |
Get pointer to array[getNumRows()] of row ranges. More... | |
virtual const double * | getRowLower () const |
Get pointer to array[getNumRows()] of row lower bounds. More... | |
virtual const double * | getRowUpper () const |
Get pointer to array[getNumRows()] of row upper bounds. More... | |
virtual const double * | getObjCoefficients () const |
Get pointer to array[getNumCols()] of objective function coefficients. More... | |
virtual double | getObjSense () const |
Get objective function sense (1 for min (default), -1 for max) More... | |
virtual bool | isContinuous (int colNumber) const |
Return true if column is continuous. More... | |
virtual const CoinPackedMatrix * | getMatrixByRow () const |
Get pointer to row-wise copy of matrix. More... | |
virtual const CoinPackedMatrix * | getMatrixByCol () const |
Get pointer to column-wise copy of matrix. More... | |
virtual double | getInfinity () const |
Get solver's value for infinity. More... | |
Methods related to querying the solution | |
virtual const double * | getColSolution () const |
Get pointer to array[getNumCols()] of primal solution vector. More... | |
virtual const double * | getRowPrice () const |
Get pointer to array[getNumRows()] of dual prices. More... | |
virtual const double * | getReducedCost () const |
Get a pointer to array[getNumCols()] of reduced costs. More... | |
virtual const double * | getRowActivity () const |
Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vector. More... | |
virtual double | getObjValue () const |
Get objective function value. More... | |
virtual int | getIterationCount () const |
Get how many iterations it took to solve the problem (whatever "iteration" mean to the solver. More... | |
virtual std::vector< double * > | getDualRays (int maxNumRays, bool fullRay=false) const |
Get as many dual rays as the solver can provide. More... | |
virtual std::vector< double * > | getPrimalRays (int maxNumRays) const |
Get as many primal rays as the solver can provide. More... | |
Methods for row and column names. | |
Because OsiCbc is a pass-through class, it's necessary to override any virtual method in order to be sure we catch an override by the underlying solver. See the OsiSolverInterface class documentation for detailed descriptions. | |
virtual std::string | dfltRowColName (char rc, int ndx, unsigned digits=7) const |
Generate a standard name of the form Rnnnnnnn or Cnnnnnnn. More... | |
virtual std::string | getObjName (std::string::size_type maxLen=std::string::npos) const |
Return the name of the objective function. More... | |
virtual void | setObjName (std::string name) |
Set the name of the objective function. More... | |
virtual std::string | getRowName (int rowIndex, std::string::size_type maxLen=std::string::npos) const |
Return the name of the row. More... | |
virtual const OsiNameVec & | getRowNames () |
Return a pointer to a vector of row names. More... | |
virtual void | setRowName (int ndx, std::string name) |
Set a row name. More... | |
virtual void | setRowNames (OsiNameVec &srcNames, int srcStart, int len, int tgtStart) |
Set multiple row names. More... | |
virtual void | deleteRowNames (int tgtStart, int len) |
Delete len row names starting at index tgtStart. More... | |
virtual std::string | getColName (int colIndex, std::string::size_type maxLen=std::string::npos) const |
Return the name of the column. More... | |
virtual const OsiNameVec & | getColNames () |
Return a pointer to a vector of column names. More... | |
virtual void | setColName (int ndx, std::string name) |
Set a column name. More... | |
virtual void | setColNames (OsiNameVec &srcNames, int srcStart, int len, int tgtStart) |
Set multiple column names. More... | |
virtual void | deleteColNames (int tgtStart, int len) |
Delete len column names starting at index tgtStart. More... | |
Changing bounds on variables and constraints | |
virtual void | setObjCoeff (int elementIndex, double elementValue) |
Set an objective function coefficient. More... | |
virtual void | setColLower (int elementIndex, double elementValue) |
Set a single column lower bound Use -DBL_MAX for -infinity. More... | |
virtual void | setColUpper (int elementIndex, double elementValue) |
Set a single column upper bound Use DBL_MAX for infinity. More... | |
virtual void | setColBounds (int elementIndex, double lower, double upper) |
Set a single column lower and upper bound. More... | |
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. More... | |
virtual void | setRowLower (int elementIndex, double elementValue) |
Set a single row lower bound Use -DBL_MAX for -infinity. More... | |
virtual void | setRowUpper (int elementIndex, double elementValue) |
Set a single row upper bound Use DBL_MAX for infinity. More... | |
virtual void | setRowBounds (int elementIndex, double lower, double upper) |
Set a single row lower and upper bound. More... | |
virtual void | setRowType (int index, char sense, double rightHandSide, double range) |
Set the type of a single row More... | |
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. More... | |
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. More... | |
Integrality related changing methods | |
virtual void | setContinuous (int index) |
Set the index-th variable to be a continuous variable. More... | |
virtual void | setInteger (int index) |
Set the index-th variable to be an integer variable. More... | |
virtual void | setContinuous (const int *indices, int len) |
Set the variables listed in indices (which is of length len) to be continuous variables. More... | |
virtual void | setInteger (const int *indices, int len) |
Set the variables listed in indices (which is of length len) to be integer variables. More... | |
virtual void | setObjSense (double s) |
Set objective function sense (1 for min (default), -1 for max,) More... | |
virtual void | setColSolution (const double *colsol) |
Set the primal solution column values. More... | |
virtual void | setRowPrice (const double *rowprice) |
Set dual solution vector. More... | |
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) |
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. More... | |
virtual void | addCols (const int numcols, const CoinPackedVectorBase *const *cols, const double *collb, const double *colub, const double *obj) |
virtual void | deleteCols (const int num, const int *colIndices) |
virtual void | addRow (const CoinPackedVectorBase &vec, const double rowlb, const double rowub) |
virtual void | addRow (const CoinPackedVectorBase &vec, const char rowsen, const double rowrhs, const double rowrng) |
virtual void | addRows (const int numrows, const CoinPackedVectorBase *const *rows, const double *rowlb, const double *rowub) |
virtual void | addRows (const int numrows, const CoinPackedVectorBase *const *rows, const char *rowsen, const double *rowrhs, const double *rowrng) |
virtual void | deleteRows (const int num, const int *rowIndices) |
virtual void | applyRowCuts (int numberCuts, const OsiRowCut *cuts) |
Apply a collection of row cuts which are all effective. More... | |
virtual void | applyRowCuts (int numberCuts, const OsiRowCut **cuts) |
Apply a collection of row cuts which are all effective. More... | |
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). More... | |
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). More... | |
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). More... | |
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). More... | |
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). More... | |
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). More... | |
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) More... | |
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. More... | |
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. More... | |
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. More... | |
void | setLanguage (CoinMessages::Language language) |
Cbc specific public interfaces | |
CbcModel * | getModelPtr () const |
Get pointer to Cbc model. More... | |
OsiSolverInterface * | getRealSolverPtr () const |
Get pointer to underlying solver. More... | |
void | setCutoff (double value) |
Set cutoff bound on the objective function. More... | |
double | getCutoff () const |
Get the cutoff bound on the objective function - always as minimize. More... | |
void | setMaximumNodes (int value) |
Set the CbcModel::CbcMaxNumNode maximum node limit. More... | |
int | getMaximumNodes () const |
Get the CbcModel::CbcMaxNumNode maximum node limit. More... | |
void | setMaximumSolutions (int value) |
Set the CbcModel::CbcMaxNumSol maximum number of solutions. More... | |
int | getMaximumSolutions () const |
Get the CbcModel::CbcMaxNumSol maximum number of solutions. More... | |
void | setMaximumSeconds (double value) |
Set the CbcModel::CbcMaximumSeconds maximum number of seconds. More... | |
double | getMaximumSeconds () const |
Get the CbcModel::CbcMaximumSeconds maximum number of seconds. More... | |
bool | isNodeLimitReached () const |
Node limit reached? More... | |
bool | isSolutionLimitReached () const |
Solution limit reached? More... | |
int | getNodeCount () const |
Get how many Nodes it took to solve the problem. More... | |
int | status () const |
Final status of problem - 0 finished, 1 stopped, 2 difficulties. More... | |
virtual void | passInMessageHandler (CoinMessageHandler *handler) |
Pass in a message handler. More... | |
Constructors and destructors | |
OsiCbcSolverInterface (OsiSolverInterface *solver=NULL, CbcStrategy *strategy=NULL) | |
Default Constructor. More... | |
virtual OsiSolverInterface * | clone (bool copyData=true) const |
Clone. More... | |
OsiCbcSolverInterface (const OsiCbcSolverInterface &) | |
Copy constructor. More... | |
OsiCbcSolverInterface & | operator= (const OsiCbcSolverInterface &rhs) |
Assignment operator. More... | |
virtual | ~OsiCbcSolverInterface () |
Destructor. More... | |
Protected Member Functions | |
Protected methods | |
virtual void | applyRowCut (const OsiRowCut &rc) |
Apply a row cut (append to constraint matrix). More... | |
virtual void | applyColCut (const OsiColCut &cc) |
Apply a column cut (adjust one or more bounds). More... | |
Protected Attributes | |
Protected member data | |
CbcModel * | modelPtr_ |
Cbc model represented by this class instance. More... | |
Friends | |
void | OsiCbcSolverInterfaceUnitTest (const std::string &mpsDir, const std::string &netlibDir) |
A function that tests the methods in the OsiCbcSolverInterface class. More... | |
Cbc Solver Interface.
Instantiation of OsiCbcSolverInterface for the Model Algorithm.
Definition at line 30 of file OsiCbcSolverInterface.hpp.
OsiCbcSolverInterface::OsiCbcSolverInterface | ( | OsiSolverInterface * | solver = NULL , |
CbcStrategy * | strategy = NULL |
||
) |
Default Constructor.
OsiCbcSolverInterface::OsiCbcSolverInterface | ( | const OsiCbcSolverInterface & | ) |
Copy constructor.
|
virtual |
Destructor.
|
virtual |
Solve initial LP relaxation.
|
virtual |
Resolve an LP relaxation after problem modification.
|
virtual |
Invoke solver's built-in enumeration algorithm.
bool OsiCbcSolverInterface::setIntParam | ( | OsiIntParam | key, |
int | value | ||
) |
bool OsiCbcSolverInterface::setDblParam | ( | OsiDblParam | key, |
double | value | ||
) |
bool OsiCbcSolverInterface::setStrParam | ( | OsiStrParam | key, |
const std::string & | value | ||
) |
bool OsiCbcSolverInterface::getIntParam | ( | OsiIntParam | key, |
int & | value | ||
) | const |
bool OsiCbcSolverInterface::getDblParam | ( | OsiDblParam | key, |
double & | value | ||
) | const |
bool OsiCbcSolverInterface::getStrParam | ( | OsiStrParam | key, |
std::string & | value | ||
) | const |
|
virtual |
|
virtual |
Get a hint parameter.
|
virtual |
Get a hint parameter.
|
virtual |
Are there a numerical difficulties?
|
virtual |
Is optimality proven?
|
virtual |
Is primal infeasiblity proven?
|
virtual |
Is dual infeasiblity proven?
|
virtual |
Is the given primal objective limit reached?
|
virtual |
Is the given dual objective limit reached?
|
virtual |
Iteration limit reached?
|
virtual |
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.
|
virtual |
Get warmstarting information.
|
virtual |
Set warmstarting information.
Return true/false depending on whether the warmstart information was accepted or not.
|
virtual |
Create a hotstart point of the optimization process.
|
virtual |
Optimize starting from the hotstart.
|
virtual |
Delete the snapshot.
|
virtual |
Get number of columns.
|
virtual |
Get number of rows.
|
virtual |
Get number of nonzero elements.
|
virtual |
Get pointer to array[getNumCols()] of column lower bounds.
|
virtual |
Get pointer to array[getNumCols()] of column upper bounds.
|
virtual |
Get pointer to array[getNumRows()] of row constraint senses.
|
virtual |
Get pointer to array[getNumRows()] of rows right-hand sides.
|
virtual |
Get pointer to array[getNumRows()] of row ranges.
|
virtual |
Get pointer to array[getNumRows()] of row lower bounds.
|
virtual |
Get pointer to array[getNumRows()] of row upper bounds.
|
virtual |
Get pointer to array[getNumCols()] of objective function coefficients.
|
virtual |
Get objective function sense (1 for min (default), -1 for max)
|
virtual |
Return true if column is continuous.
|
virtual |
Get pointer to row-wise copy of matrix.
|
virtual |
Get pointer to column-wise copy of matrix.
|
virtual |
Get solver's value for infinity.
|
virtual |
Get pointer to array[getNumCols()] of primal solution vector.
|
virtual |
Get pointer to array[getNumRows()] of dual prices.
|
virtual |
Get a pointer to array[getNumCols()] of reduced costs.
|
virtual |
Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vector.
|
virtual |
Get objective function value.
|
virtual |
Get how many iterations it took to solve the problem (whatever "iteration" mean to the solver.
|
virtual |
Get as many dual rays as the solver can provide.
(In case of proven primal infeasibility there should be at least one.)
The first getNumRows() ray components will always be associated with the row duals (as returned by getRowPrice()). If fullRay
is true, the final getNumCols() entries will correspond to the ray components associated with the nonbasic variables. If the full ray is requested and the method cannot provide it, it will throw an exception.
NOTE for implementers of solver interfaces:
The double pointers in the vector should point to arrays of length getNumRows() and they should be allocated via new[].
NOTE for users of solver interfaces:
It is the user's responsibility to free the double pointers in the vector using delete[].
|
virtual |
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:
The double pointers in the vector should point to arrays of length getNumCols() and they should be allocated via new[].
NOTE for users of solver interfaces:
It is the user's responsibility to free the double pointers in the vector using delete[].
|
virtual |
Generate a standard name of the form Rnnnnnnn or Cnnnnnnn.
|
virtual |
Return the name of the objective function.
|
virtual |
Set the name of the objective function.
|
virtual |
Return the name of the row.
|
virtual |
Return a pointer to a vector of row names.
|
virtual |
Set a row name.
|
virtual |
Set multiple row names.
|
virtual |
Delete len row names starting at index tgtStart.
|
virtual |
Return the name of the column.
|
virtual |
Return a pointer to a vector of column names.
|
virtual |
Set a column name.
|
virtual |
Set multiple column names.
|
virtual |
Delete len column names starting at index tgtStart.
|
virtual |
Set an objective function coefficient.
|
virtual |
Set a single column lower bound
Use -DBL_MAX for -infinity.
|
virtual |
Set a single column upper bound
Use DBL_MAX for infinity.
|
virtual |
Set a single column lower and upper bound.
|
virtual |
Set the bounds on a number of columns simultaneously
The default implementation just invokes setColLower() and setColUpper() over and over again.
indexFirst,indexLast | pointers to the beginning and after the end of the array of the indices of the variables whose either bound changes |
boundList | the new lower/upper bound pairs for the variables |
|
virtual |
Set a single row lower bound
Use -DBL_MAX for -infinity.
|
virtual |
Set a single row upper bound
Use DBL_MAX for infinity.
|
virtual |
Set a single row lower and upper bound.
|
virtual |
Set the type of a single row
|
virtual |
Set the bounds on a number of rows simultaneously
The default implementation just invokes setRowLower() and setRowUpper() over and over again.
indexFirst,indexLast | pointers to the beginning and after the end of the array of the indices of the constraints whose either bound changes |
boundList | the new lower/upper bound pairs for the constraints |
|
virtual |
Set the type of a number of rows simultaneously
The default implementation just invokes setRowType() over and over again.
indexFirst,indexLast | pointers to the beginning and after the end of the array of the indices of the constraints whose any characteristics changes |
senseList | the new senses |
rhsList | the new right hand sides |
rangeList | the new ranges |
|
virtual |
Set the index-th variable to be a continuous variable.
|
virtual |
Set the index-th variable to be an integer variable.
|
virtual |
Set the variables listed in indices (which is of length len) to be continuous variables.
|
virtual |
Set the variables listed in indices (which is of length len) to be integer variables.
|
virtual |
Set objective function sense (1 for min (default), -1 for max,)
|
virtual |
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.
|
virtual |
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.
|
virtual |
|
virtual |
Add a column (primal variable) to the problem.
|
virtual |
|
virtual |
|
virtual |
|
virtual |
|
virtual |
|
virtual |
|
virtual |
|
virtual |
Apply a collection of row cuts which are all effective.
applyCuts seems to do one at a time which seems inefficient.
|
virtual |
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
|
virtual |
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:
colub
: all columns have upper bound infinity collb
: all columns have lower bound 0 rowub
: all rows have upper bound infinity rowlb
: all rows have lower bound -infinity obj
: all variables have 0 objective coefficient
|
virtual |
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.
WARNING: The arguments passed to this method will be freed using the C++ delete
and delete[]
functions.
|
virtual |
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:
colub
: all columns have upper bound infinity collb
: all columns have lower bound 0 obj
: all variables have 0 objective coefficient rowsen
: all rows are >= rowrhs
: all right hand sides are 0 rowrng
: 0 for the ranged rows
|
virtual |
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.
WARNING: The arguments passed to this method will be freed using the C++ delete
and delete[]
functions.
|
virtual |
Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps).
|
virtual |
Just like the other loadProblem() methods except that the matrix is given in a standard column major ordered format (without gaps).
|
virtual |
Read an mps file from the given filename (defaults to Osi reader) - returns number of errors (see OsiMpsReader class)
|
virtual |
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
|
virtual |
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
void OsiCbcSolverInterface::newLanguage | ( | CoinMessages::Language | language | ) |
Set language.
|
inline |
Definition at line 652 of file OsiCbcSolverInterface.hpp.
|
inline |
Get pointer to Cbc model.
Definition at line 662 of file OsiCbcSolverInterface.hpp.
|
inline |
Get pointer to underlying solver.
Definition at line 667 of file OsiCbcSolverInterface.hpp.
|
inline |
Set cutoff bound on the objective function.
Definition at line 672 of file OsiCbcSolverInterface.hpp.
|
inline |
Get the cutoff bound on the objective function - always as minimize.
Definition at line 677 of file OsiCbcSolverInterface.hpp.
|
inline |
Set the CbcModel::CbcMaxNumNode maximum node limit.
Definition at line 682 of file OsiCbcSolverInterface.hpp.
|
inline |
Get the CbcModel::CbcMaxNumNode maximum node limit.
Definition at line 687 of file OsiCbcSolverInterface.hpp.
|
inline |
Set the CbcModel::CbcMaxNumSol maximum number of solutions.
Definition at line 692 of file OsiCbcSolverInterface.hpp.
|
inline |
Get the CbcModel::CbcMaxNumSol maximum number of solutions.
Definition at line 697 of file OsiCbcSolverInterface.hpp.
|
inline |
Set the CbcModel::CbcMaximumSeconds maximum number of seconds.
Definition at line 702 of file OsiCbcSolverInterface.hpp.
|
inline |
Get the CbcModel::CbcMaximumSeconds maximum number of seconds.
Definition at line 707 of file OsiCbcSolverInterface.hpp.
|
inline |
Node limit reached?
Definition at line 712 of file OsiCbcSolverInterface.hpp.
|
inline |
Solution limit reached?
Definition at line 717 of file OsiCbcSolverInterface.hpp.
|
inline |
Get how many Nodes it took to solve the problem.
Definition at line 722 of file OsiCbcSolverInterface.hpp.
|
inline |
Final status of problem - 0 finished, 1 stopped, 2 difficulties.
Definition at line 727 of file OsiCbcSolverInterface.hpp.
|
virtual |
Pass in a message handler.
It is the client's responsibility to destroy a message handler installed by this routine; it will not be destroyed when the solver interface is destroyed.
|
virtual |
Clone.
OsiCbcSolverInterface& OsiCbcSolverInterface::operator= | ( | const OsiCbcSolverInterface & | rhs | ) |
Assignment operator.
|
protectedvirtual |
Apply a row cut (append to constraint matrix).
|
protectedvirtual |
Apply a column cut (adjust one or more bounds).
|
friend |
A function that tests the methods in the OsiCbcSolverInterface class.
|
mutableprotected |
Cbc model represented by this class instance.
Definition at line 781 of file OsiCbcSolverInterface.hpp.