6#ifndef OsiClpSolverInterface_H
7#define OsiClpSolverInterface_H
15#include "CoinPackedMatrix.hpp"
16#include "OsiSolverInterface.hpp"
17#include "CoinWarmStartBasis.hpp"
20#include "CoinIndexedVector.hpp"
21#include "CoinFinite.hpp"
24class OsiClpUserSolver;
134 const double *c)
const;
137 virtual void getBInvARow(
int row,
double *z,
double *slack = NULL)
const;
143 virtual void getBInvARow(
int row, CoinIndexedVector *z, CoinIndexedVector *slack = NULL,
144 bool keepScaled =
false)
const;
188 virtual int pivot(
int colIn,
int colOut,
int outStatus);
202 int &colOut,
int &outStatus,
203 double &t, CoinPackedVector *dx);
212 int colOut,
int outStatus,
213 double &t, CoinPackedVector *dx);
246 OsiHintStrength strength = OsiHintTry,
247 void *otherInformation = NULL);
340 OsiRowCut *
smallModelCut(
const double *originalLower,
const double *originalUpper,
341 int numberRowsAtContinuous,
const int *whichGenerator,
346 OsiRowCut *
modelCut(
const double *originalLower,
const double *originalUpper,
347 int numberRowsAtContinuous,
const int *whichGenerator,
381 CoinBigIndex retVal = 0;
384 retVal = matrix->getNumElements();
391 unsigned maxLen =
static_cast< unsigned >(std::string::npos))
const;
396 unsigned maxLen =
static_cast< unsigned >(std::string::npos))
const;
558 bool fullRay =
false)
const;
595 double lower,
double upper);
606 const int *indexLast,
607 const double *boundList);
619 double lower,
double upper);
622 virtual void setRowType(
int index,
char sense,
double rightHandSide,
634 const int *indexLast,
635 const double *boundList);
648 const int *indexLast,
649 const char *senseList,
650 const double *rhsList,
651 const double *rangeList);
758 virtual void addCol(
const CoinPackedVectorBase &vec,
759 const double collb,
const double colub,
763 virtual void addCol(
const CoinPackedVectorBase &vec,
764 const double collb,
const double colub,
765 const double obj, std::string name);
767 virtual void addCol(
int numberElements,
const int *rows,
const double *elements,
768 const double collb,
const double colub,
773 const int *rows,
const double *elements,
774 const double collb,
const double colub,
775 const double obj, std::string name);
778 const CoinPackedVectorBase *
const *cols,
779 const double *collb,
const double *colub,
783 const CoinBigIndex *columnStarts,
const int *rows,
const double *elements,
784 const double *collb,
const double *colub,
787 virtual void deleteCols(
const int num,
const int *colIndices);
790 virtual void addRow(
const CoinPackedVectorBase &vec,
791 const double rowlb,
const double rowub);
798 virtual void addRow(
const CoinPackedVectorBase &vec,
799 const double rowlb,
const double rowub,
801 virtual void addRow(
const CoinPackedVectorBase &vec,
802 const char rowsen,
const double rowrhs,
803 const double rowrng);
805 virtual void addRow(
int numberElements,
const int *columns,
const double *element,
806 const double rowlb,
const double rowub);
809 virtual void addRow(
const CoinPackedVectorBase &vec,
810 const char rowsen,
const double rowrhs,
811 const double rowrng, std::string name);
814 const CoinPackedVectorBase *
const *rows,
815 const double *rowlb,
const double *rowub);
818 const CoinPackedVectorBase *
const *rows,
819 const char *rowsen,
const double *rowrhs,
820 const double *rowrng);
824 const CoinBigIndex *rowStarts,
const int *columns,
const double *element,
825 const double *rowlb,
const double *rowub);
828 bool keepZero =
false)
834 virtual void deleteRows(
const int num,
const int *rowIndices);
875 virtual ApplyCutsReturnCode
applyCuts(
const OsiCuts &cs,
876 double effectivenessLb = 0.0);
898 const double *collb,
const double *colub,
900 const double *rowlb,
const double *rowub);
910 double *&collb,
double *&colub,
double *&obj,
911 double *&rowlb,
double *&rowub);
926 const double *collb,
const double *colub,
928 const char *rowsen,
const double *rowrhs,
929 const double *rowrng);
939 double *&collb,
double *&colub,
double *&obj,
940 char *&rowsen,
double *&rowrhs,
946 const double *collb,
const double *colub,
948 const double *rowlb,
const double *rowub);
953 const CoinBigIndex *start,
const int *index,
955 const double *collb,
const double *colub,
957 const double *rowlb,
const double *rowub);
962 const CoinBigIndex *start,
const int *index,
964 const double *collb,
const double *colub,
966 const char *rowsen,
const double *rowrhs,
967 const double *rowrng);
974 const char *extension =
"mps");
977 int readMps(
const char *filename,
bool keepNames,
bool allowErrors);
979 virtual int readMps(
const char *filename,
const char *extension,
980 int &numberSets, CoinSet **&sets);
987 const char *extension =
"mps",
988 double objSense = 0.0)
const;
998 const char **rowNames,
const char **columnNames,
999 int formatType = 0,
int numberAcross = 2,
1000 double objSense = 0.0)
const;
1002 virtual int readLp(
const char *filename,
const double epsilon = 1e-5);
1009 const char *extension =
"lp",
1010 double epsilon = 1e-5,
1011 int numberAcross = 10,
1013 double objSense = 0.0,
1014 bool useRowNames =
true)
const;
1020 double epsilon = 1e-5,
1021 int numberAcross = 10,
1023 double objSense = 0.0,
1024 bool useRowNames =
true)
const;
1285 const int *indices,
const double *elements);
1299 CoinWarmStartBasis *
getBasis(
const unsigned char *statusArray)
const;
1318 const int *start,
const int *indices,
const double *weights = NULL);
1366 mutable CoinWarmStartBasis *
ws_;
#define OsiSolverInterface
static const double OsiClpInfinity
void OsiClpSolverInterfaceUnitTest(const std::string &mpsDir, const std::string &netlibDir)
A function that tests the methods in the OsiClpSolverInterface class.
This is a tiny class where data can be saved round calls.
Base class for Clp disaster handling.
This just implements CoinFactorization when an ClpMatrixBase object is passed.
Abstract base class for Clp Matrices.
double * columnUpper() const
Column Upper.
void modifyCoefficient(int row, int column, double newElement, bool keepZero=false)
Modify one element of a matrix.
double optimizationDirection() const
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore.
double * rowLower() const
Row lower.
double * objective() const
Objective.
int numberColumns() const
int numberRows() const
Number of rows.
CoinPackedMatrix * matrix() const
Matrix (if not ClpPackedmatrix be careful about memory leak.
void setOptimizationDirection(double value)
double * columnLower() const
Column Lower.
int numberIterations() const
Number of iterations.
double * rowUpper() const
Row upper.
This solves LPs using the simplex method.
Status
enums for status of various sorts.
This is a very simple class to guide algorithms.
void setWhereFrom(int value)
Set where from.
int whereFrom() const
Get where from.
virtual ~OsiClpDisasterHandler()
Destructor.
bool inTrouble_
Are we in trouble.
bool inTrouble() const
are we in trouble
OsiClpDisasterHandler(const OsiClpDisasterHandler &)
virtual void intoSimplex()
Into simplex.
virtual void saveInfo()
saves information for next attempt
OsiClpSolverInterface * osiModel_
Pointer to model.
int phase_
phase 0 initial 1 trying continuing with back in and maybe different perturb 2 trying continuing with...
OsiClpSolverInterface * osiModel() const
Get model.
int whereFrom_
Where from 0 dual (resolve) 1 crunch 2 primal (resolve) 4 dual (initialSolve) 6 primal (initialSolve)
int phase() const
Get phase.
OsiClpDisasterHandler & operator=(const OsiClpDisasterHandler &)
virtual bool check() const
Checks if disaster.
OsiClpDisasterHandler(OsiClpSolverInterface *model=NULL)
Default constructor.
void setOsiModel(OsiClpSolverInterface *model)
set model.
virtual int typeOfDisaster()
Type of disaster 0 can fix, 1 abort.
virtual ClpDisasterHandler * clone() const
Clone.
void setPhase(int value)
Set phase.
double * linearObjective_
Linear objective.
void setFakeObjective(ClpLinearObjective *fakeObjective)
Set fake objective (and take ownership)
ClpSimplex * swapModelPtr(ClpSimplex *newModel)
Set pointer to Clp model and return old.
void lexSolve()
Sort of lexicographic resolve.
void crunch()
Crunch down problem a bit.
virtual void addRows(const int numrows, const CoinPackedVectorBase *const *rows, const char *rowsen, const double *rowrhs, const double *rowrng)
virtual bool isProvenDualInfeasible() const
Is dual infeasiblity proven?
int infeasibleOtherWay(char *whichWay)
See if any integer variables make infeasible other way.
CoinDoubleArrayWithLength rowScale_
Row scale factors (has inverse at end)
virtual CoinBigIndex getSizeL() const
Return number of entries in L part of current factorization.
virtual int tightenBounds(int lightweight=0)
Tighten bounds - lightweight or very lightweight 0 - normal, 1 lightweight but just integers,...
char * spareArrays_
Arrays for hot starts.
void setFakeObjective(double *fakeObjective)
Set fake objective.
virtual void getBInvRow(int row, double *z) const
Get a row of the basis inverse.
int lastAlgorithm_
Last algorithm used.
virtual void setRowPrice(const double *rowprice)
Set dual solution vector.
virtual void setRowUpper(int elementIndex, double elementValue)
Set a single row upper bound Use DBL_MAX for infinity.
virtual const char * getColType(bool refresh=false) const
Return array of column length 0 - continuous 1 - binary (may get fixed later) 2 - general integer (ma...
virtual CoinBigIndex getSizeU() const
Return number of entries in U part of current factorization.
virtual void replaceMatrixOptional(const CoinPackedMatrix &matrix)
I (JJF) am getting annoyed because I can't just replace a matrix.
virtual void addRow(const CoinPackedVectorBase &vec, const char rowsen, const double rowrhs, const double rowrng, std::string name)
Add a named row (constraint) to the problem.
virtual void enableFactorization() const
Enables simplex mode 1 (tableau access)
ClpSimplex * getContinuousModel() const
Get continuous model.
virtual bool isIterationLimitReached() const
Iteration limit reached?
void redoScaleFactors(int numberRows, const CoinBigIndex *starts, const int *indices, const double *elements)
Extend scale factors.
virtual ~OsiClpSolverInterface()
Destructor.
virtual void replaceMatrix(const CoinPackedMatrix &matrix)
And if it does matter (not used at present)
virtual bool isFreeBinary(int colIndex) const
Return true if variable is binary and not fixed at either bound.
ClpSimplex * getModelPtr() const
Get pointer to Clp model.
void releaseClp()
Releases so won't error.
virtual void addRow(const CoinPackedVectorBase &vec, const double rowlb, const double rowub, std::string name)
Add a named row (constraint) to the problem.
ClpLinearObjective * fakeObjective_
Fake objective.
virtual ApplyCutsReturnCode applyCuts(const OsiCuts &cs, double effectivenessLb=0.0)
Apply a collection of cuts.
virtual int readMps(const char *filename, const char *extension, int &numberSets, CoinSet **&sets)
Read an mps file.
virtual void setRowLower(int elementIndex, double elementValue)
Set a single row lower bound Use -DBL_MAX for -infinity.
virtual void solveFromHotStart()
Optimize starting from the hotstart.
virtual void addRows(const int numrows, const CoinBigIndex *rowStarts, const int *columns, const double *element, const double *rowlb, const double *rowub)
virtual CoinWarmStart * getEmptyWarmStart() const
Get an empty warm start object.
double * rowrange_
Pointer to dense vector of slack upper bounds for range constraints (undefined for non-range rows)
virtual void getBasics(int *index) const
Get basic indices (order of indices corresponds to the order of elements in a vector retured by getBI...
void setBasis(const CoinWarmStartBasis &basis)
Sets up working basis as a copy of input and puts in as basis.
virtual const double * getRowLower() const
Get pointer to array[getNumRows()] of row lower bounds.
virtual bool isPrimalObjectiveLimitReached() const
Is the given primal objective limit reached?
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 void markHotStart()
Create a hotstart point of the optimization process.
virtual int findIntegersAndSOS(bool justCount)
Identify integer variables and SOS and create corresponding objects.
virtual const double * getRowActivity() const
Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vecto...
virtual void getBInvARow(int row, CoinIndexedVector *z, CoinIndexedVector *slack=NULL, bool keepScaled=false) const
Get a row of the tableau (slack part in slack if not NULL) If keepScaled is true then scale factors n...
double * rowActivity_
also save row and column information for hot starts only used in hotstarts so can be casual
virtual void saveBaseModel()
If solver wants it can save a copy of "base" (continuous) model here.
virtual const char * getRowSense() const
Get pointer to array[getNumRows()] of row constraint senses.
void setLogLevel(int value)
Set log level (will also set underlying solver's log level)
void passInDisasterHandler(OsiClpDisasterHandler *handler)
Pass in disaster handler.
virtual void getBInvACol(int col, double *vec) const
Get a column of the tableau.
virtual void disableSimplexInterface()
Undo setting changes made by enableSimplexInterface.
virtual void setContinuous(const int *indices, int len)
Set the variables listed in indices (which is of length len) to be continuous variables.
OsiClpSolverInterface(const OsiClpSolverInterface &)
Copy constructor.
const CoinSet * setInfo() const
SOS set info.
bool setStrParam(OsiStrParam key, const std::string &value)
virtual int pivot(int colIn, int colOut, int outStatus)
Perform a pivot by substituting a colIn for colOut in the basis.
void freeCachedResults() const
Deletes all mutable stuff.
double largestAway_
Largest amount continuous away from bound.
OsiClpSolverInterface & operator=(const OsiClpSolverInterface &rhs)
Assignment operator.
virtual void applyColCut(const OsiColCut &cc)
Apply a column cut (adjust one or more bounds).
virtual void deleteRows(const int num, const int *rowIndices)
virtual void disableFactorization() const
Undo any setting changes made by enableFactorization.
virtual void deleteCols(const int num, const int *colIndices)
virtual int getNumCols() const
Get number of columns.
void setContinuousModel(ClpSimplex *model)
Set continuous model.
virtual void resolveGub(int needed)
Resolve an LP relaxation after problem modification (try GUB)
virtual bool setWarmStart(const CoinWarmStart *warmstart)
Set warmstarting information.
virtual void setRowName(int rowIndex, std::string name)
Set name of row.
virtual std::vector< double * > getDualRays(int maxNumRays, bool fullRay=false) const
Get as many dual rays as the solver can provide.
virtual double getObjSense() const
Get objective function sense (1 for min (default), -1 for max)
virtual const double * getRowUpper() const
Get pointer to array[getNumRows()] of row upper bounds.
void setLargestAway(double value)
Set largest amount continuous away from bound.
virtual bool isProvenPrimalInfeasible() const
Is primal infeasiblity proven?
ClpFactorization * factorization_
factorization for hot starts
virtual int canDoSimplexInterface() const
Simplex API capability.
virtual void getBInvACol(int col, CoinIndexedVector *vec) const
Get a column of the tableau.
ClpSimplex * baseModel_
Copy of model when option 131072 set.
virtual bool isDualObjectiveLimitReached() const
Is the given dual objective limit reached?
virtual void setContinuous(int index)
Set the index-th variable to be a continuous variable.
void setSpecialOptionsMutable(unsigned int value) const
Set special options in underlying clp solver.
virtual const double * getColLower() const
Get pointer to array[getNumCols()] of column lower bounds.
virtual void addRows(const int numrows, const CoinPackedVectorBase *const *rows, const double *rowlb, const double *rowub)
void extractSenseRhsRange() const
A method that fills up the rowsense_, rhs_ and rowrange_ arrays.
virtual void branchAndBound()
Invoke solver's built-in enumeration algorithm.
virtual const double * getRowRange() const
Get pointer to array[getNumRows()] of row ranges.
int itlimOrig_
The original iteration limit before hotstarts started.
virtual int setBasisStatus(const int *cstat, const int *rstat)
Set the status of structural/artificial variables and factorize, update solution etc.
virtual OsiSolverInterface * clone(bool copyData=true) const
Clone.
double smallestChangeInCut() const
Get smallest change in cut.
ClpLinearObjective * fakeObjective() const
Get fake objective.
virtual void setInteger(const int *indices, int len)
Set the variables listed in indices (which is of length len) to be integer variables.
virtual double getInfinity() const
Get solver's value for infinity.
void modifyCoefficient(int row, int column, double newElement, bool keepZero=false)
virtual void initialSolve()
Solve initial LP relaxation.
void freeCachedResults0() const
Deletes all mutable stuff for row ranges etc.
virtual bool isProvenOptimal() const
Is optimality proven?
virtual void setObjSense(double s)
Set objective function sense (1 for min (default), -1 for max,)
virtual void applyRowCuts(int numberCuts, const OsiRowCut **cuts)
Apply a collection of row cuts which are all effective.
void replaceSetInfo(int numberSOS, CoinSet *setInfo)
Replace setInfo (takes over ownership)
ClpNodeStuff stuff_
Stuff for fast dual.
OsiClpSolverInterface()
Default Constructor.
virtual void applyRowCuts(int numberCuts, const OsiRowCut *cuts)
Apply a collection of row cuts which are all effective.
virtual void addRow(int numberElements, const int *columns, const double *element, const double rowlb, const double rowub)
Add a row (constraint) to the problem.
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 setRowLowe...
virtual void setColName(int colIndex, std::string name)
Set name of column.
void generateCpp(FILE *fp)
Create C++ lines to get to current state.
bool notOwned_
To say if destructor should delete underlying model.
double * rhs_
Pointer to dense vector of row right-hand side values.
virtual int getIterationCount() const
Get how many iterations it took to solve the problem (whatever "iteration" mean to the solver.
virtual void enableSimplexInterface(bool doingPrimal)
Enables simplex mode 2 (individual pivot control)
virtual bool isAbandoned() const
Are there a numerical difficulties?
void stopFastDual()
Stop fast dual.
CoinSet * setInfo_
SOS set info.
virtual void setObjective(const double *array)
Set the objective coefficients for all columns array [getNumCols()] is an array of values for the obj...
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 Osi...
virtual void synchronizeModel()
Synchronize model (really if no cuts in tree)
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()...
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 ...
virtual void setColLower(const double *array)
Set the lower bounds for all columns array [getNumCols()] is an array of values for the objective.
ClpSolve solveOptions_
Options for initialSolve.
OsiClpDisasterHandler * disasterHandler_
Possible disaster handler.
virtual void resolve()
Resolve an LP relaxation after problem modification.
friend void OsiClpSolverInterfaceUnitTest(const std::string &mpsDir, const std::string &netlibDir)
A function that tests the methods in the OsiClpSolverInterface class.
virtual bool setHintParam(OsiHintParam key, bool yesNo=true, OsiHintStrength strength=OsiHintTry, void *otherInformation=NULL)
void crossover(int options, int basis)
Solve when primal column and dual row solutions are near-optimal options - 0 no presolve (use primal ...
int integerType(int colIndex) const
Return integer type (0,1,2=optional,3=sc,4=scint)
void newLanguage(CoinMessages::Language language)
Set language.
virtual void setColUpper(const double *array)
Set the upper bounds for all columns array [getNumCols()] is an array of values for the objective.
const CoinWarmStartBasis * getConstPointerToWarmStart() const
Get warmstarting information.
virtual const CoinPackedMatrix * getMatrixByCol() const
Get pointer to column-wise copy of matrix.
unsigned int specialOptions() const
Get special options.
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...
virtual const double * getObjCoefficients() const
Get pointer to array[getNumCols()] of objective function coefficients.
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 ...
virtual void setColSolution(const double *colsol)
Set the primal solution column values.
unsigned int specialOptions_
Special options 0x80000000 off 0 simple stuff for branch and bound 1 try and keep work regions as muc...
virtual void unmarkHotStart()
Delete the snapshot.
virtual bool isIntegerNonBinary(int colIndex) const
Return true if variable is general integer.
void freeCachedResults1() const
Deletes all mutable stuff for matrix etc.
virtual CoinWarmStart * getPointerToWarmStart(bool &mustDelete)
Get warm start information.
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 s...
const OsiClpDisasterHandler * disasterHandler() const
Get disaster handler.
void deleteScaleFactors()
Delete all scale factor stuff and reset option.
void computeLargestAway()
Compute largest amount any at continuous away from bound.
int lastNumberRows_
Number of rows when last "scaled".
void setLastAlgorithm(int value)
Set last algorithm used , 1 = primal, 2 = dual other unknown.
virtual int dualPivotResult(int &colIn, int &sign, int colOut, int outStatus, double &t, CoinPackedVector *dx)
Obtain a result of the dual pivot (similar to the previous method) Differences: entering variable and...
virtual int getNumRows() const
Get number of rows.
virtual void addCol(const CoinPackedVectorBase &vec, const double collb, const double colub, const double obj, std::string name)
Add a named column (primal variable) to the problem.
CoinWarmStartBasis * getPointerToWarmStart()
Get warmstarting information.
virtual CoinWarmStart * getWarmStart() const
Get warmstarting information.
int cleanupScaling() const
Get scaling action option.
virtual void addCols(const int numcols, const CoinPackedVectorBase *const *cols, const double *collb, const double *colub, const double *obj)
CoinDoubleArrayWithLength columnScale_
Column scale factors (has inverse at end)
virtual void loadProblem(const ClpMatrixBase &matrix, 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 as a ClpMatrixBase.
virtual const double * getColUpper() const
Get pointer to array[getNumCols()] of column upper bounds.
ClpSimplex * continuousModel_
Continuous model.
void setSpecialOptions(unsigned int value)
virtual const double * getReducedCost() const
Get a pointer to array[getNumCols()] of reduced costs.
void setSmallestElementInCut(double value)
Set smallest allowed element in cut.
bool fakeMinInSimplex_
Faking min to get proper dual solution signs in simplex API.
int startFastDual(int options)
Start faster dual - returns negative if problems 1 if infeasible, Options to pass to solver 1 - creat...
double largestAway() const
Get largest amount continuous away from bound.
int * whichRange_
Pointer to variables for which we want range information The number is in [0] memory is not owned by ...
bool getIntParam(OsiIntParam key, int &value) const
OsiClpSolverInterface(ClpSimplex *rhs, bool reallyOwn=false)
Borrow constructor - only delete one copy.
void passInRanges(int *array)
Pass in range array.
bool getDblParam(OsiDblParam key, double &value) const
void setStuff(double tolerance, double increment)
Sets integer tolerance and increment.
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...
virtual const double * getRowPrice() const
Get pointer to array[getNumRows()] of dual prices.
virtual CoinBigIndex getNumElements() const
Get number of nonzero elements.
double smallestElementInCut() const
Get smallest allowed element in cut.
double smallestElementInCut_
Smallest allowed element in cut.
CoinWarmStartBasis * ws_
A pointer to the warmstart information to be used in the hotstarts.
virtual std::string getRowName(int rowIndex, unsigned maxLen=static_cast< unsigned >(std::string::npos)) const
Return name of row if one exists or Rnnnnnnn maxLen is currently ignored and only there to match the ...
virtual bool isBinary(int colIndex) const
Return true if variable is binary.
void setSmallestChangeInCut(double value)
Set smallest change in cut.
ClpSimplex * modelPtr_
Clp model represented by this class instance.
CoinPackedMatrix * matrixByRowAtContinuous_
Pointer to row-wise copy of continuous problem matrix coefficients.
double smallestChangeInCut_
Smallest change in cut.
virtual void reset()
Resets as if default constructor.
void setBasis(const CoinWarmStartBasis &basis, ClpSimplex *model)
Sets up working basis as a copy of input.
void setLanguage(CoinMessages::Language language)
virtual const double * getRightHandSide() const
Get pointer to array[getNumRows()] of rows right-hand sides.
virtual int primalPivotResult(int colIn, int sign, int &colOut, int &outStatus, double &t, CoinPackedVector *dx)
Obtain a result of the primal pivot Outputs: colOut – leaving column, outStatus – its status,...
ClpSimplex * smallModel_
Alternate model (hot starts) - but also could be permanent and used for crunch.
virtual void addCol(int numberElements, const int *rows, const double *elements, const double collb, const double colub, const double obj, std::string name)
Add a named column (primal variable) to the problem.
void setBasis()
Just puts current basis_ into ClpSimplex model.
int lastAlgorithm() const
Last algorithm used , 1 = primal, 2 = dual other unknown.
virtual void getBInvARow(int row, double *z, double *slack=NULL) const
Get a row of the tableau (slack part in slack if not NULL)
CoinWarmStartDiff * getBasisDiff(const unsigned char *statusArray) const
Warm start difference from basis_ to statusArray.
virtual CoinPackedMatrix * getMutableMatrixByCol() const
Get pointer to mutable column-wise copy of matrix.
virtual std::vector< double * > getPrimalRays(int maxNumRays) const
Get as many primal rays as the solver can provide.
const double * downRange() const
bool isOptionalInteger(int colIndex) const
Return true if column is integer but does not have to be declared as such.
void setColumnStatus(int iColumn, ClpSimplex::Status status)
Set column status in ClpSimplex and warmStart.
virtual void getReducedGradient(double *columnReducedCosts, double *duals, const double *c) const
Get the reduced gradient for the cost vector c.
virtual const CoinPackedMatrix * getMatrixByRow() const
Get pointer to row-wise copy of matrix.
virtual void setColUpper(int elementIndex, double elementValue)
Set a single column upper bound Use DBL_MAX for infinity.
char * rowsense_
Pointer to dense vector of row sense indicators.
virtual bool isInteger(int colIndex) const
Return true if column is integer.
ClpDataSave saveData_
To save data in OsiSimplex stuff.
virtual void setObjCoeff(int elementIndex, double elementValue)
Set an objective function coefficient.
virtual int loadFromCoinModel(CoinModel &modelObject, bool keepSolution=false)
This loads a model from a coinModel object - returns number of errors.
virtual int readLp(const char *filename, const double epsilon=1e-5)
Read file in LP format (with names)
CoinWarmStartBasis getBasis(ClpSimplex *model) const
Warm start.
void setOptionalInteger(int index)
Set the index-th variable to be an optional integer variable.
virtual void writeLp(const char *filename, const char *extension="lp", double epsilon=1e-5, int numberAcross=10, int decimals=5, double objSense=0.0, bool useRowNames=true) const
Write the problem into an Lp file of the given filename.
virtual void passInMessageHandler(CoinMessageHandler *handler)
Pass in a message handler.
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.
virtual const double * getColSolution() const
Get pointer to array[getNumCols()] of primal solution vector.
void setupForRepeatedUse(int senseOfAdventure=0, int printOut=0)
Set up solver for repeated use by Osi interface.
void gutsOfDestructor()
The real work of a copy constructor (used by copy and assignment)
void setSOSData(int numberSOS, const char *type, const int *start, const int *indices, const double *weights=NULL)
Pass in sos stuff from AMPl.
char * integerInformation_
Pointer to integer information.
virtual void setColBounds(int elementIndex, double lower, double upper)
Set a single column lower and upper bound.
CoinWarmStartBasis basis_
Warmstart information to be used in resolves.
virtual void addCol(const CoinPackedVectorBase &vec, const double collb, const double colub, const double obj)
bool setDblParam(OsiDblParam key, double value)
void setCleanupScaling(int value)
Set Scaling option When scaling is on it is possible that the scaled problem is feasible but the unsc...
bool setIntParam(OsiIntParam key, int value)
void setIntegerType(int colIndex, int value)
Set integer type (0,1,2=optional,3=sc,4=scint)
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 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 double getObjValue() const
Get objective function value.
virtual void addRow(const CoinPackedVectorBase &vec, const char rowsen, const double rowrhs, const double rowrng)
virtual void addRow(const CoinPackedVectorBase &vec, const double rowlb, const double rowub)
void setSolveOptions(const ClpSolve &options)
Pass in initial solve options.
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...
virtual void setRowBounds(int elementIndex, double lower, double upper)
Set a single row lower and upper bound.
CoinWarmStartBasis * getBasis(const unsigned char *statusArray) const
Warm start from statusArray.
virtual std::string getColName(int colIndex, unsigned maxLen=static_cast< unsigned >(std::string::npos)) const
Return name of column if one exists or Cnnnnnnn maxLen is currently ignored and only there to match t...
int readMps(const char *filename, bool keepNames, bool allowErrors)
Read an mps file from the given filename returns number of errors (see OsiMpsReader class)
bool isHeuristicInteger(int colIndex) const
Return true only if integer and not optional.
int numberSOS_
Number of SOS sets.
int numberSOS() const
Number of SOS sets.
virtual bool isContinuous(int colNumber) const
Return true if column is continuous.
virtual void getBInvACol(CoinIndexedVector *vec) const
Update (i.e.
virtual void addCols(const int numcols, const CoinBigIndex *columnStarts, const int *rows, const double *elements, const double *collb, const double *colub, const double *obj)
virtual void applyRowCut(const OsiRowCut &rc)
Apply a row cut (append to constraint matrix).
virtual bool basisIsAvailable() const
Returns true if a basis is available AND problem is optimal.
virtual void writeLp(FILE *fp, double epsilon=1e-5, int numberAcross=10, int decimals=5, double objSense=0.0, bool useRowNames=true) const
Write the problem into the file pointed to by the parameter fp.
int cleanupScaling_
Scaling option When scaling is on it is possible that the scaled problem is feasible but the unscaled...
const double * upRange() const
If doing fast hot start then ranges are computed.
virtual void getBasisStatus(int *cstat, int *rstat) const
The following two methods may be replaced by the methods of OsiSolverInterface using OsiWarmStartBasi...
virtual void setInteger(int index)
Set the index-th variable to be an integer variable.
bool getStrParam(OsiStrParam key, std::string &value) const
virtual void getBInvCol(int col, double *vec) const
Get a column of the basis inverse.
virtual void setColLower(int elementIndex, double elementValue)
Set a single column lower bound Use -DBL_MAX for -infinity.
CoinPackedMatrix * matrixByRow_
Pointer to row-wise copy of problem matrix coefficients.
OsiRowCut * smallModelCut(const double *originalLower, const double *originalUpper, int numberRowsAtContinuous, const int *whichGenerator, int typeCut=0)
Return a conflict analysis cut from small model.
OsiRowCut * modelCut(const double *originalLower, const double *originalUpper, int numberRowsAtContinuous, const int *whichGenerator, int typeCut=0)
Return a conflict analysis cut from model If type is 0 then genuine cut, if 1 then only partially pro...
virtual void restoreBaseModel(int numberRows)
Strip off rows to get to this number of rows.