Go to the documentation of this file.
11 #ifndef OsiMskSolverInterface_H
12 #define OsiMskSolverInterface_H
110 virtual bool setWarmStart(
const CoinWarmStart* warmstart);
205 virtual bool isBinary(
int columnNumber)
const;
212 virtual bool isInteger(
int columnNumber)
const;
270 virtual std::vector<double*>
getDualRays(
int maxNumRays,
271 bool fullRay=
false)
const;
283 virtual std::vector<double*>
getPrimalRays(
int maxNumRays)
const;
302 virtual void setObjCoeff(
int elementIndex,
double elementValue );
306 const int* indexLast,
307 const double* coeffList);
311 virtual void setColLower(
int elementIndex,
double elementValue );
315 virtual void setColUpper(
int elementIndex,
double elementValue );
321 double lower,
double upper );
331 const int* indexLast,
332 const double* boundList);
336 virtual void setRowLower(
int elementIndex,
double elementValue );
340 virtual void setRowUpper(
int elementIndex,
double elementValue );
346 double lower,
double upper );
349 virtual void setRowType(
int index,
char sense,
double rightHandSide,
360 const int* indexLast,
361 const double* boundList);
373 const int* indexLast,
374 const char* senseList,
375 const double* rhsList,
376 const double* rangeList);
391 virtual void setInteger(
const int* indices,
int len);
428 virtual void addCol(
const CoinPackedVectorBase& vec,
429 const double collb,
const double colub,
432 virtual void addCols(
const int numcols,
433 const CoinPackedVectorBase *
const * cols,
434 const double* collb,
const double* colub,
437 virtual void deleteCols(
const int num,
const int * colIndices);
440 virtual void addRow(
const CoinPackedVectorBase& vec,
441 const double rowlb,
const double rowub);
443 virtual void addRow(
const CoinPackedVectorBase& vec,
444 const char rowsen,
const double rowrhs,
445 const double rowrng);
447 virtual void addRows(
const int numrows,
448 const CoinPackedVectorBase *
const * rows,
449 const double* rowlb,
const double* rowub);
451 virtual void addRows(
const int numrows,
452 const CoinPackedVectorBase *
const * rows,
453 const char* rowsen,
const double* rowrhs,
454 const double* rowrng);
456 virtual void deleteRows(
const int num,
const int * rowIndices);
483 double effectivenessLb = 0.0);
503 virtual void loadProblem(
const CoinPackedMatrix& matrix,
504 const double* collb,
const double* colub,
506 const double* rowlb,
const double* rowub);
516 double*& collb,
double*& colub,
double*& obj,
517 double*& rowlb,
double*& rowub);
531 virtual void loadProblem(
const CoinPackedMatrix& matrix,
532 const double* collb,
const double* colub,
534 const char* rowsen,
const double* rowrhs,
535 const double* rowrng);
545 double*& collb,
double*& colub,
double*& obj,
546 char*& rowsen,
double*& rowrhs,
551 virtual void loadProblem(
const int numcols,
const int numrows,
552 const int* start,
const int* index,
554 const double* collb,
const double* colub,
556 const double* rowlb,
const double* rowub);
560 virtual void loadProblem(
const int numcols,
const int numrows,
561 const int* start,
const int* index,
563 const double* collb,
const double* colub,
565 const char* rowsen,
const double* rowrhs,
566 const double* rowrng);
569 virtual int readMps(
const char *filename,
570 const char *extension =
"mps");
576 virtual void writeMps(
const char *filename,
577 const char *extension =
"mps",
578 double objSense=0.0)
const;
777 mutable double *
obj_;
virtual void deleteCols(const int num, const int *colIndices)
Remove a set of columns (primal variables) from the problem.
virtual bool isDualObjectiveLimitReached() const
Is the given dual objective limit reached?
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
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()...
bool getStrParam(OsiStrParam key, std::string &value) const
Get a string parameter.
virtual int getIterationCount() const
Get how many iterations it took to solve the problem (whatever "iteration" mean to the solver.
virtual const double * getRowLower() const
Get pointer to array[getNumRows()] of row lower bounds.
virtual bool isBinary(int colIndex) const
Return true if the variable is binary.
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 setRowLowe...
CoinWarmStart * getEmptyWarmStart() const
Get an empty warm start object.
void OsiMskSolverInterfaceUnitTest(const std::string &mpsDir, const std::string &netlibDir)
A function that tests the methods in the OsiMskSolverInterface class.
virtual const double * getRightHandSide() const
Get pointer to array[getNumRows()] of rows right-hand sides.
virtual bool setWarmStart(const CoinWarmStart *warmstart)
Set warmstarting information.
void freeCachedRowRim()
free cached row rim vectors
virtual bool isProvenOptimal() const
Is optimality proven?
virtual const double * getRowUpper() const
Get pointer to array[getNumRows()] of row upper bounds.
double * colupper_
Pointer to dense vector of variable lower bounds.
char * rowsense_
Pointer to dense vector of row sense indicators.
virtual void setRowUpper(int elementIndex, double elementValue)
Set a single row upper bound Use COIN_DBL_MAX for infinity.
virtual bool isInteger(int colIndex) const
Return true if the variable is integer.
virtual std::vector< double * > getPrimalRays(int maxNumRays) const
Get as many primal rays as the solver can provide.
bool setStrParam(OsiStrParam key, const std::string &value)
Set a string parameter.
double * rowrange_
Pointer to dense vector of slack upper bounds for range constraints (undefined for non-range rows)
void switchToLP()
switches MOSEK to prob type LP
CoinPackedMatrix * matrixByRow_
Pointer to row-wise copy of problem matrix coefficients.
const char * getCtype() const
return a vector of variable types (continous, binary, integer)
@ FREECACHED_MATRIX
free only cached matrix and LP solution information
virtual bool isAbandoned() const
Are there a numerical difficulties?
virtual void initialSolve()
Solve initial LP relaxation.
double * rowact_
Pointer to row activity (slack) vector.
virtual const double * getRowRange() const
Get pointer to array[getNumRows()] of row ranges.
virtual const double * getColLower() const
Get pointer to array[getNumCols()] of column lower bounds.
virtual bool isFreeBinary(int colIndex) const
Return true if the variable is binary and not fixed.
virtual void setColUpper(int elementIndex, double elementValue)
Set a single column upper bound Use COIN_DBL_MAX for infinity.
virtual const double * getColSolution() const
Get pointer to array[getNumCols()] of primal solution vector.
static void decrementInstanceCounter()
MOSEK has a context which should be deleted after MOSEK calls.
virtual const CoinPackedMatrix * getMatrixByRow() const
Get pointer to row-wise copy of matrix.
Collections of row cuts and column cuts.
virtual const double * getRowPrice() const
Get pointer to array[getNumRows()] of dual prices.
bool setDblParam(OsiDblParam key, double value)
Set a double parameter.
virtual bool isProvenPrimalInfeasible() const
Is primal infeasiblity proven?
virtual void markHotStart()
Create a hotstart point of the optimization process.
bool definedSolution(int solution) const
bool probtypemip_
Stores whether MOSEK' prob type is currently set to MIP.
virtual void resolve()
Resolve an LP relaxation after problem modification.
keepCachedFlag
Get pointer to MOSEK model and free all specified cached data entries (combined with logical or-opera...
void freeAllMemory()
free all allocated memory
void freeCachedData(int keepCached=KEEPCACHED_NONE)
free all cached data (except specified entries, see getLpPtr())
virtual bool isIntegerNonBinary(int colIndex) const
Return true if the variable is general integer.
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 l...
bool getDblParam(OsiDblParam key, double &value) const
Get a double parameter.
static MSKenv_t env_
MOSEK environment pointer.
virtual int getNumElements() const
Get number of nonzero elements.
double * redcost_
Pointer to reduced cost vector.
virtual int readMps(const char *filename, const char *extension="mps")
Read an mps file from the given filename.
double * rowupper_
Pointer to dense vector of row upper bounds.
virtual bool isPrimalObjectiveLimitReached() const
Is the given primal objective limit reached?
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.
void resizeColType(int minsize)
resizes coltype_ vector to be able to store at least minsize elements
virtual bool isContinuous(int colNumber) const
Return true if column is continuous.
@ FREECACHED_RESULTS
free only cached LP solution information
virtual std::vector< double * > getDualRays(int maxNumRays, bool fullRay=false) const
Get as many dual rays as the solver can provide.
@ KEEPCACHED_NONE
discard all cached data (default)
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...
virtual int getNumRows() const
Get number of rows.
double * collower_
Pointer to dense vector of variable lower bounds.
char * coltype_
Pointer to dense vector of variable types (continous, binary, integer)
@ FREECACHED_COLUMN
free only cached column and LP solution information
int * hotStartCStat_
Hotstart information.
void gutsOfConstructor()
The real work of the constructor.
@ KEEPCACHED_PROBLEM
only discard cached LP solution
@ KEEPCACHED_MATRIX
problem matrix: matrix ordered by column and by row
bool setIntParam(OsiIntParam key, int value)
Set an integer parameter.
virtual const double * getReducedCost() const
Get a pointer to array[getNumCols()] of reduced costs.
virtual void addRow(const CoinPackedVectorBase &vec, const double rowlb, const double rowub)
Add a row (constraint) to the problem.
MSKenv_t getEnvironmentPtr()
Method to access MOSEK environment pointer.
virtual void setObjCoeffSet(const int *indexFirst, const int *indexLast, const double *coeffList)
Set a a set of objective function coefficients.
@ FREECACHED_ROW
free only cached row and LP solution information
virtual void setColBounds(int elementIndex, double lower, double upper)
Set a single column lower and upper bound The default implementation just invokes setColLower() and ...
std::vector< int > OsiVectorInt
Vector of int.
virtual int getNumCols() const
Get number of columns.
double * rhs_
Pointer to dense vector of row right-hand side values.
void freeCachedMatrix()
free cached matrices
virtual const double * getRowActivity() const
Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vecto...
virtual void setContinuous(int index)
Set the index-th variable to be a continuous variable.
OsiMskSolverInterface(MSKenv_t mskenv=NULL)
Default Constructor optional argument mskenv can be used to reach in an initialized user environment ...
virtual void addCol(const CoinPackedVectorBase &vec, const double collb, const double colub, const double obj)
Add a column (primal variable) to the problem.
virtual double getInfinity() const
Get solver's value for infinity.
void passInMessageHandler(CoinMessageHandler *handler)
Pass in a message handler It is the client's responsibility to destroy a message handler installed by...
double * colsol_
Pointer to primal solution vector.
virtual void setColSolution(const double *colsol)
Set the primal solution column values.
virtual void solveFromHotStart()
Optimize starting from the hotstart.
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 setColl...
double * rowlower_
Pointer to dense vector of row lower bounds.
virtual void branchAndBound()
Invoke solver's built-in enumeration algorithm.
virtual double getObjValue() const
Get objective function value.
virtual bool isIterationLimitReached() const
Iteration limit reached?
virtual void setColLower(int elementIndex, double elementValue)
Set a single column lower bound Use -COIN_DBL_MAX for -infinity.
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 CoinWarmStart * getWarmStart() const
Get warmstarting information.
static void incrementInstanceCounter()
MOSEK has a context which must be created prior to all other MOSEK calls.
virtual void unmarkHotStart()
Delete the snapshot.
void freeCachedResults()
free cached result vectors
@ KEEPCACHED_RESULTS
LP solution: primal and dual solution, reduced costs, row activities.
virtual const char * getRowSense() const
Get pointer to array[getNumRows()] of row constraint senses.
virtual void setRowBounds(int elementIndex, double lower, double upper)
Set a single row lower and upper bound The default implementation just invokes setRowLower() and set...
bool getIntParam(OsiIntParam key, int &value) const
Get an integer parameter.
virtual double getObjSense() const
Get objective function sense (1 for min (default), -1 for max)
void gutsOfCopy(const OsiMskSolverInterface &source)
The real work of a copy constructor (used by copy and assignment)
virtual const double * getColUpper() const
Get pointer to array[getNumCols()] of column upper bounds.
virtual bool isProvenDualInfeasible() const
Is dual infeasiblity proven?
@ KEEPCACHED_ROW
row information: right hand sides, ranges and senses, lower and upper bounds for row
virtual void setRowPrice(const double *rowprice)
Set dual solution vector.
virtual void setObjSense(double s)
Set objective function sense (1 for min (default), -1 for max,)
int hotStartMaxIteration_
virtual void applyColCut(const OsiColCut &cc)
Apply a column cut (bound adjustment).
virtual const double * getObjCoefficients() const
Get pointer to array[getNumCols()] of objective function coefficients.
virtual const CoinPackedMatrix * getMatrixByCol() const
Get pointer to column-wise copy of matrix.
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.
static unsigned int numInstances_
Number of live problem instances.
void freeCachedColRim()
free cached column rim vectors
virtual void deleteRows(const int num, const int *rowIndices)
Delete a set of rows (constraints) from the problem.
virtual void setInteger(int index)
Set the index-th variable to be an integer variable.
friend void OsiMskSolverInterfaceUnitTest(const std::string &mpsDir, const std::string &netlibDir)
A function that tests the methods in the OsiMskSolverInterface class.
double * rowsol_
Pointer to dual solution vector.
void freeColType()
frees colsize_ vector
virtual OsiVectorInt getFractionalIndices(const double etol=1.e-05) const
Get vector of indices of primal variables which are integer variables but have fractional values in t...
MSKtask_t getMutableLpPtr() const
Get task Pointer for const methods.
virtual void setObjCoeff(int elementIndex, double elementValue)
Set an objective function coefficient.
virtual void setRowType(int index, char sense, double rightHandSide, double range)
Set the type of a single row
virtual ApplyCutsReturnCode applyCuts(const OsiCuts &cs, double effectivenessLb=0.0)
Apply a collection of cuts.
int coltypesize_
Size of allocated memory for coltype_.
void switchToMIP()
switches MOSEK to prob type MIP
virtual void setRowLower(int elementIndex, double elementValue)
Set a single row lower bound Use -COIN_DBL_MAX for -infinity.
virtual void applyRowCut(const OsiRowCut &rc)
Apply a row cut. Return true if cut was applied.
@ KEEPCACHED_ALL
keep all cached data (similar to getMutableLpPtr())
MSKtask_t task_
MOSEK model represented by this class instance.
int getRescode() const
Get rescode return of last Mosek optimizer call.
CoinPackedMatrix * matrixByCol_
Pointer to row-wise copy of problem matrix coefficients.
OsiMskSolverInterface & operator=(const OsiMskSolverInterface &rhs)
Assignment operator.
Abstract Base Class for describing an interface to a solver.
virtual bool isLicenseError() const
Has there been a license problem?
static unsigned int getNumInstances()
Return the number of instances of instantiated objects using MOSEK services.
@ KEEPCACHED_COLUMN
column information: objective values, lower and upper bounds, variable types
double * obj_
Pointer to objective vector.
virtual ~OsiMskSolverInterface()
Destructor.
MSKtask_t getLpPtr(int keepCached=KEEPCACHED_NONE)
void gutsOfDestructor()
The real work of the destructor.