OsiGlpkSolverInterface Class Reference

GPLK Solver Interface. More...

#include <OsiGlpkSolverInterface.hpp>

Inheritance diagram for OsiGlpkSolverInterface:

[legend]

Collaboration diagram for OsiGlpkSolverInterface:

[legend]

List of all members.

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 volume 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)
	We should be able to get an integer tolerance.
bool	setDblParam (OsiDblParam key, double value)
	We should be able to get an integer tolerance.
bool	setStrParam (OsiStrParam key, const std::string &value)
	We should be able to get an integer tolerance.
bool	setHintParam (OsiHintParam key, bool sense=true, OsiHintStrength strength=OsiHintTry, void *info=0)
	We should be able to get an integer tolerance.
bool	getIntParam (OsiIntParam key, int &value) const
	We should be able to get an integer tolerance.
bool	getDblParam (OsiDblParam key, double &value) const
	We should be able to get an integer tolerance.
bool	getStrParam (OsiStrParam key, std::string &value) const
	We should be able to get an integer tolerance.
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?
virtual bool	isTimeLimitReached () const
	Time limit reached?
virtual bool	isFeasible () const
	(Integer) Feasible solution found?
WarmStart related methods

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 The default implementation just invokes setColLower() and setColUpper().
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 The default implementation just invokes setRowLower() and setRowUpper().
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	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 row (constraint) to the problem.
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)
	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.
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 int 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 int 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.
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.
Methods for row and column names.
Only the set methods need to be overridden to ensure consistent names between OsiGlpk and the OSI base class.
void	setObjName (std::string name)
	Set the objective function name.
void	setRowName (int ndx, std::string name)
	Set a row name.
void	setColName (int ndx, std::string name)
	Set a column name.
Constructors and destructor

	OsiGlpkSolverInterface ()
	Default Constructor.
virtual OsiSolverInterface *	clone (bool copyData=true) const
	Clone.
	OsiGlpkSolverInterface (const OsiGlpkSolverInterface &)
	Copy constructor.
OsiGlpkSolverInterface &	operator= (const OsiGlpkSolverInterface &rhs)
	Assignment operator.
virtual	~OsiGlpkSolverInterface ()
	Destructor.
virtual void	reset ()
	Resets as if default constructor.
Protected Member Functions
Protected methods

virtual void	applyRowCut (const OsiRowCut &rc)
	Apply a row cut. Return true if cut was applied.
virtual void	applyColCut (const OsiColCut &cc)
	Apply a column cut (bound adjustment).
LPX *	getMutableModelPtr () const
	Pointer to the model.
Private Member Functions
Private methods

void	gutsOfCopy (const OsiGlpkSolverInterface &source)
	The real work of a copy constructor (used by copy and assignment).
void	gutsOfConstructor ()
	The real work of the constructor.
void	gutsOfDestructor ()
	The real work of the destructor.
void	freeCachedColRim ()
	free cached column rim vectors
void	freeCachedRowRim ()
	free cached row rim vectors
void	freeCachedResults ()
	free cached result vectors
void	freeCachedMatrix ()
	free cached matrices
void	freeCachedData (int keepCached=KEEPCACHED_NONE)
	free all cached data (except specified entries, see getLpPtr())
void	freeAllMemory ()
	free all allocated memory
void	printBounds ()
	Just for testing purposes.
void	fillColBounds () const
	Fill cached collumn bounds.
Private Attributes
Private member data

LPX *	lp_
	GPLK model represented by this class instance.
int	bbWasLast_
	GPLK model represented by this class instance.
int	maxIteration_
	simplex iteration limit (per call to solver)
int	hotStartMaxIteration_
	simplex iteration limit (for hot start)
int	nameDisc_
	OSI name discipline.
double	dualObjectiveLimit_
	dual objective limit (measure of badness; stop if we're worse)
double	primalObjectiveLimit_
	primal objective limit (measure of goodness; stop if we're better)
double	dualTolerance_
	dual feasibility tolerance
double	primalTolerance_
	primal feasibility tolerance
double	objOffset_
	constant offset for objective function
std::string	probName_
	Problem name.
void *	info_ [OsiLastHintParam]
	Array for info blocks associated with hints.
int	hotStartCStatSize_
	Hotstart information.
int *	hotStartCStat_
	column status array
double *	hotStartCVal_
	primal variable values
double *	hotStartCDualVal_
	dual variable values
int	hotStartRStatSize_
	size of row status and value arrays
int *	hotStartRStat_
	row status array
double *	hotStartRVal_
	row slack values
double *	hotStartRDualVal_
	row dual values
bool	isIterationLimitReached_
	glpk stopped on iteration limit
bool	isTimeLimitReached_
	glpk stopped on time limit
bool	isAbandoned_
	glpk abandoned the problem
bool	isObjLowerLimitReached_
	glpk stopped on lower objective limit
bool	isObjUpperLimitReached_
	glpk stopped on upper objective limit
bool	isPrimInfeasible_
	glpk declared the problem primal infeasible
bool	isDualInfeasible_
	glpk declared the problem dual infeasible
bool	isFeasible_
	glpk declared the problem feasible
Cached information derived from the GLPK model

int	iter_used_
	Number of iterations.
double *	obj_
	Pointer to objective vector.
double *	collower_
	Pointer to dense vector of variable lower bounds.
double *	colupper_
	Pointer to dense vector of variable lower bounds.
char *	ctype_
	Pointer to dense vector of variable types (continous, binary, integer).
char *	rowsense_
	Pointer to dense vector of row sense indicators.
double *	rhs_
	Pointer to dense vector of row right-hand side values.
double *	rowrange_
	Pointer to dense vector of slack upper bounds for range constraints (undefined for non-range rows).
double *	rowlower_
	Pointer to dense vector of row lower bounds.
double *	rowupper_
	Pointer to dense vector of row upper bounds.
double *	colsol_
	Pointer to primal solution vector.
double *	rowsol_
	Pointer to dual solution vector.
double *	redcost_
	Pointer to reduced cost vector.
double *	rowact_
	Pointer to row activity (slack) vector.
CoinPackedMatrix *	matrixByRow_
	Pointer to row-wise copy of problem matrix coefficients.
CoinPackedMatrix *	matrixByCol_
	Pointer to row-wise copy of problem matrix coefficients.
Friends
void	OsiGlpkSolverInterfaceUnitTest (const std::string &mpsDir, const std::string &netlibDir)
	A function that tests the methods in the OsiGlpkSolverInterface class.
GLPK specific public interfaces

enum	keepCachedFlag { KEEPCACHED_NONE = 0, KEEPCACHED_COLUMN = 1, KEEPCACHED_ROW = 2, KEEPCACHED_MATRIX = 4, KEEPCACHED_RESULTS = 8, KEEPCACHED_PROBLEM = KEEPCACHED_COLUMN \| KEEPCACHED_ROW \| KEEPCACHED_MATRIX, KEEPCACHED_ALL = KEEPCACHED_PROBLEM \| KEEPCACHED_RESULTS, FREECACHED_COLUMN = KEEPCACHED_PROBLEM & ~KEEPCACHED_COLUMN, FREECACHED_ROW = KEEPCACHED_PROBLEM & ~KEEPCACHED_ROW, FREECACHED_MATRIX = KEEPCACHED_PROBLEM & ~KEEPCACHED_MATRIX, FREECACHED_RESULTS = KEEPCACHED_ALL & ~KEEPCACHED_RESULTS }
	Get pointer to GLPK model. More...
LPX *	getModelPtr ()
	Get pointer to GLPK model.

Detailed Description

GPLK Solver Interface.

Instantiation of OsiGlpkSolverInterface for GPLK

Definition at line 25 of file OsiGlpkSolverInterface.hpp.

Member Enumeration Documentation

enum OsiGlpkSolverInterface::keepCachedFlag

Get pointer to GLPK model.

Enumerator:

KEEPCACHED_NONE	discard all cached data (default)
KEEPCACHED_COLUMN	column information: objective values, lower and upper bounds, variable types
KEEPCACHED_ROW	row information: right hand sides, ranges and senses, lower and upper bounds for row
KEEPCACHED_MATRIX	problem matrix: matrix ordered by column and by row
KEEPCACHED_RESULTS	LP solution: primal and dual solution, reduced costs, row activities.
KEEPCACHED_PROBLEM	only discard cached LP solution
KEEPCACHED_ALL	keep all cached data (similar to getMutableLpPtr())
FREECACHED_COLUMN	free only cached column and LP solution information
FREECACHED_ROW	free only cached row and LP solution information
FREECACHED_MATRIX	free only cached matrix and LP solution information
FREECACHED_RESULTS	free only cached LP solution information

Definition at line 619 of file OsiGlpkSolverInterface.hpp.

Constructor & Destructor Documentation

OsiGlpkSolverInterface::OsiGlpkSolverInterface ( )

Default Constructor.

OsiGlpkSolverInterface::OsiGlpkSolverInterface ( const OsiGlpkSolverInterface & )

Copy constructor.

virtual OsiGlpkSolverInterface::~OsiGlpkSolverInterface ( ) [virtual]

Destructor.

Member Function Documentation

virtual void OsiGlpkSolverInterface::initialSolve ( ) [virtual]

Solve initial LP relaxation.

Implements OsiSolverInterface.

virtual void OsiGlpkSolverInterface::resolve ( ) [virtual]

Resolve an LP relaxation after problem modification.

Implements OsiSolverInterface.

virtual void OsiGlpkSolverInterface::branchAndBound ( ) [virtual]

Invoke solver's built-in enumeration algorithm.

Implements OsiSolverInterface.

bool OsiGlpkSolverInterface::setIntParam	(	OsiIntParam	key,
		int	value
	)			`[virtual]`