SoPlex Documentation
Loading...
Searching...
No Matches
SoPlexBase< R > Class Template Reference

#include <soplex.h>

Classes

struct  RowViolation
 
struct  RowViolationCompare
 
class  Settings
 class of parameter settings More...
 
class  Statistics
 

Public Member Functions

Construction and destruction
 SoPlexBase ()
 default constructor
 
SoPlexBase< R > & operator= (const SoPlexBase< R > &rhs)
 assignment operator
 
 SoPlexBase (const SoPlexBase< R > &rhs)
 copy constructor
 
virtual ~SoPlexBase ()
 destructor
 
Access to the real LP
int numRows () const
 returns number of rows
 
int numRowsReal () const
 
int numRowsRational () const
 
int numCols () const
 Templated function that returns number of columns.
 
int numColsReal () const
 
int numColsRational () const
 
int numNonzeros () const
 returns number of nonzeros
 
int numNonzerosRational () const
 
R minAbsNonzeroReal () const
 returns smallest non-zero element in absolute value
 
R maxAbsNonzeroReal () const
 returns biggest non-zero element in absolute value
 
R coefReal (int row, int col) const
 returns (unscaled) coefficient
 
const SVectorBase< R > & rowVectorRealInternal (int i) const
 returns vector of row i, ignoring scaling
 
void getRowVectorReal (int i, DSVectorBase< R > &row) const
 gets vector of row i
 
const VectorBase< R > & rhsRealInternal () const
 returns right-hand side vector, ignoring scaling
 
void getRhsReal (VectorBase< R > &rhs) const
 gets right-hand side vector
 
R rhsReal (int i) const
 returns right-hand side of row i
 
const VectorBase< R > & lhsRealInternal () const
 returns left-hand side vector, ignoring scaling
 
void getLhsReal (VectorBase< R > &lhs) const
 gets left-hand side vector
 
R lhsReal (int i) const
 returns left-hand side of row i
 
LPRowBase< R >::Type rowTypeReal (int i) const
 returns inequality type of row i
 
const SVectorBase< R > & colVectorRealInternal (int i) const
 returns vector of col i, ignoring scaling
 
void getColVectorReal (int i, DSVectorBase< R > &col) const
 gets vector of col i
 
const VectorBase< R > & upperRealInternal () const
 returns upper bound vector
 
R upperReal (int i) const
 returns upper bound of column i
 
void getUpperReal (VectorBase< R > &upper) const
 gets upper bound vector
 
const VectorBase< R > & lowerRealInternal () const
 returns lower bound vector
 
R lowerReal (int i) const
 returns lower bound of column i
 
void getLowerReal (VectorBase< R > &lower) const
 gets lower bound vector
 
void getObjReal (VectorBase< R > &obj) const
 gets objective function vector
 
R objReal (int i) const
 returns objective value of column i
 
const VectorBase< R > & maxObjRealInternal () const
 returns objective function vector after transformation to a maximization problem; since this is how it is stored internally, this is generally faster
 
R maxObjReal (int i) const
 returns objective value of column i after transformation to a maximization problem; since this is how it is stored internally, this is generally faster
 
void getNdualNorms (int &nnormsRow, int &nnormsCol) const
 gets number of available dual norms
 
bool getDualNorms (int &nnormsRow, int &nnormsCol, R *norms) const
 gets steepest edge norms and returns false if they are not available
 
bool setDualNorms (int nnormsRow, int nnormsCol, R *norms)
 sets steepest edge norms and returns false if that's not possible
 
void setIntegralityInformation (int ncols, int *intInfo)
 pass integrality information about the variables to the solver
 
Access to the rational LP
Rational minAbsNonzeroRational () const
 returns smallest non-zero element in absolute value
 
Rational maxAbsNonzeroRational () const
 returns biggest non-zero element in absolute value
 
void getRowRational (int i, LPRowRational &lprow) const
 gets row i
 
void getRowsRational (int start, int end, LPRowSetRational &lprowset) const
 gets rows start, ..., end.
 
const SVectorRationalrowVectorRational (int i) const
 returns vector of row i
 
const VectorRationalrhsRational () const
 returns right-hand side vector
 
const RationalrhsRational (int i) const
 returns right-hand side of row i
 
const VectorRationallhsRational () const
 returns left-hand side vector
 
const RationallhsRational (int i) const
 returns left-hand side of row i
 
LPRowRational::Type rowTypeRational (int i) const
 returns inequality type of row i
 
void getColRational (int i, LPColRational &lpcol) const
 gets column i
 
void getColsRational (int start, int end, LPColSetRational &lpcolset) const
 gets columns start, ..., end
 
const SVectorRationalcolVectorRational (int i) const
 returns vector of column i
 
const VectorRationalupperRational () const
 returns upper bound vector
 
const RationalupperRational (int i) const
 returns upper bound of column i
 
const VectorRationallowerRational () const
 returns lower bound vector
 
const RationallowerRational (int i) const
 returns lower bound of column i
 
void getObjRational (VectorRational &obj) const
 gets objective function vector
 
void getObjRational (int i, Rational &obj) const
 gets objective value of column i
 
Rational objRational (int i) const
 returns objective value of column i
 
const VectorRationalmaxObjRational () const
 returns objective function vector after transformation to a maximization problem; since this is how it is stored internally, this is generally faster
 
const RationalmaxObjRational (int i) const
 returns objective value of column i after transformation to a maximization problem; since this is how it is stored internally, this is generally faster
 
Modification of the real LP
void addRowReal (const LPRowBase< R > &lprow)
 adds a single row
 
void addRowsReal (const LPRowSetBase< R > &lprowset)
 adds multiple rows
 
void addColReal (const LPColBase< R > &lpcol)
 adds a single column
 
void addColsReal (const LPColSetBase< R > &lpcolset)
 adds multiple columns
 
void changeRowReal (int i, const LPRowBase< R > &lprow)
 replaces row i with lprow
 
void changeLhsReal (const VectorBase< R > &lhs)
 changes left-hand side vector for constraints to lhs
 
void changeLhsReal (int i, const R &lhs)
 changes left-hand side of row i to lhs
 
void changeRhsReal (const VectorBase< R > &rhs)
 changes right-hand side vector to rhs
 
void changeRhsReal (int i, const R &rhs)
 changes right-hand side of row i to rhs
 
void changeRangeReal (const VectorBase< R > &lhs, const VectorBase< R > &rhs)
 changes left- and right-hand side vectors
 
void changeRangeReal (int i, const R &lhs, const R &rhs)
 changes left- and right-hand side of row i
 
void changeColReal (int i, const LPColReal &lpcol)
 replaces column i with lpcol
 
void changeLowerReal (const VectorBase< R > &lower)
 changes vector of lower bounds to lower
 
void changeLowerReal (int i, const R &lower)
 changes lower bound of column i to lower
 
void changeUpperReal (const VectorBase< R > &upper)
 changes vector of upper bounds to upper
 
void changeUpperReal (int i, const R &upper)
 changes i 'th upper bound to upper
 
void changeBoundsReal (const VectorBase< R > &lower, const VectorBase< R > &upper)
 changes vectors of column bounds to lower and upper
 
void changeBoundsReal (int i, const R &lower, const R &upper)
 changes bounds of column i to lower and upper
 
void changeObjReal (const VectorBase< R > &obj)
 changes objective function vector to obj
 
void changeObjReal (int i, const R &obj)
 changes objective coefficient of column i to obj
 
void changeElementReal (int i, int j, const R &val)
 changes matrix entry in row i and column j to val
 
void removeRowReal (int i)
 removes row i
 
void removeRowsReal (int perm[])
 removes all rows with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where row i has been moved to; note that perm must point to an array of size at least numRows()
 
void removeRowsReal (int idx[], int n, int perm[]=0)
 remove all rows with indices in array idx of size n; an array perm of size numRows() may be passed as buffer memory
 
void removeRowRangeReal (int start, int end, int perm[]=0)
 removes rows start to end including both; an array perm of size numRows() may be passed as buffer memory
 
void removeColReal (int i)
 removes column i
 
void removeColsReal (int perm[])
 removes all columns with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where column i has been moved to; note that perm must point to an array of size at least numColsReal()
 
void removeColsReal (int idx[], int n, int perm[]=0)
 remove all columns with indices in array idx of size n; an array perm of size numColsReal() may be passed as buffer memory
 
void removeColRangeReal (int start, int end, int perm[]=0)
 removes columns start to end including both; an array perm of size numColsReal() may be passed as buffer memory
 
void clearLPReal ()
 clears the LP
 
void syncLPReal ()
 synchronizes real LP with rational LP, i.e., copies (rounded) rational LP into real LP, if sync mode is manual
 
Modification of the rational LP
void addRowRational (const LPRowRational &lprow)
 adds a single row
 
void addRowRational (const mpq_t *lhs, const mpq_t *rowValues, const int *rowIndices, const int rowSize, const mpq_t *rhs)
 adds a single row (GMP only method)
 
void addRowsRational (const mpq_t *lhs, const mpq_t *rowValues, const int *rowIndices, const int *rowStarts, const int *rowLengths, const int numRows, const int numValues, const mpq_t *rhs)
 adds a set of rows (GMP only method)
 
void addRowsRational (const LPRowSetRational &lprowset)
 adds multiple rows
 
void addColRational (const LPColRational &lpcol)
 adds a single column
 
void addColRational (const mpq_t *obj, const mpq_t *lower, const mpq_t *colValues, const int *colIndices, const int colSize, const mpq_t *upper)
 adds a single column (GMP only method)
 
void addColsRational (const mpq_t *obj, const mpq_t *lower, const mpq_t *colValues, const int *colIndices, const int *colStarts, const int *colLengths, const int numCols, const int numValues, const mpq_t *upper)
 adds a set of columns (GMP only method)
 
void addColsRational (const LPColSetRational &lpcolset)
 adds multiple columns
 
void changeRowRational (int i, const LPRowRational &lprow)
 replaces row i with lprow
 
void changeLhsRational (const VectorRational &lhs)
 changes left-hand side vector for constraints to lhs
 
void changeLhsRational (int i, const Rational &lhs)
 changes left-hand side of row i to lhs
 
void changeLhsRational (int i, const mpq_t *lhs)
 changes left-hand side of row i to lhs (GMP only method)
 
void changeRhsRational (const VectorRational &rhs)
 changes right-hand side vector to rhs
 
void changeRhsRational (const mpq_t *rhs, int rhsSize)
 changes right-hand side vector to rhs (GMP only method)
 
void changeRhsRational (int i, const Rational &rhs)
 changes right-hand side of row i to rhs
 
void changeRangeRational (const VectorRational &lhs, const VectorRational &rhs)
 changes left- and right-hand side vectors
 
void changeRangeRational (int i, const Rational &lhs, const Rational &rhs)
 changes left- and right-hand side of row i
 
void changeRangeRational (int i, const mpq_t *lhs, const mpq_t *rhs)
 changes left- and right-hand side of row i (GMP only method)
 
void changeColRational (int i, const LPColRational &lpcol)
 replaces column i with lpcol
 
void changeLowerRational (const VectorRational &lower)
 changes vector of lower bounds to lower
 
void changeLowerRational (int i, const Rational &lower)
 changes lower bound of column i to lower
 
void changeLowerRational (int i, const mpq_t *lower)
 changes lower bound of column i to lower (GMP only method)
 
void changeUpperRational (const VectorRational &upper)
 changes vector of upper bounds to upper
 
void changeUpperRational (int i, const Rational &upper)
 changes i 'th upper bound to upper
 
void changeUpperRational (int i, const mpq_t *upper)
 changes upper bound of column i to upper (GMP only method)
 
void changeBoundsRational (const VectorRational &lower, const VectorRational &upper)
 changes vectors of column bounds to lower and upper
 
void changeBoundsRational (int i, const Rational &lower, const Rational &upper)
 changes bounds of column i to lower and upper
 
void changeBoundsRational (int i, const mpq_t *lower, const mpq_t *upper)
 changes bounds of column i to lower and upper (GMP only method)
 
void changeObjRational (const VectorRational &obj)
 changes objective function vector to obj
 
void changeObjRational (int i, const Rational &obj)
 changes objective coefficient of column i to obj
 
void changeObjRational (int i, const mpq_t *obj)
 changes objective coefficient of column i to obj (GMP only method)
 
void changeElementRational (int i, int j, const Rational &val)
 changes matrix entry in row i and column j to val
 
void changeElementRational (int i, int j, const mpq_t *val)
 changes matrix entry in row i and column j to val (GMP only method)
 
void removeRowRational (int i)
 removes row i
 
void removeRowsRational (int perm[])
 removes all rows with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where row i has been moved to; note that perm must point to an array of size at least numRowsRational()
 
void removeRowsRational (int idx[], int n, int perm[]=0)
 remove all rows with indices in array idx of size n; an array perm of size numRowsRational() may be passed as buffer memory
 
void removeRowRangeRational (int start, int end, int perm[]=0)
 removes rows start to end including both; an array perm of size numRowsRational() may be passed as buffer memory
 
void removeColRational (int i)
 removes column i
 
void removeColsRational (int perm[])
 removes all columns with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where column i has been moved to; note that perm must point to an array of size at least numColsRational()
 
void removeColsRational (int idx[], int n, int perm[]=0)
 remove all columns with indices in array idx of size n; an array perm of size numColsRational() may be passed as buffer memory
 
void removeColRangeRational (int start, int end, int perm[]=0)
 removes columns start to end including both; an array perm of size numColsRational() may be passed as buffer memory
 
void clearLPRational ()
 clears the LP
 
void syncLPRational ()
 synchronizes rational LP with real LP, i.e., copies real LP to rational LP, if sync mode is manual
 
Solving and general solution query
SPxSolverBase< R >::Status optimize (volatile bool *interrupt=NULL)
 optimize the given LP
 
SPxSolverBase< R >::Status solve (volatile bool *interrupt=NULL)
 
SPxSolverBase< R >::Status status () const
 returns the current solver status
 
bool isPrimalFeasible () const
 is stored primal solution feasible?
 
bool hasSol () const
 is a solution available (not neccessarily feasible)?
 
bool hasPrimal () const
 deprecated: use hasSol() instead
 
bool hasDual () const
 deprecated: use hasSol() instead
 
bool hasPrimalRay () const
 is a primal unbounded ray available?
 
bool isDualFeasible () const
 is stored dual solution feasible?
 
bool hasDualFarkas () const
 is Farkas proof of infeasibility available?
 
bool ignoreUnscaledViolations ()
 sets the status to OPTIMAL in case the LP has been solved with unscaled violations
 
Query for the real solution data
R objValueReal ()
 returns the objective value if a primal solution is available
 
bool getPrimal (VectorBase< R > &vector)
 gets the primal solution vector if available; returns true on success
 
bool getPrimalReal (R *p_vector, int size)
 
bool getPrimalRational (VectorRational &vector)
 
bool getSlacksReal (VectorBase< R > &vector)
 gets the vector of slack values if available; returns true on success
 
bool getSlacksReal (R *p_vector, int dim)
 
bool getPrimalRay (VectorBase< R > &vector)
 gets the primal ray if available; returns true on success
 
bool getPrimalRayReal (R *vector, int dim)
 
bool getPrimalRayRational (VectorRational &vector)
 
bool getDual (VectorBase< R > &vector)
 gets the dual solution vector if available; returns true on success
 
bool getDualReal (R *p_vector, int dim)
 
bool getDualRational (VectorRational &vector)
 
bool getRedCost (VectorBase< R > &vector)
 gets the vector of reduced cost values if available; returns true on success
 
bool getRedCostReal (R *vector, int dim)
 
bool getRedCostRational (VectorRational &vector)
 
bool getDualFarkas (VectorBase< R > &vector)
 gets the Farkas proof if available; returns true on success
 
bool getDualFarkasReal (R *vector, int dim)
 
bool getDualFarkasRational (VectorRational &vector)
 
bool getBoundViolation (R &maxviol, R &sumviol)
 gets violation of bounds; returns true on success
 
bool getBoundViolationRational (Rational &maxviol, Rational &sumviol)
 
bool getRowViolation (R &maxviol, R &sumviol)
 gets violation of constraints; returns true on success
 
bool getRowViolationRational (Rational &maxviol, Rational &sumviol)
 
bool getRedCostViolation (R &maxviol, R &sumviol)
 gets violation of reduced costs; returns true on success
 
bool getRedCostViolationRational (Rational &maxviol, Rational &sumviol)
 
bool getDualViolation (R &maxviol, R &sumviol)
 gets violation of dual multipliers; returns true on success
 
bool getDualViolationRational (Rational &maxviol, Rational &sumviol)
 
Query for the rational solution data
Rational objValueRational ()
 returns the objective value if a primal solution is available
 
bool getSlacksRational (VectorRational &vector)
 gets the vector of slack values if available; returns true on success
 
bool getPrimalRational (mpq_t *vector, const int size)
 gets the primal solution vector if available; returns true on success (GMP only method)
 
bool getSlacksRational (mpq_t *vector, const int size)
 gets the vector of slack values if available; returns true on success (GMP only method)
 
bool getPrimalRayRational (mpq_t *vector, const int size)
 gets the primal ray if LP is unbounded; returns true on success (GMP only method)
 
bool getDualRational (mpq_t *vector, const int size)
 gets the dual solution vector if available; returns true on success (GMP only method)
 
bool getRedCostRational (mpq_t *vector, const int size)
 gets the vector of reduced cost values if available; returns true on success (GMP only method)
 
bool getDualFarkasRational (mpq_t *vector, const int size)
 gets the Farkas proof if LP is infeasible; returns true on success (GMP only method)
 
int totalSizePrimalRational (const int base=2)
 get size of primal solution
 
int totalSizeDualRational (const int base=2)
 get size of dual solution
 
int dlcmSizePrimalRational (const int base=2)
 get size of least common multiple of denominators in primal solution
 
int dlcmSizeDualRational (const int base=2)
 get size of least common multiple of denominators in dual solution
 
int dmaxSizePrimalRational (const int base=2)
 get size of largest denominator in primal solution
 
int dmaxSizeDualRational (const int base=2)
 get size of largest denominator in dual solution
 
Access and modification of basis information
bool hasBasis () const
 is an advanced starting basis available?
 
SPxBasisBase< R >::SPxStatus basisStatus () const
 returns the current basis status
 
SPxSolverBase< R >::VarStatus basisRowStatus (int row) const
 returns basis status for a single row
 
SPxSolverBase< R >::VarStatus basisColStatus (int col) const
 returns basis status for a single column
 
void getBasis (typename SPxSolverBase< R >::VarStatus rows[], typename SPxSolverBase< R >::VarStatus cols[]) const
 gets current basis via arrays of statuses
 
void getBasisInd (int *bind) const
 gets the indices of the basic columns and rows; basic column n gives value n, basic row m gives value -1-m
 
bool getBasisMetric (R &metric, int type=0)
 
bool getEstimatedCondition (R &condition)
 computes an estimated condition number for the current basis matrix using the power method; returns true on success
 
bool getExactCondition (R &condition)
 computes the exact condition number for the current basis matrix using the power method; returns true on success
 
bool getBasisInverseRowReal (int r, R *coef, int *inds=NULL, int *ninds=NULL, bool unscale=true)
 computes row r of basis inverse; returns true on success
 
bool getBasisInverseColReal (int c, R *coef, int *inds=NULL, int *ninds=NULL, bool unscale=true)
 computes column c of basis inverse; returns true on success
 
bool getBasisInverseTimesVecReal (R *rhs, R *sol, bool unscale=true)
 computes dense solution of basis matrix B * sol = rhs; returns true on success
 
bool multBasis (R *vec, bool unscale=true)
 multiply with basis matrix; B * vec (inplace)
 
bool multBasisTranspose (R *vec, bool unscale=true)
 multiply with transpose of basis matrix; vec * B^T (inplace)
 
bool computeBasisInverseRational ()
 compute rational basis inverse; returns true on success
 
bool getBasisIndRational (DataArray< int > &bind)
 gets an array of indices for the columns of the rational basis matrix; bind[i] >= 0 means that the i-th column of the basis matrix contains variable bind[i]; bind[i] < 0 means that the i-th column of the basis matrix contains the slack variable for row -bind[i]-1; performs rational factorization if not available; returns true on success
 
bool getBasisInverseRowRational (const int r, SSVectorRational &vec)
 computes row r of basis inverse; performs rational factorization if not available; returns true on success
 
bool getBasisInverseColRational (const int c, SSVectorRational &vec)
 computes column c of basis inverse; performs rational factorization if not available; returns true on success
 
bool getBasisInverseTimesVecRational (const SVectorRational &rhs, SSVectorRational &sol)
 computes solution of basis matrix B * sol = rhs; performs rational factorization if not available; returns true on success
 
void setBasis (const typename SPxSolverBase< R >::VarStatus rows[], const typename SPxSolverBase< R >::VarStatus cols[])
 sets starting basis via arrays of statuses
 
void clearBasis ()
 clears starting basis
 
Statistical information
int numIterations () const
 number of iterations since last call to solve
 
Real solveTime () const
 time spent in last call to solve
 
std::string statisticString () const
 statistical information in form of a string
 
const chargetStarterName ()
 name of starter
 
const chargetSimplifierName ()
 name of simplifier
 
const chargetScalerName ()
 name of scaling method
 
const chargetPricerName ()
 name of currently loaded pricer
 
const chargetRatiotesterName ()
 name of currently loaded ratiotester
 
File I/O
bool readFile (const char *filename, NameSet *rowNames=0, NameSet *colNames=0, DIdxSet *intVars=0)
 reads LP file in LP or MPS format according to READMODE parameter; gets row names, column names, and integer variables if desired; returns true on success
 
bool writeFile (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0, const DIdxSet *intvars=0, const bool unscale=true) const
 Templated write function Real writes real LP to file; LP or MPS format is chosen from the extension in filename; if rowNames and colNames are NULL, default names are used; if intVars is not NULL, the variables contained in it are marked as integer; returns true on success Rational writes rational LP to file; LP or MPS format is chosen from the extension in filename; if rowNames and colNames are NULL, default names are used; if intVars is not NULL, the variables contained in it are marked as integer; returns true on success.
 
bool writeFileRational (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0, const DIdxSet *intvars=0) const
 
bool writeFileReal (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0, const DIdxSet *intvars=0, const bool unscale=true) const
 
bool writeDualFileReal (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0, const DIdxSet *intvars=0) const
 writes the dual of the real LP to file; LP or MPS format is chosen from the extension in filename; if rowNames and colNames are NULL, default names are used; if intVars is not NULL, the variables contained in it are marked as integer; returns true on success
 
bool readBasisFile (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0)
 reads basis information from filename and returns true on success; if rowNames and colNames are NULL, default names are assumed; returns true on success
 
bool writeBasisFile (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0, const bool cpxFormat=false) const
 writes basis information to filename; if rowNames and colNames are NULL, default names are used; returns true on success
 
void writeStateReal (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0, const bool cpxFormat=false) const
 writes internal LP, basis information, and parameter settings; if rowNames and colNames are NULL, default names are used
 
void writeStateRational (const char *filename, const NameSet *rowNames=0, const NameSet *colNames=0, const bool cpxFormat=false) const
 writes internal LP, basis information, and parameter settings; if rowNames and colNames are NULL, default names are used
 
Statistics
void setTimings (const Timer::TYPE ttype)
 set statistic timers to a certain type
 
void printSolutionStatistics (std::ostream &os)
 prints solution statistics
 
void printSolvingStatistics (std::ostream &os)
 prints statistics on solving process
 
void printShortStatistics (std::ostream &os)
 prints short statistics
 
void printStatistics (std::ostream &os)
 prints complete statistics
 
void printStatus (std::ostream &os, typename SPxSolverBase< R >::Status status)
 prints status
 

Private Member Functions

Constant helper methods
void _ensureDSVectorRationalMemory (DSVectorRational &vec, const int newmax) const
 extends sparse vector to hold newmax entries if and only if it holds no more free entries
 
void _idxToPerm (int *idx, int idxSize, int *perm, int permSize) const
 creates a permutation for removing rows/columns from an array of indices
 
void _rangeToPerm (int start, int end, int *perm, int permSize) const
 creates a permutation for removing rows/columns from a range of indices
 
bool _isConsistent () const
 checks consistency
 
bool _isSolveStopped (bool &stoppedTime, bool &stoppedIter) const
 should solving process be stopped?
 
RangeType _rangeTypeReal (const R &lower, const R &upper) const
 determines RangeType from real bounds
 
RangeType _rangeTypeRational (const Rational &lower, const Rational &upper) const
 determines RangeType from rational bounds
 
RangeType _switchRangeType (const RangeType &rangeType) const
 switches RANGETYPE_LOWER to RANGETYPE_UPPER and vice versa
 
bool _lowerFinite (const RangeType &rangeType) const
 checks whether RangeType corresponds to finite lower bound
 
bool _upperFinite (const RangeType &rangeType) const
 checks whether RangeType corresponds to finite upper bound
 
Non-constant helper methods
void _addRowReal (const LPRowBase< R > &lprow)
 adds a single row to the real LP and adjusts basis
 
void _addRowReal (R lhs, const SVectorBase< R > &lprow, R rhs)
 adds a single row to the real LP and adjusts basis
 
void _addRowsReal (const LPRowSetBase< R > &lprowset)
 adds multiple rows to the real LP and adjusts basis
 
void _addColReal (const LPColReal &lpcol)
 adds a single column to the real LP and adjusts basis
 
void _addColReal (R obj, R lower, const SVectorBase< R > &lpcol, R upper)
 adds a single column to the real LP and adjusts basis
 
void _addColsReal (const LPColSetReal &lpcolset)
 adds multiple columns to the real LP and adjusts basis
 
void _changeRowReal (int i, const LPRowBase< R > &lprow)
 replaces row i with lprow and adjusts basis
 
void _changeLhsReal (const VectorBase< R > &lhs)
 changes left-hand side vector for constraints to lhs and adjusts basis
 
void _changeLhsReal (int i, const R &lhs)
 changes left-hand side of row i to lhs and adjusts basis
 
void _changeRhsReal (const VectorBase< R > &rhs)
 changes right-hand side vector to rhs and adjusts basis
 
void _changeRhsReal (int i, const R &rhs)
 changes right-hand side of row i to rhs and adjusts basis
 
void _changeRangeReal (const VectorBase< R > &lhs, const VectorBase< R > &rhs)
 changes left- and right-hand side vectors and adjusts basis
 
void _changeRangeReal (int i, const R &lhs, const R &rhs)
 changes left- and right-hand side of row i and adjusts basis
 
void _changeColReal (int i, const LPColReal &lpcol)
 replaces column i with lpcol and adjusts basis
 
void _changeLowerReal (const VectorBase< R > &lower)
 changes vector of lower bounds to lower and adjusts basis
 
void _changeLowerReal (int i, const R &lower)
 changes lower bound of column i to lower and adjusts basis
 
void _changeUpperReal (const VectorBase< R > &upper)
 changes vector of upper bounds to upper and adjusts basis
 
void _changeUpperReal (int i, const R &upper)
 changes i 'th upper bound to upper and adjusts basis
 
void _changeBoundsReal (const VectorBase< R > &lower, const VectorBase< R > &upper)
 changes vectors of column bounds to lower and upper and adjusts basis
 
void _changeBoundsReal (int i, const R &lower, const R &upper)
 changes bounds of column i to lower and upper and adjusts basis
 
void _changeElementReal (int i, int j, const R &val)
 changes matrix entry in row i and column j to val and adjusts basis
 
void _removeRowReal (int i)
 removes row i and adjusts basis
 
void _removeRowsReal (int perm[])
 removes all rows with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where row i has been moved to; note that perm must point to an array of size at least numRows()
 
void _removeRowsReal (int idx[], int n, int perm[])
 remove all rows with indices in array idx of size n; an array perm of size numRows() may be passed as buffer memory
 
void _removeRowRangeReal (int start, int end, int perm[])
 removes rows start to end including both; an array perm of size numRows() may be passed as buffer memory
 
void _removeColReal (int i)
 removes column i
 
void _removeColsReal (int perm[])
 removes all columns with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where column i has been moved to; note that perm must point to an array of size at least numColsReal()
 
void _removeColsReal (int idx[], int n, int perm[])
 remove all columns with indices in array idx of size n; an array perm of size numColsReal() may be passed as buffer memory
 
void _removeColRangeReal (int start, int end, int perm[])
 removes columns start to end including both; an array perm of size numColsReal() may be passed as buffer memory
 
void _invalidateSolution ()
 invalidates solution
 
void _enableSimplifierAndScaler ()
 enables simplifier and scaler according to current parameters
 
void _disableSimplifierAndScaler ()
 disables simplifier and scaler
 
void _ensureRationalLP ()
 ensures that the rational LP is available; performs no sync
 
void _ensureRealLPLoaded ()
 ensures that the real LP and the basis are loaded in the solver; performs no sync
 
void _solveRealLPAndRecordStatistics (volatile bool *interrupt=NULL)
 call floating-point solver and update statistics on iterations etc.
 
bool _readFileReal (const char *filename, NameSet *rowNames=0, NameSet *colNames=0, DIdxSet *intVars=0)
 reads real LP in LP or MPS format from file and returns true on success; gets row names, column names, and integer variables if desired
 
bool _readFileRational (const char *filename, NameSet *rowNames=0, NameSet *colNames=0, DIdxSet *intVars=0)
 reads rational LP in LP or MPS format from file and returns true on success; gets row names, column names, and integer variables if desired
 
void _completeRangeTypesRational ()
 completes range type arrays after adding columns and/or rows
 
void _recomputeRangeTypesReal ()
 recomputes range types from scratch using real LP
 
void _recomputeRangeTypesRational ()
 recomputes range types from scratch using rational LP
 
void _syncLPReal (bool time=true)
 synchronizes real LP with rational LP, i.e., copies (rounded) rational LP into real LP, without looking at the sync mode
 
void _syncLPRational (bool time=true)
 synchronizes rational LP with real LP, i.e., copies real LP to rational LP, without looking at the sync mode
 
void _syncRealSolution ()
 synchronizes rational solution with real solution, i.e., copies (rounded) rational solution to real solution
 
void _syncRationalSolution ()
 synchronizes real solution with rational solution, i.e., copies real solution to rational solution
 
const UnitVectorRational_unitVectorRational (const int i)
 returns pointer to a constant unit vector available until destruction of the SoPlexBase class
 
bool _parseSettingsLine (char *line, const int lineNumber)
 parses one line in a settings file and returns true on success; note that the string is modified
 
void _performOptIRStable (SolRational &sol, bool acceptUnbounded, bool acceptInfeasible, int minRounds, bool &primalFeasible, bool &dualFeasible, bool &infeasible, bool &unbounded, bool &stoppedTime, bool &stoppedIter, bool &error)
 solves current problem with iterative refinement and recovery mechanism
 
void _performUnboundedIRStable (SolRational &sol, bool &hasUnboundedRay, bool &stoppedTime, bool &stoppedIter, bool &error)
 performs iterative refinement on the auxiliary problem for testing unboundedness
 
void _performFeasIRStable (SolRational &sol, bool &withDualFarkas, bool &stoppedTime, bool &stoppedIter, bool &error)
 performs iterative refinement on the auxiliary problem for testing feasibility
 
void _lift ()
 reduces matrix coefficient in absolute value by the lifting procedure of Thiele et al. 2013
 
void _project (SolRational &sol)
 undoes lifting
 
void _storeBasis ()
 store basis
 
void _restoreBasis ()
 restore basis
 
void _storeLPReal ()
 stores objective, bounds, and sides of real LP
 
void _restoreLPReal ()
 restores objective, bounds, and sides of real LP
 
void _transformEquality ()
 introduces slack variables to transform inequality constraints into equations for both rational and real LP, which should be in sync
 
void _untransformEquality (SolRational &sol)
 undoes transformation to equality form
 
void _transformUnbounded ()
 transforms LP to unboundedness problem by moving the objective function to the constraints, changing right-hand side and bounds to zero, and adding an auxiliary variable for the decrease in the objective function
 
void _untransformUnbounded (SolRational &sol, bool unbounded)
 undoes transformation to unboundedness problem
 
void _transformFeasibility ()
 transforms LP to feasibility problem by removing the objective function, shifting variables, and homogenizing the right-hand side
 
void _untransformFeasibility (SolRational &sol, bool infeasible)
 undoes transformation to feasibility problem
 
void _computeInfeasBox (SolRational &sol, bool transformed)
 
SPxSolverBase< R >::Status _solveRealForRational (bool fromscratch, VectorBase< R > &primal, VectorBase< R > &dual, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusRows, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusCols)
 solves real LP during iterative refinement
 
SPxSolverBase< R >::Status _solveRealStable (bool acceptUnbounded, bool acceptInfeasible, VectorBase< R > &primal, VectorBase< R > &dual, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusRows, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusCols, const bool forceNoSimplifier=false)
 solves real LP with recovery mechanism
 
void _computeBasisInverseRational ()
 computes rational inverse of basis matrix as defined by _rationalLUSolverBind
 
void _factorizeColumnRational (SolRational &sol, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusRows, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusCols, bool &stoppedTime, bool &stoppedIter, bool &error, bool &optimal)
 factorizes rational basis matrix in column representation
 
bool _reconstructSolutionRational (SolRational &sol, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusRows, DataArray< typename SPxSolverBase< R >::VarStatus > &basisStatusCols, const Rational &denomBoundSquared)
 attempts rational reconstruction of primal-dual solution
 
Private solving methods implemented in solvereal.cpp
void _optimize (volatile bool *interrupt=NULL)
 solves the templated LP
 
void _optimizeRational (volatile bool *interrupt=NULL)
 temporary fix for Rational
 
void _evaluateSolutionReal (typename SPxSimplifier< R >::Result simplificationStatus)
 checks result of the solving process and solves again without preprocessing if necessary
 
void _preprocessAndSolveReal (bool applyPreprocessing, volatile bool *interrupt=NULL)
 solves real LP with/without preprocessing
 
void _resolveWithoutPreprocessing (typename SPxSimplifier< R >::Result simplificationStatus)
 loads original problem into solver and solves again after it has been solved to optimality with preprocessing
 
void _verifySolutionReal ()
 verify computed solution and resolve if necessary
 
void _storeSolutionReal (bool verify=true)
 stores solution of the real LP; before calling this, the real LP must be loaded in the solver and solved (again)
 
void _storeSolutionRealFromPresol ()
 stores solution from the simplifier because problem vanished in presolving step
 
void _unscaleSolutionReal (SPxLPBase< R > &LP, bool persistent=true)
 unscales stored solution to remove internal or external scaling of LP
 
void _loadRealLP (bool initBasis)
 load original LP and possibly setup a slack basis
 
void _checkScaling (SPxLPBase< R > *origLP) const
 check scaling of LP
 
void _checkBasisScaling ()
 check correctness of (un)scaled basis matrix operations
 
bool _reapplyPersistentScaling () const
 check whether persistent scaling is supposed to be reapplied again after unscaling
 
void _solveDecompositionDualSimplex ()
 solves LP using the decomposition based dual simplex
 
void _createDecompReducedAndComplementaryProblems ()
 creating copies of the original problem that will be manipulated to form the reduced and complementary problems
 
void _formDecompReducedProblem (bool &stop)
 forms the reduced problem
 
void _solveDecompReducedProblem ()
 solves the reduced problem
 
void _formDecompComplementaryProblem ()
 forms the complementary problem
 
void _decompSimplifyAndSolve (SPxSolverBase< R > &solver, SLUFactor< R > &sluFactor, bool fromScratch, bool applyPreprocessing)
 simplifies the problem and solves
 
void _decompResolveWithoutPreprocessing (SPxSolverBase< R > &solver, SLUFactor< R > &sluFactor, typename SPxSimplifier< R >::Result result)
 loads original problem into solver and solves again after it has been solved to optimality with preprocessing
 
void _getZeroDualMultiplierIndices (VectorBase< R > feasVector, int *nonposind, int *colsforremoval, int *nnonposind, bool &stop)
 identifies the columns of the row-form basis that correspond to rows with zero dual multipliers.
 
void _getCompatibleColumns (VectorBase< R > feasVector, int *nonposind, int *compatind, int *rowsforremoval, int *colsforremoval, int nnonposind, int *ncompatind, bool formRedProb, bool &stop)
 retrieves the compatible columns from the constraint matrix
 
void _computeReducedProbObjCoeff (bool &stop)
 computes the reduced problem objective coefficients
 
void _getCompatibleBoundCons (LPRowSetBase< R > &boundcons, int *compatboundcons, int *nonposind, int *ncompatboundcons, int nnonposind, bool &stop)
 computes the compatible bound constraints and adds them to the reduced problem
 
void _getRowsForRemovalComplementaryProblem (int *nonposind, int *bind, int *rowsforremoval, int *nrowsforremoval, int nnonposind)
 computes the rows to remove from the complementary problem
 
void _deleteAndUpdateRowsComplementaryProblem (SPxRowId rangedRowIds[], int &naddedrows)
 removing rows from the complementary problem.
 
void _evaluateSolutionDecomp (SPxSolverBase< R > &solver, SLUFactor< R > &sluFactor, typename SPxSimplifier< R >::Result result)
 evaluates the solution of the reduced problem for the DBDS
 
void _updateDecompReducedProblem (R objVal, VectorBase< R > dualVector, VectorBase< R > redcostVector, VectorBase< R > compPrimalVector, VectorBase< R > compDualVector)
 update the reduced problem with additional columns and rows
 
void _updateDecompReducedProblemViol (bool allrows)
 update the reduced problem with additional columns and rows based upon the violated original bounds and rows
 
void _findViolatedRows (R compObjValue, Array< RowViolation > &violatedrows, int &nviolatedrows)
 builds the update rows with those violated in the complmentary problem
 
void _updateDecompComplementaryDualProblem (bool origObj)
 update the dual complementary problem with additional columns and rows
 
void _updateDecompComplementaryPrimalProblem (bool origObj)
 update the primal complementary problem with additional columns and rows
 
void _checkOriginalProblemOptimality (VectorBase< R > primalVector, bool printViol)
 checking the optimality of the original problem.
 
void _updateComplementaryDualSlackColCoeff ()
 updating the slack column coefficients to adjust for equality constraints
 
void _updateComplementaryPrimalSlackColCoeff ()
 updating the slack column coefficients to adjust for equality constraints
 
void _removeComplementaryDualFixedPrimalVars (int *currFixedVars)
 removing the dual columns related to the fixed variables
 
void _identifyComplementaryDualFixedPrimalVars (int *currFixedVars)
 removing the dual columns related to the fixed variables
 
void _updateComplementaryDualFixedPrimalVars (int *currFixedVars)
 updating the dual columns related to the fixed primal variables.
 
void _identifyComplementaryPrimalFixedPrimalVars (int *currFixedVars)
 removing the dual columns related to the fixed variables
 
void _updateComplementaryPrimalFixedPrimalVars (int *currFixedVars)
 updating the dual columns related to the fixed primal variables.
 
void _setComplementaryDualOriginalObjective ()
 updating the complementary dual problem with the original objective function
 
void _setComplementaryPrimalOriginalObjective ()
 updating the complementary primal problem with the original objective function
 
int getOrigVarFixedDirection (int colNum)
 determining which bound the primal variables will be fixed to.
 
bool checkBasisDualFeasibility (VectorBase< R > feasVec)
 checks the dual feasibility of the current basis
 
DualSign getExpectedDualVariableSign (int rowNumber)
 returns the expected sign of the dual variables for the reduced problem
 
DualSign getOrigProbDualVariableSign (int rowNumber)
 returns the expected sign of the dual variables for the original problem
 
void printDecompDisplayLine (SPxSolverBase< R > &solver, const SPxOut::Verbosity origVerb, bool force, bool forceHead)
 prints a display line of the flying table for the DBDS
 
void getOriginalProblemStatistics ()
 stores the problem statistics of the original problem
 
void printOriginalProblemStatistics (std::ostream &os)
 stores the problem statistics of the original problem
 
R getCompSlackVarCoeff (int primalRowNum)
 gets the coefficient of the slack variable in the primal complementary problem
 
bool getDecompBoundViolation (R &maxviol, R &sumviol)
 gets violation of bounds; returns true on success
 
bool getDecompRowViolation (R &maxviol, R &sumviol)
 gets violation of constraints; returns true on success
 
bool decompTerminate (R timeLimit)
 function call to terminate the decomposition simplex
 
void _writeOriginalProblemBasis (const char *filename, NameSet *rowNames, NameSet *colNames, bool cpxFormat)
 function to build a basis for the original problem as given by the solution to the reduced problem
 
void getOriginalProblemBasisRowStatus (DataArray< int > &degenerateRowNums, DataArray< typename SPxSolverBase< R >::VarStatus > &degenerateRowStatus, int &nDegenerateRows, int &nNonBasicRows)
 function to retrieve the original problem row basis status from the reduced and complementary problems
 
void getOriginalProblemBasisColStatus (int &nNonBasicCols)
 function to retrieve the column status for the original problem basis from the reduced and complementary problems
 

Private Attributes

Statistics on solving process
Statistics_statistics
 statistics since last call to solveReal() or solveRational()
 
Parameter settings
Settings_currentSettings
 
Rational _rationalPosInfty
 
Rational _rationalNegInfty
 
Rational _rationalFeastol
 
Rational _rationalOpttol
 
Rational _rationalMaxscaleincr
 
Data for the real LP
SPxSolverBase< R_solver
 
SLUFactor< R_slufactor
 
SPxMainSM< R_simplifierMainSM
 
Presol< R_simplifierPaPILO
 
SPxEquiliSC< R_scalerUniequi
 
SPxEquiliSC< R_scalerBiequi
 
SPxGeometSC< R_scalerGeo1
 
SPxGeometSC< R_scalerGeo8
 
SPxGeometSC< R_scalerGeoequi
 
SPxLeastSqSC< R_scalerLeastsq
 
SPxWeightST< R_starterWeight
 
SPxSumST< R_starterSum
 
SPxVectorST< R_starterVector
 
SPxAutoPR< R_pricerAuto
 
SPxDantzigPR< R_pricerDantzig
 
SPxParMultPR< R_pricerParMult
 
SPxDevexPR< R_pricerDevex
 
SPxSteepPR< R_pricerQuickSteep
 
SPxSteepExPR< R_pricerSteep
 
SPxDefaultRT< R_ratiotesterTextbook
 
SPxHarrisRT< R_ratiotesterHarris
 
SPxFastRT< R_ratiotesterFast
 
SPxBoundFlippingRT< R_ratiotesterBoundFlipping
 
SPxLPBase< R > * _realLP
 
SPxLPBase< R > * _decompLP
 
SPxSimplifier< R > * _simplifier
 
SPxScaler< R > * _scaler
 
SPxStarter< R > * _starter
 
bool _isRealLPLoaded
 
bool _isRealLPScaled
 
bool _applyPolishing
 
VectorBase< R_manualLower
 
VectorBase< R_manualUpper
 
VectorBase< R_manualLhs
 
VectorBase< R_manualRhs
 
VectorBase< R_manualObj
 
SPxLPBase< R_manualRealLP
 
Solution data
SPxSolverBase< R >::Status _status
 
int _lastSolveMode
 
DataArray< typename SPxSolverBase< R >::VarStatus > _basisStatusRows
 
DataArray< typename SPxSolverBase< R >::VarStatus > _basisStatusCols
 
SolBase< R_solReal
 
SolRational _solRational
 
SolRational _workSol
 
bool _hasBasis
 
bool _hasSolReal
 
bool _hasSolRational
 

Parameters

enum  BoolParam {
  LIFTING = 0 , EQTRANS = 1 , TESTDUALINF = 2 , RATFAC = 3 ,
  USEDECOMPDUALSIMPLEX = 4 , COMPUTEDEGEN = 5 , USECOMPDUAL = 6 , EXPLICITVIOL = 7 ,
  ACCEPTCYCLING = 8 , RATREC = 9 , POWERSCALING = 10 , RATFACJUMP = 11 ,
  ROWBOUNDFLIPS = 12 , PERSISTENTSCALING = 13 , FULLPERTURBATION = 14 , ENSURERAY = 15 ,
  FORCEBASIC = 16 , BOOLPARAM_COUNT = 17
}
 boolean parameters More...
 
enum  IntParam {
  OBJSENSE = 0 , REPRESENTATION = 1 , ALGORITHM = 2 , FACTOR_UPDATE_TYPE = 3 ,
  FACTOR_UPDATE_MAX = 4 , ITERLIMIT = 5 , REFLIMIT = 6 , STALLREFLIMIT = 7 ,
  DISPLAYFREQ = 8 , VERBOSITY = 9 , SIMPLIFIER = 10 , SCALER = 11 ,
  STARTER = 12 , PRICER = 13 , RATIOTESTER = 14 , SYNCMODE = 15 ,
  READMODE = 16 , SOLVEMODE = 17 , CHECKMODE = 18 , TIMER = 19 ,
  HYPER_PRICING = 20 , RATFAC_MINSTALLS = 21 , LEASTSQ_MAXROUNDS = 22 , SOLUTION_POLISHING = 23 ,
  DECOMP_ITERLIMIT = 24 , DECOMP_MAXADDEDROWS = 25 , DECOMP_DISPLAYFREQ = 26 , DECOMP_VERBOSITY = 27 ,
  PRINTBASISMETRIC = 28 , STATTIMER = 29 , INTPARAM_COUNT = 30
}
 integer parameters More...
 
enum  { OBJSENSE_MINIMIZE = -1 , OBJSENSE_MAXIMIZE = 1 }
 values for parameter OBJSENSE More...
 
enum  { REPRESENTATION_AUTO = 0 , REPRESENTATION_COLUMN = 1 , REPRESENTATION_ROW = 2 }
 values for parameter REPRESENTATION More...
 
enum  { ALGORITHM_PRIMAL = 0 , ALGORITHM_DUAL = 1 }
 values for parameter ALGORITHM More...
 
enum  { FACTOR_UPDATE_TYPE_ETA = 0 , FACTOR_UPDATE_TYPE_FT = 1 }
 values for parameter FACTOR_UPDATE_TYPE More...
 
enum  {
  VERBOSITY_ERROR = 0 , VERBOSITY_WARNING = 1 , VERBOSITY_DEBUG = 2 , VERBOSITY_NORMAL = 3 ,
  VERBOSITY_HIGH = 4 , VERBOSITY_FULL = 5
}
 values for parameter VERBOSITY More...
 
enum  { SIMPLIFIER_OFF = 0 , SIMPLIFIER_INTERNAL = 3 , SIMPLIFIER_PAPILO = 2 , SIMPLIFIER_AUTO = 1 }
 values for parameter SIMPLIFIER More...
 
enum  {
  SCALER_OFF = 0 , SCALER_UNIEQUI = 1 , SCALER_BIEQUI = 2 , SCALER_GEO1 = 3 ,
  SCALER_GEO8 = 4 , SCALER_LEASTSQ = 5 , SCALER_GEOEQUI = 6
}
 values for parameter SCALER More...
 
enum  { STARTER_OFF = 0 , STARTER_WEIGHT = 1 , STARTER_SUM = 2 , STARTER_VECTOR = 3 }
 values for parameter STARTER More...
 
enum  {
  PRICER_AUTO = 0 , PRICER_DANTZIG = 1 , PRICER_PARMULT = 2 , PRICER_DEVEX = 3 ,
  PRICER_QUICKSTEEP = 4 , PRICER_STEEP = 5
}
 values for parameter PRICER More...
 
enum  { RATIOTESTER_TEXTBOOK = 0 , RATIOTESTER_HARRIS = 1 , RATIOTESTER_FAST = 2 , RATIOTESTER_BOUNDFLIPPING = 3 }
 values for parameter RATIOTESTER More...
 
enum  { SYNCMODE_ONLYREAL = 0 , SYNCMODE_AUTO = 1 , SYNCMODE_MANUAL = 2 }
 values for parameter SYNCMODE More...
 
enum  { READMODE_REAL = 0 , READMODE_RATIONAL = 1 }
 values for parameter READMODE More...
 
enum  { SOLVEMODE_REAL = 0 , SOLVEMODE_AUTO = 1 , SOLVEMODE_RATIONAL = 2 }
 values for parameter SOLVEMODE More...
 
enum  { CHECKMODE_REAL = 0 , CHECKMODE_AUTO = 1 , CHECKMODE_RATIONAL = 2 }
 values for parameter CHECKMODE More...
 
enum  { TIMER_OFF = 0 , TIMER_CPU = 1 , TIMER_WALLCLOCK = 2 }
 values for parameter TIMER More...
 
enum  { HYPER_PRICING_OFF = 0 , HYPER_PRICING_AUTO = 1 , HYPER_PRICING_ON = 2 }
 values for parameter HYPER_PRICING More...
 
enum  { POLISHING_OFF = 0 , POLISHING_INTEGRALITY = 1 , POLISHING_FRACTIONALITY = 2 }
 values for parameter SOLUTION_POLISHING More...
 
enum  RealParam {
  FEASTOL = 0 , OPTTOL = 1 , EPSILON_ZERO = 2 , EPSILON_FACTORIZATION = 3 ,
  EPSILON_UPDATE = 4 , EPSILON_PIVOT = 5 , INFTY = 6 , TIMELIMIT = 7 ,
  OBJLIMIT_LOWER = 8 , OBJLIMIT_UPPER = 9 , FPFEASTOL = 10 , FPOPTTOL = 11 ,
  MAXSCALEINCR = 12 , LIFTMINVAL = 13 , LIFTMAXVAL = 14 , SPARSITY_THRESHOLD = 15 ,
  REPRESENTATION_SWITCH = 16 , RATREC_FREQ = 17 , MINRED = 18 , REFAC_BASIS_NNZ = 19 ,
  REFAC_UPDATE_FILL = 20 , REFAC_MEM_FACTOR = 21 , LEASTSQ_ACRCY = 22 , OBJ_OFFSET = 23 ,
  MIN_MARKOWITZ = 24 , SIMPLIFIER_MODIFYROWFAC = 25 , REALPARAM_COUNT = 26
}
 real parameters More...
 
SPxOut spxout
 
bool boolParam (const BoolParam param) const
 returns boolean parameter value
 
int intParam (const IntParam param) const
 returns integer parameter value
 
Real realParam (const RealParam param) const
 returns real parameter value
 
const Settingssettings () const
 returns current parameter settings
 
bool setBoolParam (const BoolParam param, const bool value, const bool init=true)
 sets boolean parameter value; returns true on success
 
bool setIntParam (const IntParam param, const int value, const bool init=true)
 sets integer parameter value; returns true on success
 
bool setRealParam (const RealParam param, const Real value, const bool init=true)
 sets real parameter value; returns true on success
 
bool setSettings (const Settings &newSettings, const bool init=true)
 sets parameter settings; returns true on success
 
void resetSettings (const bool quiet=false, const bool init=true)
 resets default parameter settings
 
void printUserSettings ()
 print non-default parameter values
 
bool saveSettingsFile (const char *filename, const bool onlyChanged=false, int solvemode=1) const
 writes settings file; returns true on success
 
bool loadSettingsFile (const char *filename)
 reads settings file; returns true on success
 
bool parseSettingsString (char *str)
 parses one setting string and returns true on success; note that string is modified
 

Data for the rational LP

enum  RangeType {
  RANGETYPE_FREE = 0 , RANGETYPE_LOWER = 1 , RANGETYPE_UPPER = 2 , RANGETYPE_BOXED = 3 ,
  RANGETYPE_FIXED = 4
}
 type of bounds and sides More...
 
SPxLPRational_rationalLP
 
SLUFactorRational _rationalLUSolver
 
DataArray< int_rationalLUSolverBind
 
LPColSetRational _slackCols
 
VectorRational _unboundedLower
 
VectorRational _unboundedUpper
 
VectorRational _unboundedLhs
 
VectorRational _unboundedRhs
 
DSVectorRational _tauColVector
 
VectorRational _feasObj
 
VectorRational _feasLhs
 
VectorRational _feasRhs
 
VectorRational _feasLower
 
VectorRational _feasUpper
 
VectorRational _modLower
 
VectorRational _modUpper
 
VectorRational _modLhs
 
VectorRational _modRhs
 
VectorRational _modObj
 
DSVectorRational _primalDualDiff
 
DataArray< typename SPxSolverBase< R >::VarStatus > _storedBasisStatusRows
 
DataArray< typename SPxSolverBase< R >::VarStatus > _storedBasisStatusCols
 
Array< UnitVectorRational * > _unitMatrixRational
 
bool _storedBasis
 
int _beforeLiftRows
 
int _beforeLiftCols
 
DataArray< RangeType_colTypes
 
DataArray< RangeType_rowTypes
 

Data for the Decomposition Based Dual Simplex

enum  decompStatus { DECOMP_ORIG = 0 , DECOMP_RED = 1 , DECOMP_COMP = 2 }
 
enum  DualSign { IS_POS = 0 , IS_NEG = 1 , IS_FREE = 2 }
 
SPxSolverBase< R_compSolver
 
SLUFactor< R_compSlufactor
 
SPxBasisBase< R_decompTransBasis
 
VectorBase< R_transformedObj
 
VectorBase< R_decompFeasVector
 
LPRowSetBase< R_transformedRows
 
SPxColId _compSlackColId
 
SPxRowId _compSlackDualRowId
 
bool_decompReducedProbRows
 
bool_decompReducedProbCols
 
int_decompRowStatus
 
int_decompColStatus
 
int_decompCompProbColIDsIdx
 
DataArray< SPxRowId_decompReducedProbRowIDs
 
DataArray< SPxRowId_decompReducedProbColRowIDs
 
DataArray< SPxColId_decompReducedProbColIDs
 
DataArray< SPxRowId_decompPrimalRowIDs
 
DataArray< SPxColId_decompPrimalColIDs
 
DataArray< SPxRowId_decompElimPrimalRowIDs
 
DataArray< SPxRowId_decompDualRowIDs
 
DataArray< SPxColId_decompDualColIDs
 
DataArray< SPxColId_decompFixedVarDualIDs
 
DataArray< SPxColId_decompVarBoundDualIDs
 
DataArray< SPxColId_decompCompPrimalFixedVarIDs
 
DataArray< SPxColId_decompCompPrimalVarBoundIDs
 
DataArray< SPxRowId_decompCompPrimalRowIDs
 
DataArray< SPxColId_decompCompPrimalColIDs
 
int _nDecompViolBounds
 
int _nDecompViolRows
 
int_decompViolatedBounds
 
int_decompViolatedRows
 
int_fixedOrigVars
 
int _nPrimalRows
 
int _nPrimalCols
 
int _nElimPrimalRows
 
int _nDualRows
 
int _nDualCols
 
int _nCompPrimalRows
 
int _nCompPrimalCols
 
int _decompDisplayLine
 
NameSet_rowNames
 
NameSet_colNames
 
int numIncludedRows
 
int numDecompIter
 
int numRedProbIter
 
int numCompProbIter
 
int numProbRows
 
int numProbCols
 
int nNonzeros
 
R minAbsNonzero
 
R maxAbsNonzero
 
int origCountLower
 
int origCountUpper
 
int origCountBoxed
 
int origCountFreeCol
 
int origCountEqual
 
int origCountLhs
 
int origCountRhs
 
int origCountRanged
 
int origCountFreeRow
 
decompStatus _currentProb
 

Miscellaneous

int _optimizeCalls
 
int _unscaleCalls
 
Rational _rationalPosone
 
Rational _rationalNegone
 
Rational _rationalZero
 
void printVersion () const
 prints version and compilation options
 
bool areLPsInSync (const bool checkVecVals=true, const bool checkMatVals=false, const bool quiet=false) const
 checks if real LP and rational LP are in sync; dimensions will always be compared, vector and matrix values only if the respective parameter is set to true. If quiet is set to true the function will only display which vectors are different.
 
void setRandomSeed (unsigned int seed)
 set the random seeds of the solver instance
 
unsigned int randomSeed () const
 returns the current random seed of the solver instance
 

Detailed Description

template<class R>
class soplex::SoPlexBase< R >

Definition at line 120 of file soplex.h.

Member Enumeration Documentation

◆ anonymous enum

template<class R >
anonymous enum

values for parameter OBJSENSE

Enumerator
OBJSENSE_MINIMIZE 

minimization

OBJSENSE_MAXIMIZE 

maximization

Definition at line 1098 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter REPRESENTATION

Enumerator
REPRESENTATION_AUTO 

automatic choice according to number of rows and columns

REPRESENTATION_COLUMN 

column representation Ax - s = 0, lower <= x <= upper, lhs <= s <= rhs

REPRESENTATION_ROW 

row representation (lower,lhs) <= (x,Ax) <= (upper,rhs)

Definition at line 1108 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter SYNCMODE

Enumerator
SYNCMODE_ONLYREAL 

store only real LP

SYNCMODE_AUTO 

automatic sync of real and rational LP

SYNCMODE_MANUAL 

user sync of real and rational LP

Definition at line 1258 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter READMODE

Enumerator
READMODE_REAL 

standard floating-point parsing

READMODE_RATIONAL 

rational parsing

Definition at line 1271 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter SOLVEMODE

Enumerator
SOLVEMODE_REAL 

apply standard floating-point algorithm

SOLVEMODE_AUTO 

decide depending on tolerances whether to apply iterative refinement

SOLVEMODE_RATIONAL 

force iterative refinement

Definition at line 1281 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter CHECKMODE

Enumerator
CHECKMODE_REAL 

floating-point check

CHECKMODE_AUTO 

decide according to READMODE

CHECKMODE_RATIONAL 

rational check

Definition at line 1294 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter TIMER

Enumerator
TIMER_OFF 

disable timing

TIMER_CPU 

cpu or user time

TIMER_WALLCLOCK 

wallclock time

Definition at line 1307 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter HYPER_PRICING

Enumerator
HYPER_PRICING_OFF 

never

HYPER_PRICING_AUTO 

decide according to problem size

HYPER_PRICING_ON 

always

Definition at line 1320 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter SOLUTION_POLISHING

Enumerator
POLISHING_OFF 

no solution polishing

POLISHING_INTEGRALITY 

maximize number of basic slack variables, i.e. more variables on bounds

POLISHING_FRACTIONALITY 

minimize number of basic slack variables, i.e. more variables between bounds

Definition at line 1333 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter ALGORITHM

Enumerator
ALGORITHM_PRIMAL 

primal simplex algorithm, i.e., entering for column and leaving for row representation

ALGORITHM_DUAL 

dual simplex algorithm, i.e., leaving for column and entering for row representation

Definition at line 1121 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter FACTOR_UPDATE_TYPE

Enumerator
FACTOR_UPDATE_TYPE_ETA 

product form update

FACTOR_UPDATE_TYPE_FT 

Forrest-Tomlin type update.

Definition at line 1131 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter VERBOSITY

Enumerator
VERBOSITY_ERROR 

only error output

VERBOSITY_WARNING 

only error and warning output

VERBOSITY_DEBUG 

only error, warning, and debug output

VERBOSITY_NORMAL 

standard verbosity level

VERBOSITY_HIGH 

high verbosity level

VERBOSITY_FULL 

full verbosity level

Definition at line 1141 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter SIMPLIFIER

Enumerator
SIMPLIFIER_OFF 

disabling presolving

SIMPLIFIER_INTERNAL 

using internal presolving methods

SIMPLIFIER_PAPILO 

using the presolve lib papilo

SIMPLIFIER_AUTO 

SoPlex chooses automatically (currently always "internal")

Definition at line 1163 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter SCALER

Enumerator
SCALER_OFF 

no scaler

SCALER_UNIEQUI 

equilibrium scaling on rows or columns

SCALER_BIEQUI 

equilibrium scaling on rows and columns

SCALER_GEO1 

geometric mean scaling on rows and columns, max 1 round

SCALER_GEO8 

geometric mean scaling on rows and columns, max 8 rounds

SCALER_LEASTSQ 

least square scaling

SCALER_GEOEQUI 

geometric mean scaling (max 8 rounds) followed by equilibrium scaling (rows and columns)

Definition at line 1179 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter STARTER

Enumerator
STARTER_OFF 

slack basis

STARTER_WEIGHT 

greedy crash basis weighted by objective, bounds, and sides

STARTER_SUM 

crash basis from a greedy solution

STARTER_VECTOR 

generic solution-based crash basis

Definition at line 1204 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter PRICER

Enumerator
PRICER_AUTO 

automatic pricer

PRICER_DANTZIG 

Dantzig pricer.

PRICER_PARMULT 

partial multiple pricer based on Dantzig pricing

PRICER_DEVEX 

devex pricer

PRICER_QUICKSTEEP 

steepest edge pricer with initialization to unit norms

PRICER_STEEP 

steepest edge pricer with exact initialization of norms

Definition at line 1220 of file soplex.h.

◆ anonymous enum

template<class R >
anonymous enum

values for parameter RATIOTESTER

Enumerator
RATIOTESTER_TEXTBOOK 

textbook ratio test without stabilization

RATIOTESTER_HARRIS 

standard Harris ratio test

RATIOTESTER_FAST 

modified Harris ratio test

RATIOTESTER_BOUNDFLIPPING 

bound flipping ratio test for long steps in the dual simplex

Definition at line 1242 of file soplex.h.

◆ BoolParam

template<class R >
enum BoolParam

boolean parameters

Enumerator
LIFTING 

should lifting be used to reduce range of nonzero matrix coefficients?

EQTRANS 

should LP be transformed to equality form before a rational solve?

TESTDUALINF 

should dual infeasibility be tested in order to try to return a dual solution even if primal infeasible?

RATFAC 

should a rational factorization be performed after iterative refinement?

USEDECOMPDUALSIMPLEX 

should the decomposition based dual simplex be used to solve the LP? Setting this to true forces the solve mode to SOLVEMODE_REAL and the basis representation to REPRESENTATION_ROW

COMPUTEDEGEN 

should the degeneracy be computed for each basis?

USECOMPDUAL 

should the dual of the complementary problem be used in the decomposition simplex?

EXPLICITVIOL 

should row and bound violations be computed explicitly in the update of reduced problem in the decomposition simplex

ACCEPTCYCLING 

should cycling solutions be accepted during iterative refinement?

RATREC 

apply rational reconstruction after each iterative refinement?

POWERSCALING 

round scaling factors for iterative refinement to powers of two?

RATFACJUMP 

continue iterative refinement with exact basic solution if not optimal?

ROWBOUNDFLIPS 

use bound flipping also for row representation?

PERSISTENTSCALING 

use persistent scaling?

FULLPERTURBATION 

perturb the entire problem or only the relevant bounds of s single pivot?

ENSURERAY 

re-optimize the original problem to get a proof (ray) of infeasibility/unboundedness?

FORCEBASIC 

try to enforce that the optimal solution is a basic solutiong

BOOLPARAM_COUNT 

number of boolean parameters

Definition at line 942 of file soplex.h.

◆ decompStatus

template<class R >
enum decompStatus
private
Enumerator
DECOMP_ORIG 
DECOMP_RED 
DECOMP_COMP 

Definition at line 1797 of file soplex.h.

◆ DualSign

template<class R >
enum DualSign
private
Enumerator
IS_POS 
IS_NEG 
IS_FREE 

Definition at line 1810 of file soplex.h.

◆ IntParam

template<class R >
enum IntParam

integer parameters

Enumerator
OBJSENSE 

objective sense

REPRESENTATION 

type of computational form, i.e., column or row representation

ALGORITHM 

type of algorithm, i.e., primal or dual

FACTOR_UPDATE_TYPE 

type of LU update

FACTOR_UPDATE_MAX 

maximum number of updates without fresh factorization

ITERLIMIT 

iteration limit (-1 if unlimited)

REFLIMIT 

refinement limit (-1 if unlimited)

STALLREFLIMIT 

stalling refinement limit (-1 if unlimited)

DISPLAYFREQ 

display frequency

VERBOSITY 

verbosity level

SIMPLIFIER 

type of simplifier

SCALER 

type of scaler

STARTER 

type of starter used to create crash basis

PRICER 

type of pricer

RATIOTESTER 

type of ratio test

SYNCMODE 

mode for synchronizing real and rational LP

READMODE 

mode for reading LP files

SOLVEMODE 

mode for iterative refinement strategy

CHECKMODE 

mode for a posteriori feasibility checks

TIMER 

type of timer

HYPER_PRICING 

mode for hyper sparse pricing

RATFAC_MINSTALLS 

minimum number of stalling refinements since last pivot to trigger rational factorization

LEASTSQ_MAXROUNDS 

maximum number of conjugate gradient iterations in least square scaling

SOLUTION_POLISHING 

mode for solution polishing

DECOMP_ITERLIMIT 

the number of iterations before the decomposition simplex initialisation is terminated.

DECOMP_MAXADDEDROWS 

the maximum number of rows that are added in each iteration of the decomposition based simplex

DECOMP_DISPLAYFREQ 

the iteration frequency at which the decomposition solve output is displayed.

DECOMP_VERBOSITY 

the verbosity of the decomposition based simplex

PRINTBASISMETRIC 

print condition number during the solve

STATTIMER 

type of timer for statistics

INTPARAM_COUNT 

number of integer parameters

Definition at line 1001 of file soplex.h.

◆ RangeType

template<class R >
enum RangeType
private

type of bounds and sides

Enumerator
RANGETYPE_FREE 

both bounds are infinite

RANGETYPE_LOWER 

lower bound is finite, upper bound is infinite

RANGETYPE_UPPER 

upper bound is finite, lower bound is infinite

RANGETYPE_BOXED 

lower and upper bound finite, but different

RANGETYPE_FIXED 

lower bound equals upper bound

Definition at line 1738 of file soplex.h.

◆ RealParam

template<class R >
enum RealParam

real parameters

Enumerator
FEASTOL 

primal feasibility tolerance

OPTTOL 

dual feasibility tolerance

EPSILON_ZERO 

general zero tolerance

EPSILON_FACTORIZATION 

zero tolerance used in factorization

EPSILON_UPDATE 

zero tolerance used in update of the factorization

EPSILON_PIVOT 

pivot zero tolerance used in factorization

INFTY 

infinity threshold

TIMELIMIT 

time limit in seconds (INFTY if unlimited)

OBJLIMIT_LOWER 

lower limit on objective value

OBJLIMIT_UPPER 

upper limit on objective value

FPFEASTOL 

working tolerance for feasibility in floating-point solver during iterative refinement

FPOPTTOL 

working tolerance for optimality in floating-point solver during iterative refinement

MAXSCALEINCR 

maximum increase of scaling factors between refinements

LIFTMINVAL 

lower threshold in lifting (nonzero matrix coefficients with smaller absolute value will be reformulated)

LIFTMAXVAL 

upper threshold in lifting (nonzero matrix coefficients with larger absolute value will be reformulated)

SPARSITY_THRESHOLD 

sparse pricing threshold (#violations < dimension * SPARSITY_THRESHOLD activates sparse pricing)

REPRESENTATION_SWITCH 

threshold on number of rows vs. number of columns for switching from column to row representations in auto mode

RATREC_FREQ 

geometric frequency at which to apply rational reconstruction

MINRED 

minimal reduction (sum of removed rows/cols) to continue simplification

REFAC_BASIS_NNZ 

refactor threshold for nonzeros in last factorized basis matrix compared to updated basis matrix

REFAC_UPDATE_FILL 

refactor threshold for fill-in in current factor update compared to fill-in in last factorization

REFAC_MEM_FACTOR 

refactor threshold for memory growth in factorization since last refactorization

LEASTSQ_ACRCY 

accuracy of conjugate gradient method in least squares scaling (higher value leads to more iterations)

OBJ_OFFSET 

objective offset

MIN_MARKOWITZ 

minimal Markowitz threshold to control sparsity/stability in LU factorization

SIMPLIFIER_MODIFYROWFAC 

minimal modification threshold to apply presolve reductions

REALPARAM_COUNT 

number of real parameters

Definition at line 1346 of file soplex.h.

Constructor & Destructor Documentation

◆ SoPlexBase() [1/2]

template<class R >
SoPlexBase ( )

default constructor

◆ SoPlexBase() [2/2]

template<class R >
SoPlexBase ( const SoPlexBase< R > & rhs)

copy constructor

◆ ~SoPlexBase()

template<class R >
virtual ~SoPlexBase ( )
virtual

destructor

Member Function Documentation

◆ _addColReal() [1/2]

template<class R >
void _addColReal ( const LPColReal & lpcol)
private

adds a single column to the real LP and adjusts basis

◆ _addColReal() [2/2]

template<class R >
void _addColReal ( R obj,
R lower,
const SVectorBase< R > & lpcol,
R upper )
private

adds a single column to the real LP and adjusts basis

◆ _addColsReal()

template<class R >
void _addColsReal ( const LPColSetReal & lpcolset)
private

adds multiple columns to the real LP and adjusts basis

◆ _addRowReal() [1/2]

template<class R >
void _addRowReal ( const LPRowBase< R > & lprow)
private

adds a single row to the real LP and adjusts basis

◆ _addRowReal() [2/2]

template<class R >
void _addRowReal ( R lhs,
const SVectorBase< R > & lprow,
R rhs )
private

adds a single row to the real LP and adjusts basis

◆ _addRowsReal()

template<class R >
void _addRowsReal ( const LPRowSetBase< R > & lprowset)
private

adds multiple rows to the real LP and adjusts basis

◆ _changeBoundsReal() [1/2]

template<class R >
void _changeBoundsReal ( const VectorBase< R > & lower,
const VectorBase< R > & upper )
private

changes vectors of column bounds to lower and upper and adjusts basis

◆ _changeBoundsReal() [2/2]

template<class R >
void _changeBoundsReal ( int i,
const R & lower,
const R & upper )
private

changes bounds of column i to lower and upper and adjusts basis

◆ _changeColReal()

template<class R >
void _changeColReal ( int i,
const LPColReal & lpcol )
private

replaces column i with lpcol and adjusts basis

◆ _changeElementReal()

template<class R >
void _changeElementReal ( int i,
int j,
const R & val )
private

changes matrix entry in row i and column j to val and adjusts basis

◆ _changeLhsReal() [1/2]

template<class R >
void _changeLhsReal ( const VectorBase< R > & lhs)
private

changes left-hand side vector for constraints to lhs and adjusts basis

◆ _changeLhsReal() [2/2]

template<class R >
void _changeLhsReal ( int i,
const R & lhs )
private

changes left-hand side of row i to lhs and adjusts basis

◆ _changeLowerReal() [1/2]

template<class R >
void _changeLowerReal ( const VectorBase< R > & lower)
private

changes vector of lower bounds to lower and adjusts basis

◆ _changeLowerReal() [2/2]

template<class R >
void _changeLowerReal ( int i,
const R & lower )
private

changes lower bound of column i to lower and adjusts basis

◆ _changeRangeReal() [1/2]

template<class R >
void _changeRangeReal ( const VectorBase< R > & lhs,
const VectorBase< R > & rhs )
private

changes left- and right-hand side vectors and adjusts basis

◆ _changeRangeReal() [2/2]

template<class R >
void _changeRangeReal ( int i,
const R & lhs,
const R & rhs )
private

changes left- and right-hand side of row i and adjusts basis

◆ _changeRhsReal() [1/2]

template<class R >
void _changeRhsReal ( const VectorBase< R > & rhs)
private

changes right-hand side vector to rhs and adjusts basis

◆ _changeRhsReal() [2/2]

template<class R >
void _changeRhsReal ( int i,
const R & rhs )
private

changes right-hand side of row i to rhs and adjusts basis

◆ _changeRowReal()

template<class R >
void _changeRowReal ( int i,
const LPRowBase< R > & lprow )
private

replaces row i with lprow and adjusts basis

◆ _changeUpperReal() [1/2]

template<class R >
void _changeUpperReal ( const VectorBase< R > & upper)
private

changes vector of upper bounds to upper and adjusts basis

◆ _changeUpperReal() [2/2]

template<class R >
void _changeUpperReal ( int i,
const R & upper )
private

changes i 'th upper bound to upper and adjusts basis

◆ _checkBasisScaling()

template<class R >
void _checkBasisScaling ( )
private

check correctness of (un)scaled basis matrix operations

◆ _checkOriginalProblemOptimality()

template<class R >
void _checkOriginalProblemOptimality ( VectorBase< R > primalVector,
bool printViol )
private

checking the optimality of the original problem.

◆ _checkScaling()

template<class R >
void _checkScaling ( SPxLPBase< R > * origLP) const
private

check scaling of LP

◆ _completeRangeTypesRational()

template<class R >
void _completeRangeTypesRational ( )
private

completes range type arrays after adding columns and/or rows

◆ _computeBasisInverseRational()

template<class R >
void _computeBasisInverseRational ( )
private

computes rational inverse of basis matrix as defined by _rationalLUSolverBind

◆ _computeInfeasBox()

template<class R >
void _computeInfeasBox ( SolRational & sol,
bool transformed )
private

computes radius of infeasibility box implied by an approximate Farkas' proof

Given constraints of the form \( lhs <= Ax <= rhs \), a farkas proof y should satisfy \( y^T A = 0 \) and \( y_+^T lhs - y_-^T rhs > 0 \), where \( y_+, y_- \) denote the positive and negative parts of \( y \). If \( y \) is approximate, it may not satisfy \( y^T A = 0 \) exactly, but the proof is still valid as long as the following holds for all potentially feasible \( x \):

\[ y^T Ax < (y_+^T lhs - y_-^T rhs) (*) \]

we may therefore calculate \( y^T A \) and \( y_+^T lhs - y_-^T rhs \) exactly and check if the upper and lower bounds on \( x \) imply that all feasible \( x \) satisfy (*), and if not then compute bounds on \( x \) to guarantee (*). The simplest way to do this is to compute

\[ B = (y_+^T lhs - y_-^T rhs) / \sum_i(|(y^T A)_i|) \]

noting that if every component of \( x \) has \( |x_i| < B \), then (*) holds.

\( B \) can be increased by iteratively including variable bounds smaller than \( B \). The speed of this method can be further improved by using interval arithmetic for all computations. For related information see Sec. 4 of Neumaier and Shcherbina, Mathematical Programming A, 2004.

Set transformed to true if this method is called after _transformFeasibility().

◆ _computeReducedProbObjCoeff()

template<class R >
void _computeReducedProbObjCoeff ( bool & stop)
private

computes the reduced problem objective coefficients

◆ _createDecompReducedAndComplementaryProblems()

template<class R >
void _createDecompReducedAndComplementaryProblems ( )
private

creating copies of the original problem that will be manipulated to form the reduced and complementary problems

◆ _decompResolveWithoutPreprocessing()

template<class R >
void _decompResolveWithoutPreprocessing ( SPxSolverBase< R > & solver,
SLUFactor< R > & sluFactor,
typename SPxSimplifier< R >::Result result )
private

loads original problem into solver and solves again after it has been solved to optimality with preprocessing

◆ _decompSimplifyAndSolve()

template<class R >
void _decompSimplifyAndSolve ( SPxSolverBase< R > & solver,
SLUFactor< R > & sluFactor,
bool fromScratch,
bool applyPreprocessing )
private

simplifies the problem and solves

◆ _deleteAndUpdateRowsComplementaryProblem()

template<class R >
void _deleteAndUpdateRowsComplementaryProblem ( SPxRowId rangedRowIds[],
int & naddedrows )
private

removing rows from the complementary problem.

◆ _disableSimplifierAndScaler()

template<class R >
void _disableSimplifierAndScaler ( )
private

disables simplifier and scaler

◆ _enableSimplifierAndScaler()

template<class R >
void _enableSimplifierAndScaler ( )
private

enables simplifier and scaler according to current parameters

◆ _ensureDSVectorRationalMemory()

template<class R >
void _ensureDSVectorRationalMemory ( DSVectorRational & vec,
const int newmax ) const
private

extends sparse vector to hold newmax entries if and only if it holds no more free entries

◆ _ensureRationalLP()

template<class R >
void _ensureRationalLP ( )
private

ensures that the rational LP is available; performs no sync

◆ _ensureRealLPLoaded()

template<class R >
void _ensureRealLPLoaded ( )
private

ensures that the real LP and the basis are loaded in the solver; performs no sync

◆ _evaluateSolutionDecomp()

template<class R >
void _evaluateSolutionDecomp ( SPxSolverBase< R > & solver,
SLUFactor< R > & sluFactor,
typename SPxSimplifier< R >::Result result )
private

evaluates the solution of the reduced problem for the DBDS

◆ _evaluateSolutionReal()

template<class R >
void _evaluateSolutionReal ( typename SPxSimplifier< R >::Result simplificationStatus)
private

checks result of the solving process and solves again without preprocessing if necessary

◆ _factorizeColumnRational()

template<class R >
void _factorizeColumnRational ( SolRational & sol,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusRows,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusCols,
bool & stoppedTime,
bool & stoppedIter,
bool & error,
bool & optimal )
private

factorizes rational basis matrix in column representation

◆ _findViolatedRows()

template<class R >
void _findViolatedRows ( R compObjValue,
Array< RowViolation > & violatedrows,
int & nviolatedrows )
private

builds the update rows with those violated in the complmentary problem

◆ _formDecompComplementaryProblem()

template<class R >
void _formDecompComplementaryProblem ( )
private

forms the complementary problem

◆ _formDecompReducedProblem()

template<class R >
void _formDecompReducedProblem ( bool & stop)
private

forms the reduced problem

◆ _getCompatibleBoundCons()

template<class R >
void _getCompatibleBoundCons ( LPRowSetBase< R > & boundcons,
int * compatboundcons,
int * nonposind,
int * ncompatboundcons,
int nnonposind,
bool & stop )
private

computes the compatible bound constraints and adds them to the reduced problem

◆ _getCompatibleColumns()

template<class R >
void _getCompatibleColumns ( VectorBase< R > feasVector,
int * nonposind,
int * compatind,
int * rowsforremoval,
int * colsforremoval,
int nnonposind,
int * ncompatind,
bool formRedProb,
bool & stop )
private

retrieves the compatible columns from the constraint matrix

◆ _getRowsForRemovalComplementaryProblem()

template<class R >
void _getRowsForRemovalComplementaryProblem ( int * nonposind,
int * bind,
int * rowsforremoval,
int * nrowsforremoval,
int nnonposind )
private

computes the rows to remove from the complementary problem

◆ _getZeroDualMultiplierIndices()

template<class R >
void _getZeroDualMultiplierIndices ( VectorBase< R > feasVector,
int * nonposind,
int * colsforremoval,
int * nnonposind,
bool & stop )
private

identifies the columns of the row-form basis that correspond to rows with zero dual multipliers.

◆ _identifyComplementaryDualFixedPrimalVars()

template<class R >
void _identifyComplementaryDualFixedPrimalVars ( int * currFixedVars)
private

removing the dual columns related to the fixed variables

◆ _identifyComplementaryPrimalFixedPrimalVars()

template<class R >
void _identifyComplementaryPrimalFixedPrimalVars ( int * currFixedVars)
private

removing the dual columns related to the fixed variables

◆ _idxToPerm()

template<class R >
void _idxToPerm ( int * idx,
int idxSize,
int * perm,
int permSize ) const
private

creates a permutation for removing rows/columns from an array of indices

◆ _invalidateSolution()

template<class R >
void _invalidateSolution ( )
private

invalidates solution

◆ _isConsistent()

template<class R >
bool _isConsistent ( ) const
private

checks consistency

◆ _isSolveStopped()

template<class R >
bool _isSolveStopped ( bool & stoppedTime,
bool & stoppedIter ) const
private

should solving process be stopped?

◆ _lift()

template<class R >
void _lift ( )
private

reduces matrix coefficient in absolute value by the lifting procedure of Thiele et al. 2013

◆ _loadRealLP()

template<class R >
void _loadRealLP ( bool initBasis)
private

load original LP and possibly setup a slack basis

◆ _lowerFinite()

template<class R >
bool _lowerFinite ( const RangeType & rangeType) const
private

checks whether RangeType corresponds to finite lower bound

◆ _optimize()

template<class R >
void _optimize ( volatile bool * interrupt = NULL)
private

solves the templated LP

◆ _optimizeRational()

template<class R >
void _optimizeRational ( volatile bool * interrupt = NULL)
private

temporary fix for Rational

◆ _parseSettingsLine()

template<class R >
bool _parseSettingsLine ( char * line,
const int lineNumber )
private

parses one line in a settings file and returns true on success; note that the string is modified

◆ _performFeasIRStable()

template<class R >
void _performFeasIRStable ( SolRational & sol,
bool & withDualFarkas,
bool & stoppedTime,
bool & stoppedIter,
bool & error )
private

performs iterative refinement on the auxiliary problem for testing feasibility

◆ _performOptIRStable()

template<class R >
void _performOptIRStable ( SolRational & sol,
bool acceptUnbounded,
bool acceptInfeasible,
int minRounds,
bool & primalFeasible,
bool & dualFeasible,
bool & infeasible,
bool & unbounded,
bool & stoppedTime,
bool & stoppedIter,
bool & error )
private

solves current problem with iterative refinement and recovery mechanism

◆ _performUnboundedIRStable()

template<class R >
void _performUnboundedIRStable ( SolRational & sol,
bool & hasUnboundedRay,
bool & stoppedTime,
bool & stoppedIter,
bool & error )
private

performs iterative refinement on the auxiliary problem for testing unboundedness

◆ _preprocessAndSolveReal()

template<class R >
void _preprocessAndSolveReal ( bool applyPreprocessing,
volatile bool * interrupt = NULL )
private

solves real LP with/without preprocessing

◆ _project()

template<class R >
void _project ( SolRational & sol)
private

undoes lifting

◆ _rangeToPerm()

template<class R >
void _rangeToPerm ( int start,
int end,
int * perm,
int permSize ) const
private

creates a permutation for removing rows/columns from a range of indices

◆ _rangeTypeRational()

template<class R >
RangeType _rangeTypeRational ( const Rational & lower,
const Rational & upper ) const
private

determines RangeType from rational bounds

◆ _rangeTypeReal()

template<class R >
RangeType _rangeTypeReal ( const R & lower,
const R & upper ) const
private

determines RangeType from real bounds

◆ _readFileRational()

template<class R >
bool _readFileRational ( const char * filename,
NameSet * rowNames = 0,
NameSet * colNames = 0,
DIdxSet * intVars = 0 )
private

reads rational LP in LP or MPS format from file and returns true on success; gets row names, column names, and integer variables if desired

◆ _readFileReal()

template<class R >
bool _readFileReal ( const char * filename,
NameSet * rowNames = 0,
NameSet * colNames = 0,
DIdxSet * intVars = 0 )
private

reads real LP in LP or MPS format from file and returns true on success; gets row names, column names, and integer variables if desired

◆ _reapplyPersistentScaling()

template<class R >
bool _reapplyPersistentScaling ( ) const
private

check whether persistent scaling is supposed to be reapplied again after unscaling

◆ _recomputeRangeTypesRational()

template<class R >
void _recomputeRangeTypesRational ( )
private

recomputes range types from scratch using rational LP

◆ _recomputeRangeTypesReal()

template<class R >
void _recomputeRangeTypesReal ( )
private

recomputes range types from scratch using real LP

◆ _reconstructSolutionRational()

template<class R >
bool _reconstructSolutionRational ( SolRational & sol,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusRows,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusCols,
const Rational & denomBoundSquared )
private

attempts rational reconstruction of primal-dual solution

◆ _removeColRangeReal()

template<class R >
void _removeColRangeReal ( int start,
int end,
int perm[] )
private

removes columns start to end including both; an array perm of size numColsReal() may be passed as buffer memory

◆ _removeColReal()

template<class R >
void _removeColReal ( int i)
private

removes column i

◆ _removeColsReal() [1/2]

template<class R >
void _removeColsReal ( int idx[],
int n,
int perm[] )
private

remove all columns with indices in array idx of size n; an array perm of size numColsReal() may be passed as buffer memory

◆ _removeColsReal() [2/2]

template<class R >
void _removeColsReal ( int perm[])
private

removes all columns with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where column i has been moved to; note that perm must point to an array of size at least numColsReal()

◆ _removeComplementaryDualFixedPrimalVars()

template<class R >
void _removeComplementaryDualFixedPrimalVars ( int * currFixedVars)
private

removing the dual columns related to the fixed variables

◆ _removeRowRangeReal()

template<class R >
void _removeRowRangeReal ( int start,
int end,
int perm[] )
private

removes rows start to end including both; an array perm of size numRows() may be passed as buffer memory

◆ _removeRowReal()

template<class R >
void _removeRowReal ( int i)
private

removes row i and adjusts basis

◆ _removeRowsReal() [1/2]

template<class R >
void _removeRowsReal ( int idx[],
int n,
int perm[] )
private

remove all rows with indices in array idx of size n; an array perm of size numRows() may be passed as buffer memory

◆ _removeRowsReal() [2/2]

template<class R >
void _removeRowsReal ( int perm[])
private

removes all rows with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where row i has been moved to; note that perm must point to an array of size at least numRows()

◆ _resolveWithoutPreprocessing()

template<class R >
void _resolveWithoutPreprocessing ( typename SPxSimplifier< R >::Result simplificationStatus)
private

loads original problem into solver and solves again after it has been solved to optimality with preprocessing

◆ _restoreBasis()

template<class R >
void _restoreBasis ( )
private

restore basis

◆ _restoreLPReal()

template<class R >
void _restoreLPReal ( )
private

restores objective, bounds, and sides of real LP

◆ _setComplementaryDualOriginalObjective()

template<class R >
void _setComplementaryDualOriginalObjective ( )
private

updating the complementary dual problem with the original objective function

◆ _setComplementaryPrimalOriginalObjective()

template<class R >
void _setComplementaryPrimalOriginalObjective ( )
private

updating the complementary primal problem with the original objective function

◆ _solveDecompositionDualSimplex()

template<class R >
void _solveDecompositionDualSimplex ( )
private

solves LP using the decomposition based dual simplex

◆ _solveDecompReducedProblem()

template<class R >
void _solveDecompReducedProblem ( )
private

solves the reduced problem

◆ _solveRealForRational()

template<class R >
SPxSolverBase< R >::Status _solveRealForRational ( bool fromscratch,
VectorBase< R > & primal,
VectorBase< R > & dual,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusRows,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusCols )
private

solves real LP during iterative refinement

◆ _solveRealLPAndRecordStatistics()

template<class R >
void _solveRealLPAndRecordStatistics ( volatile bool * interrupt = NULL)
private

call floating-point solver and update statistics on iterations etc.

◆ _solveRealStable()

template<class R >
SPxSolverBase< R >::Status _solveRealStable ( bool acceptUnbounded,
bool acceptInfeasible,
VectorBase< R > & primal,
VectorBase< R > & dual,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusRows,
DataArray< typename SPxSolverBase< R >::VarStatus > & basisStatusCols,
const bool forceNoSimplifier = false )
private

solves real LP with recovery mechanism

◆ _storeBasis()

template<class R >
void _storeBasis ( )
private

store basis

◆ _storeLPReal()

template<class R >
void _storeLPReal ( )
private

stores objective, bounds, and sides of real LP

◆ _storeSolutionReal()

template<class R >
void _storeSolutionReal ( bool verify = true)
private

stores solution of the real LP; before calling this, the real LP must be loaded in the solver and solved (again)

◆ _storeSolutionRealFromPresol()

template<class R >
void _storeSolutionRealFromPresol ( )
private

stores solution from the simplifier because problem vanished in presolving step

◆ _switchRangeType()

template<class R >
RangeType _switchRangeType ( const RangeType & rangeType) const
private

switches RANGETYPE_LOWER to RANGETYPE_UPPER and vice versa

◆ _syncLPRational()

template<class R >
void _syncLPRational ( bool time = true)
private

synchronizes rational LP with real LP, i.e., copies real LP to rational LP, without looking at the sync mode

◆ _syncLPReal()

template<class R >
void _syncLPReal ( bool time = true)
private

synchronizes real LP with rational LP, i.e., copies (rounded) rational LP into real LP, without looking at the sync mode

◆ _syncRationalSolution()

template<class R >
void _syncRationalSolution ( )
private

synchronizes real solution with rational solution, i.e., copies real solution to rational solution

◆ _syncRealSolution()

template<class R >
void _syncRealSolution ( )
private

synchronizes rational solution with real solution, i.e., copies (rounded) rational solution to real solution

◆ _transformEquality()

template<class R >
void _transformEquality ( )
private

introduces slack variables to transform inequality constraints into equations for both rational and real LP, which should be in sync

◆ _transformFeasibility()

template<class R >
void _transformFeasibility ( )
private

transforms LP to feasibility problem by removing the objective function, shifting variables, and homogenizing the right-hand side

◆ _transformUnbounded()

template<class R >
void _transformUnbounded ( )
private

transforms LP to unboundedness problem by moving the objective function to the constraints, changing right-hand side and bounds to zero, and adding an auxiliary variable for the decrease in the objective function

◆ _unitVectorRational()

template<class R >
const UnitVectorRational * _unitVectorRational ( const int i)
private

returns pointer to a constant unit vector available until destruction of the SoPlexBase class

◆ _unscaleSolutionReal()

template<class R >
void _unscaleSolutionReal ( SPxLPBase< R > & LP,
bool persistent = true )
private

unscales stored solution to remove internal or external scaling of LP

◆ _untransformEquality()

template<class R >
void _untransformEquality ( SolRational & sol)
private

undoes transformation to equality form

◆ _untransformFeasibility()

template<class R >
void _untransformFeasibility ( SolRational & sol,
bool infeasible )
private

undoes transformation to feasibility problem

◆ _untransformUnbounded()

template<class R >
void _untransformUnbounded ( SolRational & sol,
bool unbounded )
private

undoes transformation to unboundedness problem

◆ _updateComplementaryDualFixedPrimalVars()

template<class R >
void _updateComplementaryDualFixedPrimalVars ( int * currFixedVars)
private

updating the dual columns related to the fixed primal variables.

◆ _updateComplementaryDualSlackColCoeff()

template<class R >
void _updateComplementaryDualSlackColCoeff ( )
private

updating the slack column coefficients to adjust for equality constraints

◆ _updateComplementaryPrimalFixedPrimalVars()

template<class R >
void _updateComplementaryPrimalFixedPrimalVars ( int * currFixedVars)
private

updating the dual columns related to the fixed primal variables.

◆ _updateComplementaryPrimalSlackColCoeff()

template<class R >
void _updateComplementaryPrimalSlackColCoeff ( )
private

updating the slack column coefficients to adjust for equality constraints

◆ _updateDecompComplementaryDualProblem()

template<class R >
void _updateDecompComplementaryDualProblem ( bool origObj)
private

update the dual complementary problem with additional columns and rows

◆ _updateDecompComplementaryPrimalProblem()

template<class R >
void _updateDecompComplementaryPrimalProblem ( bool origObj)
private

update the primal complementary problem with additional columns and rows

◆ _updateDecompReducedProblem()

template<class R >
void _updateDecompReducedProblem ( R objVal,
VectorBase< R > dualVector,
VectorBase< R > redcostVector,
VectorBase< R > compPrimalVector,
VectorBase< R > compDualVector )
private

update the reduced problem with additional columns and rows

◆ _updateDecompReducedProblemViol()

template<class R >
void _updateDecompReducedProblemViol ( bool allrows)
private

update the reduced problem with additional columns and rows based upon the violated original bounds and rows

◆ _upperFinite()

template<class R >
bool _upperFinite ( const RangeType & rangeType) const
private

checks whether RangeType corresponds to finite upper bound

◆ _verifySolutionReal()

template<class R >
void _verifySolutionReal ( )
private

verify computed solution and resolve if necessary

◆ _writeOriginalProblemBasis()

template<class R >
void _writeOriginalProblemBasis ( const char * filename,
NameSet * rowNames,
NameSet * colNames,
bool cpxFormat )
private

function to build a basis for the original problem as given by the solution to the reduced problem

◆ addColRational() [1/2]

template<class R >
void addColRational ( const LPColRational & lpcol)

adds a single column

◆ addColRational() [2/2]

template<class R >
void addColRational ( const mpq_t * obj,
const mpq_t * lower,
const mpq_t * colValues,
const int * colIndices,
const int colSize,
const mpq_t * upper )

adds a single column (GMP only method)

◆ addColReal()

template<class R >
void addColReal ( const LPColBase< R > & lpcol)

adds a single column

◆ addColsRational() [1/2]

template<class R >
void addColsRational ( const LPColSetRational & lpcolset)

adds multiple columns

◆ addColsRational() [2/2]

template<class R >
void addColsRational ( const mpq_t * obj,
const mpq_t * lower,
const mpq_t * colValues,
const int * colIndices,
const int * colStarts,
const int * colLengths,
const int numCols,
const int numValues,
const mpq_t * upper )

adds a set of columns (GMP only method)

◆ addColsReal()

template<class R >
void addColsReal ( const LPColSetBase< R > & lpcolset)

adds multiple columns

◆ addRowRational() [1/2]

template<class R >
void addRowRational ( const LPRowRational & lprow)

adds a single row

◆ addRowRational() [2/2]

template<class R >
void addRowRational ( const mpq_t * lhs,
const mpq_t * rowValues,
const int * rowIndices,
const int rowSize,
const mpq_t * rhs )

adds a single row (GMP only method)

◆ addRowReal()

template<class R >
void addRowReal ( const LPRowBase< R > & lprow)

adds a single row

◆ addRowsRational() [1/2]

template<class R >
void addRowsRational ( const LPRowSetRational & lprowset)

adds multiple rows

◆ addRowsRational() [2/2]

template<class R >
void addRowsRational ( const mpq_t * lhs,
const mpq_t * rowValues,
const int * rowIndices,
const int * rowStarts,
const int * rowLengths,
const int numRows,
const int numValues,
const mpq_t * rhs )

adds a set of rows (GMP only method)

◆ addRowsReal()

template<class R >
void addRowsReal ( const LPRowSetBase< R > & lprowset)

adds multiple rows

◆ areLPsInSync()

template<class R >
bool areLPsInSync ( const bool checkVecVals = true,
const bool checkMatVals = false,
const bool quiet = false ) const

checks if real LP and rational LP are in sync; dimensions will always be compared, vector and matrix values only if the respective parameter is set to true. If quiet is set to true the function will only display which vectors are different.

◆ basisColStatus()

template<class R >
SPxSolverBase< R >::VarStatus basisColStatus ( int col) const

returns basis status for a single column

◆ basisRowStatus()

template<class R >
SPxSolverBase< R >::VarStatus basisRowStatus ( int row) const

returns basis status for a single row

◆ basisStatus()

template<class R >
SPxBasisBase< R >::SPxStatus basisStatus ( ) const

returns the current basis status

◆ boolParam()

template<class R >
bool boolParam ( const BoolParam param) const

returns boolean parameter value

◆ changeBoundsRational() [1/3]

template<class R >
void changeBoundsRational ( const VectorRational & lower,
const VectorRational & upper )

changes vectors of column bounds to lower and upper

◆ changeBoundsRational() [2/3]

template<class R >
void changeBoundsRational ( int i,
const mpq_t * lower,
const mpq_t * upper )

changes bounds of column i to lower and upper (GMP only method)

◆ changeBoundsRational() [3/3]

template<class R >
void changeBoundsRational ( int i,
const Rational & lower,
const Rational & upper )

changes bounds of column i to lower and upper

◆ changeBoundsReal() [1/2]

template<class R >
void changeBoundsReal ( const VectorBase< R > & lower,
const VectorBase< R > & upper )

changes vectors of column bounds to lower and upper

◆ changeBoundsReal() [2/2]

template<class R >
void changeBoundsReal ( int i,
const R & lower,
const R & upper )

changes bounds of column i to lower and upper

◆ changeColRational()

template<class R >
void changeColRational ( int i,
const LPColRational & lpcol )

replaces column i with lpcol

◆ changeColReal()

template<class R >
void changeColReal ( int i,
const LPColReal & lpcol )

replaces column i with lpcol

◆ changeElementRational() [1/2]

template<class R >
void changeElementRational ( int i,
int j,
const mpq_t * val )

changes matrix entry in row i and column j to val (GMP only method)

◆ changeElementRational() [2/2]

template<class R >
void changeElementRational ( int i,
int j,
const Rational & val )

changes matrix entry in row i and column j to val

◆ changeElementReal()

template<class R >
void changeElementReal ( int i,
int j,
const R & val )

changes matrix entry in row i and column j to val

◆ changeLhsRational() [1/3]

template<class R >
void changeLhsRational ( const VectorRational & lhs)

changes left-hand side vector for constraints to lhs

◆ changeLhsRational() [2/3]

template<class R >
void changeLhsRational ( int i,
const mpq_t * lhs )

changes left-hand side of row i to lhs (GMP only method)

◆ changeLhsRational() [3/3]

template<class R >
void changeLhsRational ( int i,
const Rational & lhs )

changes left-hand side of row i to lhs

◆ changeLhsReal() [1/2]

template<class R >
void changeLhsReal ( const VectorBase< R > & lhs)

changes left-hand side vector for constraints to lhs

◆ changeLhsReal() [2/2]

template<class R >
void changeLhsReal ( int i,
const R & lhs )

changes left-hand side of row i to lhs

◆ changeLowerRational() [1/3]

template<class R >
void changeLowerRational ( const VectorRational & lower)

changes vector of lower bounds to lower

◆ changeLowerRational() [2/3]

template<class R >
void changeLowerRational ( int i,
const mpq_t * lower )

changes lower bound of column i to lower (GMP only method)

◆ changeLowerRational() [3/3]

template<class R >
void changeLowerRational ( int i,
const Rational & lower )

changes lower bound of column i to lower

◆ changeLowerReal() [1/2]

template<class R >
void changeLowerReal ( const VectorBase< R > & lower)

changes vector of lower bounds to lower

◆ changeLowerReal() [2/2]

template<class R >
void changeLowerReal ( int i,
const R & lower )

changes lower bound of column i to lower

◆ changeObjRational() [1/3]

template<class R >
void changeObjRational ( const VectorRational & obj)

changes objective function vector to obj

◆ changeObjRational() [2/3]

template<class R >
void changeObjRational ( int i,
const mpq_t * obj )

changes objective coefficient of column i to obj (GMP only method)

◆ changeObjRational() [3/3]

template<class R >
void changeObjRational ( int i,
const Rational & obj )

changes objective coefficient of column i to obj

◆ changeObjReal() [1/2]

template<class R >
void changeObjReal ( const VectorBase< R > & obj)

changes objective function vector to obj

◆ changeObjReal() [2/2]

template<class R >
void changeObjReal ( int i,
const R & obj )

changes objective coefficient of column i to obj

◆ changeRangeRational() [1/3]

template<class R >
void changeRangeRational ( const VectorRational & lhs,
const VectorRational & rhs )

changes left- and right-hand side vectors

◆ changeRangeRational() [2/3]

template<class R >
void changeRangeRational ( int i,
const mpq_t * lhs,
const mpq_t * rhs )

changes left- and right-hand side of row i (GMP only method)

◆ changeRangeRational() [3/3]

template<class R >
void changeRangeRational ( int i,
const Rational & lhs,
const Rational & rhs )

changes left- and right-hand side of row i

◆ changeRangeReal() [1/2]

template<class R >
void changeRangeReal ( const VectorBase< R > & lhs,
const VectorBase< R > & rhs )

changes left- and right-hand side vectors

◆ changeRangeReal() [2/2]

template<class R >
void changeRangeReal ( int i,
const R & lhs,
const R & rhs )

changes left- and right-hand side of row i

◆ changeRhsRational() [1/3]

template<class R >
void changeRhsRational ( const mpq_t * rhs,
int rhsSize )

changes right-hand side vector to rhs (GMP only method)

◆ changeRhsRational() [2/3]

template<class R >
void changeRhsRational ( const VectorRational & rhs)

changes right-hand side vector to rhs

◆ changeRhsRational() [3/3]

template<class R >
void changeRhsRational ( int i,
const Rational & rhs )

changes right-hand side of row i to rhs

◆ changeRhsReal() [1/2]

template<class R >
void changeRhsReal ( const VectorBase< R > & rhs)

changes right-hand side vector to rhs

◆ changeRhsReal() [2/2]

template<class R >
void changeRhsReal ( int i,
const R & rhs )

changes right-hand side of row i to rhs

◆ changeRowRational()

template<class R >
void changeRowRational ( int i,
const LPRowRational & lprow )

replaces row i with lprow

◆ changeRowReal()

template<class R >
void changeRowReal ( int i,
const LPRowBase< R > & lprow )

replaces row i with lprow

◆ changeUpperRational() [1/3]

template<class R >
void changeUpperRational ( const VectorRational & upper)

changes vector of upper bounds to upper

◆ changeUpperRational() [2/3]

template<class R >
void changeUpperRational ( int i,
const mpq_t * upper )

changes upper bound of column i to upper (GMP only method)

◆ changeUpperRational() [3/3]

template<class R >
void changeUpperRational ( int i,
const Rational & upper )

changes i 'th upper bound to upper

◆ changeUpperReal() [1/2]

template<class R >
void changeUpperReal ( const VectorBase< R > & upper)

changes vector of upper bounds to upper

◆ changeUpperReal() [2/2]

template<class R >
void changeUpperReal ( int i,
const R & upper )

changes i 'th upper bound to upper

◆ checkBasisDualFeasibility()

template<class R >
bool checkBasisDualFeasibility ( VectorBase< R > feasVec)
private

checks the dual feasibility of the current basis

◆ clearBasis()

template<class R >
void clearBasis ( )

clears starting basis

◆ clearLPRational()

template<class R >
void clearLPRational ( )

clears the LP

◆ clearLPReal()

template<class R >
void clearLPReal ( )

clears the LP

◆ coefReal()

template<class R >
R coefReal ( int row,
int col ) const

returns (unscaled) coefficient

◆ colVectorRational()

template<class R >
const SVectorRational & colVectorRational ( int i) const

returns vector of column i

◆ colVectorRealInternal()

template<class R >
const SVectorBase< R > & colVectorRealInternal ( int i) const

returns vector of col i, ignoring scaling

◆ computeBasisInverseRational()

template<class R >
bool computeBasisInverseRational ( )

compute rational basis inverse; returns true on success

◆ decompTerminate()

template<class R >
bool decompTerminate ( R timeLimit)
private

function call to terminate the decomposition simplex

◆ dlcmSizeDualRational()

template<class R >
int dlcmSizeDualRational ( const int base = 2)

get size of least common multiple of denominators in dual solution

◆ dlcmSizePrimalRational()

template<class R >
int dlcmSizePrimalRational ( const int base = 2)

get size of least common multiple of denominators in primal solution

◆ dmaxSizeDualRational()

template<class R >
int dmaxSizeDualRational ( const int base = 2)

get size of largest denominator in dual solution

◆ dmaxSizePrimalRational()

template<class R >
int dmaxSizePrimalRational ( const int base = 2)

get size of largest denominator in primal solution

◆ getBasis()

template<class R >
void getBasis ( typename SPxSolverBase< R >::VarStatus rows[],
typename SPxSolverBase< R >::VarStatus cols[] ) const

gets current basis via arrays of statuses

◆ getBasisInd()

template<class R >
void getBasisInd ( int * bind) const

gets the indices of the basic columns and rows; basic column n gives value n, basic row m gives value -1-m

◆ getBasisIndRational()

template<class R >
bool getBasisIndRational ( DataArray< int > & bind)

gets an array of indices for the columns of the rational basis matrix; bind[i] >= 0 means that the i-th column of the basis matrix contains variable bind[i]; bind[i] < 0 means that the i-th column of the basis matrix contains the slack variable for row -bind[i]-1; performs rational factorization if not available; returns true on success

◆ getBasisInverseColRational()

template<class R >
bool getBasisInverseColRational ( const int c,
SSVectorRational & vec )

computes column c of basis inverse; performs rational factorization if not available; returns true on success

◆ getBasisInverseColReal()

template<class R >
bool getBasisInverseColReal ( int c,
R * coef,
int * inds = NULL,
int * ninds = NULL,
bool unscale = true )

computes column c of basis inverse; returns true on success

Parameters
cwhich column of the basis inverse is computed
coefvalues of result vector (not packed but scattered)
indsindices of result vector (NULL if not to be used)
nindsnumber of nonzeros in result vector
unscaledetermines whether the result should be unscaled according to the original LP data

◆ getBasisInverseRowRational()

template<class R >
bool getBasisInverseRowRational ( const int r,
SSVectorRational & vec )

computes row r of basis inverse; performs rational factorization if not available; returns true on success

◆ getBasisInverseRowReal()

template<class R >
bool getBasisInverseRowReal ( int r,
R * coef,
int * inds = NULL,
int * ninds = NULL,
bool unscale = true )

computes row r of basis inverse; returns true on success

Parameters
rwhich row of the basis inverse is computed
coefvalues of result vector (not packed but scattered)
indsindices of result vector (NULL if not to be used)
nindsnumber of nonzeros in result vector
unscaledetermines whether the result should be unscaled according to the original LP data

◆ getBasisInverseTimesVecRational()

template<class R >
bool getBasisInverseTimesVecRational ( const SVectorRational & rhs,
SSVectorRational & sol )

computes solution of basis matrix B * sol = rhs; performs rational factorization if not available; returns true on success

◆ getBasisInverseTimesVecReal()

template<class R >
bool getBasisInverseTimesVecReal ( R * rhs,
R * sol,
bool unscale = true )

computes dense solution of basis matrix B * sol = rhs; returns true on success

◆ getBasisMetric()

template<class R >
bool getBasisMetric ( R & metric,
int type = 0 )

compute one of several matrix metrics based on the diagonal of the LU factorization type = 0: max/min ratio type = 1: trace of U (sum of diagonal elements) type = 2: determinant (product of diagonal elements)

◆ getBoundViolation()

template<class R >
bool getBoundViolation ( R & maxviol,
R & sumviol )

gets violation of bounds; returns true on success

◆ getBoundViolationRational()

template<class R >
bool getBoundViolationRational ( Rational & maxviol,
Rational & sumviol )

◆ getColRational()

template<class R >
void getColRational ( int i,
LPColRational & lpcol ) const

gets column i

◆ getColsRational()

template<class R >
void getColsRational ( int start,
int end,
LPColSetRational & lpcolset ) const

gets columns start, ..., end

◆ getColVectorReal()

template<class R >
void getColVectorReal ( int i,
DSVectorBase< R > & col ) const

gets vector of col i

◆ getCompSlackVarCoeff()

template<class R >
R getCompSlackVarCoeff ( int primalRowNum)
private

gets the coefficient of the slack variable in the primal complementary problem

◆ getDecompBoundViolation()

template<class R >
bool getDecompBoundViolation ( R & maxviol,
R & sumviol )
private

gets violation of bounds; returns true on success

◆ getDecompRowViolation()

template<class R >
bool getDecompRowViolation ( R & maxviol,
R & sumviol )
private

gets violation of constraints; returns true on success

◆ getDual()

template<class R >
bool getDual ( VectorBase< R > & vector)

gets the dual solution vector if available; returns true on success

◆ getDualFarkas()

template<class R >
bool getDualFarkas ( VectorBase< R > & vector)

gets the Farkas proof if available; returns true on success

◆ getDualFarkasRational() [1/2]

template<class R >
bool getDualFarkasRational ( mpq_t * vector,
const int size )

gets the Farkas proof if LP is infeasible; returns true on success (GMP only method)

◆ getDualFarkasRational() [2/2]

template<class R >
bool getDualFarkasRational ( VectorRational & vector)

◆ getDualFarkasReal()

template<class R >
bool getDualFarkasReal ( R * vector,
int dim )

◆ getDualNorms()

template<class R >
bool getDualNorms ( int & nnormsRow,
int & nnormsCol,
R * norms ) const

gets steepest edge norms and returns false if they are not available

◆ getDualRational() [1/2]

template<class R >
bool getDualRational ( mpq_t * vector,
const int size )

gets the dual solution vector if available; returns true on success (GMP only method)

◆ getDualRational() [2/2]

template<class R >
bool getDualRational ( VectorRational & vector)

◆ getDualReal()

template<class R >
bool getDualReal ( R * p_vector,
int dim )

◆ getDualViolation()

template<class R >
bool getDualViolation ( R & maxviol,
R & sumviol )

gets violation of dual multipliers; returns true on success

◆ getDualViolationRational()

template<class R >
bool getDualViolationRational ( Rational & maxviol,
Rational & sumviol )

◆ getEstimatedCondition()

template<class R >
bool getEstimatedCondition ( R & condition)

computes an estimated condition number for the current basis matrix using the power method; returns true on success

◆ getExactCondition()

template<class R >
bool getExactCondition ( R & condition)

computes the exact condition number for the current basis matrix using the power method; returns true on success

◆ getExpectedDualVariableSign()

template<class R >
DualSign getExpectedDualVariableSign ( int rowNumber)
private

returns the expected sign of the dual variables for the reduced problem

◆ getLhsReal()

template<class R >
void getLhsReal ( VectorBase< R > & lhs) const

gets left-hand side vector

◆ getLowerReal()

template<class R >
void getLowerReal ( VectorBase< R > & lower) const

gets lower bound vector

◆ getNdualNorms()

template<class R >
void getNdualNorms ( int & nnormsRow,
int & nnormsCol ) const

gets number of available dual norms

◆ getObjRational() [1/2]

template<class R >
void getObjRational ( int i,
Rational & obj ) const

gets objective value of column i

◆ getObjRational() [2/2]

template<class R >
void getObjRational ( VectorRational & obj) const

gets objective function vector

◆ getObjReal()

template<class R >
void getObjReal ( VectorBase< R > & obj) const

gets objective function vector

◆ getOriginalProblemBasisColStatus()

template<class R >
void getOriginalProblemBasisColStatus ( int & nNonBasicCols)
private

function to retrieve the column status for the original problem basis from the reduced and complementary problems

◆ getOriginalProblemBasisRowStatus()

template<class R >
void getOriginalProblemBasisRowStatus ( DataArray< int > & degenerateRowNums,
DataArray< typename SPxSolverBase< R >::VarStatus > & degenerateRowStatus,
int & nDegenerateRows,
int & nNonBasicRows )
private

function to retrieve the original problem row basis status from the reduced and complementary problems

◆ getOriginalProblemStatistics()

template<class R >
void getOriginalProblemStatistics ( )
private

stores the problem statistics of the original problem

◆ getOrigProbDualVariableSign()

template<class R >
DualSign getOrigProbDualVariableSign ( int rowNumber)
private

returns the expected sign of the dual variables for the original problem

◆ getOrigVarFixedDirection()

template<class R >
int getOrigVarFixedDirection ( int colNum)
private

determining which bound the primal variables will be fixed to.

◆ getPricerName()

template<class R >
const char * getPricerName ( )

name of currently loaded pricer

◆ getPrimal()

template<class R >
bool getPrimal ( VectorBase< R > & vector)

gets the primal solution vector if available; returns true on success

◆ getPrimalRational() [1/2]

template<class R >
bool getPrimalRational ( mpq_t * vector,
const int size )

gets the primal solution vector if available; returns true on success (GMP only method)

◆ getPrimalRational() [2/2]

template<class R >
bool getPrimalRational ( VectorRational & vector)

◆ getPrimalRay()

template<class R >
bool getPrimalRay ( VectorBase< R > & vector)

gets the primal ray if available; returns true on success

◆ getPrimalRayRational() [1/2]

template<class R >
bool getPrimalRayRational ( mpq_t * vector,
const int size )

gets the primal ray if LP is unbounded; returns true on success (GMP only method)

◆ getPrimalRayRational() [2/2]

template<class R >
bool getPrimalRayRational ( VectorRational & vector)

◆ getPrimalRayReal()

template<class R >
bool getPrimalRayReal ( R * vector,
int dim )

◆ getPrimalReal()

template<class R >
bool getPrimalReal ( R * p_vector,
int size )

◆ getRatiotesterName()

template<class R >
const char * getRatiotesterName ( )

name of currently loaded ratiotester

◆ getRedCost()

template<class R >
bool getRedCost ( VectorBase< R > & vector)

gets the vector of reduced cost values if available; returns true on success

◆ getRedCostRational() [1/2]

template<class R >
bool getRedCostRational ( mpq_t * vector,
const int size )

gets the vector of reduced cost values if available; returns true on success (GMP only method)

◆ getRedCostRational() [2/2]

template<class R >
bool getRedCostRational ( VectorRational & vector)

◆ getRedCostReal()

template<class R >
bool getRedCostReal ( R * vector,
int dim )

◆ getRedCostViolation()

template<class R >
bool getRedCostViolation ( R & maxviol,
R & sumviol )

gets violation of reduced costs; returns true on success

◆ getRedCostViolationRational()

template<class R >
bool getRedCostViolationRational ( Rational & maxviol,
Rational & sumviol )

◆ getRhsReal()

template<class R >
void getRhsReal ( VectorBase< R > & rhs) const

gets right-hand side vector

◆ getRowRational()

template<class R >
void getRowRational ( int i,
LPRowRational & lprow ) const

gets row i

◆ getRowsRational()

template<class R >
void getRowsRational ( int start,
int end,
LPRowSetRational & lprowset ) const

gets rows start, ..., end.

◆ getRowVectorReal()

template<class R >
void getRowVectorReal ( int i,
DSVectorBase< R > & row ) const

gets vector of row i

◆ getRowViolation()

template<class R >
bool getRowViolation ( R & maxviol,
R & sumviol )

gets violation of constraints; returns true on success

◆ getRowViolationRational()

template<class R >
bool getRowViolationRational ( Rational & maxviol,
Rational & sumviol )

◆ getScalerName()

template<class R >
const char * getScalerName ( )

name of scaling method

◆ getSimplifierName()

template<class R >
const char * getSimplifierName ( )

name of simplifier

◆ getSlacksRational() [1/2]

template<class R >
bool getSlacksRational ( mpq_t * vector,
const int size )

gets the vector of slack values if available; returns true on success (GMP only method)

◆ getSlacksRational() [2/2]

template<class R >
bool getSlacksRational ( VectorRational & vector)

gets the vector of slack values if available; returns true on success

◆ getSlacksReal() [1/2]

template<class R >
bool getSlacksReal ( R * p_vector,
int dim )

◆ getSlacksReal() [2/2]

template<class R >
bool getSlacksReal ( VectorBase< R > & vector)

gets the vector of slack values if available; returns true on success

◆ getStarterName()

template<class R >
const char * getStarterName ( )

name of starter

◆ getUpperReal()

template<class R >
void getUpperReal ( VectorBase< R > & upper) const

gets upper bound vector

◆ hasBasis()

template<class R >
bool hasBasis ( ) const

is an advanced starting basis available?

◆ hasDual()

template<class R >
bool hasDual ( ) const

deprecated: use hasSol() instead

Definition at line 627 of file soplex.h.

References SoPlexBase< R >::hasSol().

◆ hasDualFarkas()

template<class R >
bool hasDualFarkas ( ) const

is Farkas proof of infeasibility available?

◆ hasPrimal()

template<class R >
bool hasPrimal ( ) const

deprecated: use hasSol() instead

Definition at line 621 of file soplex.h.

References SoPlexBase< R >::hasSol().

◆ hasPrimalRay()

template<class R >
bool hasPrimalRay ( ) const

is a primal unbounded ray available?

◆ hasSol()

template<class R >
bool hasSol ( ) const

is a solution available (not neccessarily feasible)?

Referenced by SoPlexBase< R >::hasDual(), and SoPlexBase< R >::hasPrimal().

◆ ignoreUnscaledViolations()

template<class R >
bool ignoreUnscaledViolations ( )

sets the status to OPTIMAL in case the LP has been solved with unscaled violations

Definition at line 642 of file soplex.h.

References SoPlexBase< R >::_status.

◆ intParam()

template<class R >
int intParam ( const IntParam param) const

returns integer parameter value

◆ isDualFeasible()

template<class R >
bool isDualFeasible ( ) const

is stored dual solution feasible?

◆ isPrimalFeasible()

template<class R >
bool isPrimalFeasible ( ) const

is stored primal solution feasible?

◆ lhsRational() [1/2]

template<class R >
const VectorRational & lhsRational ( ) const

returns left-hand side vector

◆ lhsRational() [2/2]

template<class R >
const Rational & lhsRational ( int i) const

returns left-hand side of row i

◆ lhsReal()

template<class R >
R lhsReal ( int i) const

returns left-hand side of row i

◆ lhsRealInternal()

template<class R >
const VectorBase< R > & lhsRealInternal ( ) const

returns left-hand side vector, ignoring scaling

◆ loadSettingsFile()

template<class R >
bool loadSettingsFile ( const char * filename)

reads settings file; returns true on success

◆ lowerRational() [1/2]

template<class R >
const VectorRational & lowerRational ( ) const

returns lower bound vector

◆ lowerRational() [2/2]

template<class R >
const Rational & lowerRational ( int i) const

returns lower bound of column i

◆ lowerReal()

template<class R >
R lowerReal ( int i) const

returns lower bound of column i

◆ lowerRealInternal()

template<class R >
const VectorBase< R > & lowerRealInternal ( ) const

returns lower bound vector

◆ maxAbsNonzeroRational()

template<class R >
Rational maxAbsNonzeroRational ( ) const

returns biggest non-zero element in absolute value

◆ maxAbsNonzeroReal()

template<class R >
R maxAbsNonzeroReal ( ) const

returns biggest non-zero element in absolute value

◆ maxObjRational() [1/2]

template<class R >
const VectorRational & maxObjRational ( ) const

returns objective function vector after transformation to a maximization problem; since this is how it is stored internally, this is generally faster

◆ maxObjRational() [2/2]

template<class R >
const Rational & maxObjRational ( int i) const

returns objective value of column i after transformation to a maximization problem; since this is how it is stored internally, this is generally faster

◆ maxObjReal()

template<class R >
R maxObjReal ( int i) const

returns objective value of column i after transformation to a maximization problem; since this is how it is stored internally, this is generally faster

◆ maxObjRealInternal()

template<class R >
const VectorBase< R > & maxObjRealInternal ( ) const

returns objective function vector after transformation to a maximization problem; since this is how it is stored internally, this is generally faster

◆ minAbsNonzeroRational()

template<class R >
Rational minAbsNonzeroRational ( ) const

returns smallest non-zero element in absolute value

◆ minAbsNonzeroReal()

template<class R >
R minAbsNonzeroReal ( ) const

returns smallest non-zero element in absolute value

◆ multBasis()

template<class R >
bool multBasis ( R * vec,
bool unscale = true )

multiply with basis matrix; B * vec (inplace)

Parameters
vec(dense) vector to be multiplied with
unscaledetermines whether the result should be unscaled according to the original LP data

◆ multBasisTranspose()

template<class R >
bool multBasisTranspose ( R * vec,
bool unscale = true )

multiply with transpose of basis matrix; vec * B^T (inplace)

Parameters
vec(dense) vector to be multiplied with
unscaledetermines whether the result should be unscaled according to the original LP data

◆ numCols()

template<class R >
int numCols ( ) const

Templated function that returns number of columns.

◆ numColsRational()

template<class R >
int numColsRational ( ) const

◆ numColsReal()

template<class R >
int numColsReal ( ) const

◆ numIterations()

template<class R >
int numIterations ( ) const

number of iterations since last call to solve

◆ numNonzeros()

template<class R >
int numNonzeros ( ) const

returns number of nonzeros

◆ numNonzerosRational()

template<class R >
int numNonzerosRational ( ) const

◆ numRows()

template<class R >
int numRows ( ) const

returns number of rows

◆ numRowsRational()

template<class R >
int numRowsRational ( ) const

◆ numRowsReal()

template<class R >
int numRowsReal ( ) const

◆ objRational()

template<class R >
Rational objRational ( int i) const

returns objective value of column i

◆ objReal()

template<class R >
R objReal ( int i) const

returns objective value of column i

◆ objValueRational()

template<class R >
Rational objValueRational ( )

returns the objective value if a primal solution is available

◆ objValueReal()

template<class R >
R objValueReal ( )

returns the objective value if a primal solution is available

◆ operator=()

template<class R >
SoPlexBase< R > & operator= ( const SoPlexBase< R > & rhs)

assignment operator

◆ optimize()

template<class R >
SPxSolverBase< R >::Status optimize ( volatile bool * interrupt = NULL)

optimize the given LP

Referenced by SoPlexBase< R >::solve().

◆ parseSettingsString()

template<class R >
bool parseSettingsString ( char * str)

parses one setting string and returns true on success; note that string is modified

◆ printDecompDisplayLine()

template<class R >
void printDecompDisplayLine ( SPxSolverBase< R > & solver,
const SPxOut::Verbosity origVerb,
bool force,
bool forceHead )
private

prints a display line of the flying table for the DBDS

◆ printOriginalProblemStatistics()

template<class R >
void printOriginalProblemStatistics ( std::ostream & os)
private

stores the problem statistics of the original problem

◆ printShortStatistics()

template<class R >
void printShortStatistics ( std::ostream & os)

prints short statistics

◆ printSolutionStatistics()

template<class R >
void printSolutionStatistics ( std::ostream & os)

prints solution statistics

◆ printSolvingStatistics()

template<class R >
void printSolvingStatistics ( std::ostream & os)

prints statistics on solving process

◆ printStatistics()

template<class R >
void printStatistics ( std::ostream & os)

prints complete statistics

◆ printStatus()

template<class R >
void printStatus ( std::ostream & os,
typename SPxSolverBase< R >::Status status )

prints status

◆ printUserSettings()

template<class R >
void printUserSettings ( )

print non-default parameter values

◆ printVersion()

template<class R >
void printVersion ( ) const

prints version and compilation options

◆ randomSeed()

template<class R >
unsigned int randomSeed ( ) const

returns the current random seed of the solver instance

◆ readBasisFile()

template<class R >
bool readBasisFile ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0 )

reads basis information from filename and returns true on success; if rowNames and colNames are NULL, default names are assumed; returns true on success

◆ readFile()

template<class R >
bool readFile ( const char * filename,
NameSet * rowNames = 0,
NameSet * colNames = 0,
DIdxSet * intVars = 0 )

reads LP file in LP or MPS format according to READMODE parameter; gets row names, column names, and integer variables if desired; returns true on success

◆ realParam()

template<class R >
Real realParam ( const RealParam param) const

returns real parameter value

◆ removeColRangeRational()

template<class R >
void removeColRangeRational ( int start,
int end,
int perm[] = 0 )

removes columns start to end including both; an array perm of size numColsRational() may be passed as buffer memory

◆ removeColRangeReal()

template<class R >
void removeColRangeReal ( int start,
int end,
int perm[] = 0 )

removes columns start to end including both; an array perm of size numColsReal() may be passed as buffer memory

◆ removeColRational()

template<class R >
void removeColRational ( int i)

removes column i

◆ removeColReal()

template<class R >
void removeColReal ( int i)

removes column i

◆ removeColsRational() [1/2]

template<class R >
void removeColsRational ( int idx[],
int n,
int perm[] = 0 )

remove all columns with indices in array idx of size n; an array perm of size numColsRational() may be passed as buffer memory

◆ removeColsRational() [2/2]

template<class R >
void removeColsRational ( int perm[])

removes all columns with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where column i has been moved to; note that perm must point to an array of size at least numColsRational()

◆ removeColsReal() [1/2]

template<class R >
void removeColsReal ( int idx[],
int n,
int perm[] = 0 )

remove all columns with indices in array idx of size n; an array perm of size numColsReal() may be passed as buffer memory

◆ removeColsReal() [2/2]

template<class R >
void removeColsReal ( int perm[])

removes all columns with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where column i has been moved to; note that perm must point to an array of size at least numColsReal()

◆ removeRowRangeRational()

template<class R >
void removeRowRangeRational ( int start,
int end,
int perm[] = 0 )

removes rows start to end including both; an array perm of size numRowsRational() may be passed as buffer memory

◆ removeRowRangeReal()

template<class R >
void removeRowRangeReal ( int start,
int end,
int perm[] = 0 )

removes rows start to end including both; an array perm of size numRows() may be passed as buffer memory

◆ removeRowRational()

template<class R >
void removeRowRational ( int i)

removes row i

◆ removeRowReal()

template<class R >
void removeRowReal ( int i)

removes row i

◆ removeRowsRational() [1/2]

template<class R >
void removeRowsRational ( int idx[],
int n,
int perm[] = 0 )

remove all rows with indices in array idx of size n; an array perm of size numRowsRational() may be passed as buffer memory

◆ removeRowsRational() [2/2]

template<class R >
void removeRowsRational ( int perm[])

removes all rows with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where row i has been moved to; note that perm must point to an array of size at least numRowsRational()

◆ removeRowsReal() [1/2]

template<class R >
void removeRowsReal ( int idx[],
int n,
int perm[] = 0 )

remove all rows with indices in array idx of size n; an array perm of size numRows() may be passed as buffer memory

◆ removeRowsReal() [2/2]

template<class R >
void removeRowsReal ( int perm[])

removes all rows with an index i such that perm[i] < 0; upon completion, perm[i] >= 0 indicates the new index where row i has been moved to; note that perm must point to an array of size at least numRows()

◆ resetSettings()

template<class R >
void resetSettings ( const bool quiet = false,
const bool init = true )

resets default parameter settings

◆ rhsRational() [1/2]

template<class R >
const VectorRational & rhsRational ( ) const

returns right-hand side vector

◆ rhsRational() [2/2]

template<class R >
const Rational & rhsRational ( int i) const

returns right-hand side of row i

◆ rhsReal()

template<class R >
R rhsReal ( int i) const

returns right-hand side of row i

◆ rhsRealInternal()

template<class R >
const VectorBase< R > & rhsRealInternal ( ) const

returns right-hand side vector, ignoring scaling

◆ rowTypeRational()

template<class R >
LPRowRational::Type rowTypeRational ( int i) const

returns inequality type of row i

◆ rowTypeReal()

template<class R >
LPRowBase< R >::Type rowTypeReal ( int i) const

returns inequality type of row i

◆ rowVectorRational()

template<class R >
const SVectorRational & rowVectorRational ( int i) const

returns vector of row i

◆ rowVectorRealInternal()

template<class R >
const SVectorBase< R > & rowVectorRealInternal ( int i) const

returns vector of row i, ignoring scaling

◆ saveSettingsFile()

template<class R >
bool saveSettingsFile ( const char * filename,
const bool onlyChanged = false,
int solvemode = 1 ) const

writes settings file; returns true on success

◆ setBasis()

template<class R >
void setBasis ( const typename SPxSolverBase< R >::VarStatus rows[],
const typename SPxSolverBase< R >::VarStatus cols[] )

sets starting basis via arrays of statuses

◆ setBoolParam()

template<class R >
bool setBoolParam ( const BoolParam param,
const bool value,
const bool init = true )

sets boolean parameter value; returns true on success

◆ setDualNorms()

template<class R >
bool setDualNorms ( int nnormsRow,
int nnormsCol,
R * norms )

sets steepest edge norms and returns false if that's not possible

◆ setIntegralityInformation()

template<class R >
void setIntegralityInformation ( int ncols,
int * intInfo )

pass integrality information about the variables to the solver

◆ setIntParam()

template<class R >
bool setIntParam ( const IntParam param,
const int value,
const bool init = true )

sets integer parameter value; returns true on success

◆ setRandomSeed()

template<class R >
void setRandomSeed ( unsigned int seed)

set the random seeds of the solver instance

◆ setRealParam()

template<class R >
bool setRealParam ( const RealParam param,
const Real value,
const bool init = true )

sets real parameter value; returns true on success

◆ setSettings()

template<class R >
bool setSettings ( const Settings & newSettings,
const bool init = true )

sets parameter settings; returns true on success

◆ setTimings()

template<class R >
void setTimings ( const Timer::TYPE ttype)

set statistic timers to a certain type

◆ settings()

template<class R >
const Settings & settings ( ) const

returns current parameter settings

◆ solve()

template<class R >
SPxSolverBase< R >::Status solve ( volatile bool * interrupt = NULL)

Definition at line 606 of file soplex.h.

References SoPlexBase< R >::optimize().

◆ solveTime()

template<class R >
Real solveTime ( ) const

time spent in last call to solve

◆ statisticString()

template<class R >
std::string statisticString ( ) const

statistical information in form of a string

◆ status()

template<class R >
SPxSolverBase< R >::Status status ( ) const

returns the current solver status

◆ syncLPRational()

template<class R >
void syncLPRational ( )

synchronizes rational LP with real LP, i.e., copies real LP to rational LP, if sync mode is manual

◆ syncLPReal()

template<class R >
void syncLPReal ( )

synchronizes real LP with rational LP, i.e., copies (rounded) rational LP into real LP, if sync mode is manual

◆ totalSizeDualRational()

template<class R >
int totalSizeDualRational ( const int base = 2)

get size of dual solution

◆ totalSizePrimalRational()

template<class R >
int totalSizePrimalRational ( const int base = 2)

get size of primal solution

◆ upperRational() [1/2]

template<class R >
const VectorRational & upperRational ( ) const

returns upper bound vector

◆ upperRational() [2/2]

template<class R >
const Rational & upperRational ( int i) const

returns upper bound of column i

◆ upperReal()

template<class R >
R upperReal ( int i) const

returns upper bound of column i

◆ upperRealInternal()

template<class R >
const VectorBase< R > & upperRealInternal ( ) const

returns upper bound vector

◆ writeBasisFile()

template<class R >
bool writeBasisFile ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0,
const bool cpxFormat = false ) const

writes basis information to filename; if rowNames and colNames are NULL, default names are used; returns true on success

◆ writeDualFileReal()

template<class R >
bool writeDualFileReal ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0,
const DIdxSet * intvars = 0 ) const

writes the dual of the real LP to file; LP or MPS format is chosen from the extension in filename; if rowNames and colNames are NULL, default names are used; if intVars is not NULL, the variables contained in it are marked as integer; returns true on success

◆ writeFile()

template<class R >
bool writeFile ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0,
const DIdxSet * intvars = 0,
const bool unscale = true ) const

Templated write function Real writes real LP to file; LP or MPS format is chosen from the extension in filename; if rowNames and colNames are NULL, default names are used; if intVars is not NULL, the variables contained in it are marked as integer; returns true on success Rational writes rational LP to file; LP or MPS format is chosen from the extension in filename; if rowNames and colNames are NULL, default names are used; if intVars is not NULL, the variables contained in it are marked as integer; returns true on success.

◆ writeFileRational()

template<class R >
bool writeFileRational ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0,
const DIdxSet * intvars = 0 ) const

◆ writeFileReal()

template<class R >
bool writeFileReal ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0,
const DIdxSet * intvars = 0,
const bool unscale = true ) const

◆ writeStateRational()

template<class R >
void writeStateRational ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0,
const bool cpxFormat = false ) const

writes internal LP, basis information, and parameter settings; if rowNames and colNames are NULL, default names are used

◆ writeStateReal()

template<class R >
void writeStateReal ( const char * filename,
const NameSet * rowNames = 0,
const NameSet * colNames = 0,
const bool cpxFormat = false ) const

writes internal LP, basis information, and parameter settings; if rowNames and colNames are NULL, default names are used

Member Data Documentation

◆ _applyPolishing

template<class R >
bool _applyPolishing
private

Definition at line 1694 of file soplex.h.

◆ _basisStatusCols

template<class R >
DataArray<typename SPxSolverBase<R>::VarStatus > _basisStatusCols
private

Definition at line 1923 of file soplex.h.

◆ _basisStatusRows

template<class R >
DataArray<typename SPxSolverBase<R>::VarStatus > _basisStatusRows
private

Definition at line 1922 of file soplex.h.

◆ _beforeLiftCols

template<class R >
int _beforeLiftCols
private

Definition at line 1735 of file soplex.h.

◆ _beforeLiftRows

template<class R >
int _beforeLiftRows
private

Definition at line 1734 of file soplex.h.

◆ _colNames

template<class R >
NameSet* _colNames
private

Definition at line 1885 of file soplex.h.

◆ _colTypes

template<class R >
DataArray< RangeType > _colTypes
private

Definition at line 1756 of file soplex.h.

◆ _compSlackColId

template<class R >
SPxColId _compSlackColId
private

Definition at line 1831 of file soplex.h.

◆ _compSlackDualRowId

template<class R >
SPxRowId _compSlackDualRowId
private

Definition at line 1832 of file soplex.h.

◆ _compSlufactor

template<class R >
SLUFactor<R> _compSlufactor
private

Definition at line 1822 of file soplex.h.

◆ _compSolver

template<class R >
SPxSolverBase<R> _compSolver
private

Definition at line 1818 of file soplex.h.

◆ _currentProb

template<class R >
decompStatus _currentProb
private

Definition at line 1911 of file soplex.h.

◆ _currentSettings

template<class R >
Settings* _currentSettings
private

Definition at line 1646 of file soplex.h.

◆ _decompColStatus

template<class R >
int* _decompColStatus
private

Definition at line 1836 of file soplex.h.

◆ _decompCompPrimalColIDs

template<class R >
DataArray< SPxColId > _decompCompPrimalColIDs
private

Definition at line 1864 of file soplex.h.

◆ _decompCompPrimalFixedVarIDs

template<class R >
DataArray< SPxColId > _decompCompPrimalFixedVarIDs
private

Definition at line 1857 of file soplex.h.

◆ _decompCompPrimalRowIDs

template<class R >
DataArray< SPxRowId > _decompCompPrimalRowIDs
private

Definition at line 1862 of file soplex.h.

◆ _decompCompPrimalVarBoundIDs

template<class R >
DataArray< SPxColId > _decompCompPrimalVarBoundIDs
private

Definition at line 1859 of file soplex.h.

◆ _decompCompProbColIDsIdx

template<class R >
int* _decompCompProbColIDsIdx
private

Definition at line 1837 of file soplex.h.

◆ _decompDisplayLine

template<class R >
int _decompDisplayLine
private

Definition at line 1882 of file soplex.h.

◆ _decompDualColIDs

template<class R >
DataArray< SPxColId > _decompDualColIDs
private

Definition at line 1851 of file soplex.h.

◆ _decompDualRowIDs

template<class R >
DataArray< SPxRowId > _decompDualRowIDs
private

Definition at line 1849 of file soplex.h.

◆ _decompElimPrimalRowIDs

template<class R >
DataArray< SPxRowId > _decompElimPrimalRowIDs
private

Definition at line 1847 of file soplex.h.

◆ _decompFeasVector

template<class R >
VectorBase<R> _decompFeasVector
private

Definition at line 1828 of file soplex.h.

◆ _decompFixedVarDualIDs

template<class R >
DataArray< SPxColId > _decompFixedVarDualIDs
private

Definition at line 1852 of file soplex.h.

◆ _decompLP

template<class R >
SPxLPBase<R>* _decompLP
private

Definition at line 1686 of file soplex.h.

◆ _decompPrimalColIDs

template<class R >
DataArray< SPxColId > _decompPrimalColIDs
private

Definition at line 1845 of file soplex.h.

◆ _decompPrimalRowIDs

template<class R >
DataArray< SPxRowId > _decompPrimalRowIDs
private

Definition at line 1844 of file soplex.h.

◆ _decompReducedProbColIDs

template<class R >
DataArray< SPxColId > _decompReducedProbColIDs
private

Definition at line 1843 of file soplex.h.

◆ _decompReducedProbColRowIDs

template<class R >
DataArray< SPxRowId > _decompReducedProbColRowIDs
private

Definition at line 1841 of file soplex.h.

◆ _decompReducedProbCols

template<class R >
bool* _decompReducedProbCols
private

Definition at line 1834 of file soplex.h.

◆ _decompReducedProbRowIDs

template<class R >
DataArray< SPxRowId > _decompReducedProbRowIDs
private

Definition at line 1839 of file soplex.h.

◆ _decompReducedProbRows

template<class R >
bool* _decompReducedProbRows
private

Definition at line 1833 of file soplex.h.

◆ _decompRowStatus

template<class R >
int* _decompRowStatus
private

Definition at line 1835 of file soplex.h.

◆ _decompTransBasis

template<class R >
SPxBasisBase<R> _decompTransBasis
private

Definition at line 1825 of file soplex.h.

◆ _decompVarBoundDualIDs

template<class R >
DataArray< SPxColId > _decompVarBoundDualIDs
private

Definition at line 1854 of file soplex.h.

◆ _decompViolatedBounds

template<class R >
int* _decompViolatedBounds
private

Definition at line 1868 of file soplex.h.

◆ _decompViolatedRows

template<class R >
int* _decompViolatedRows
private

Definition at line 1869 of file soplex.h.

◆ _feasLhs

template<class R >
VectorRational _feasLhs
private

Definition at line 1720 of file soplex.h.

◆ _feasLower

template<class R >
VectorRational _feasLower
private

Definition at line 1722 of file soplex.h.

◆ _feasObj

template<class R >
VectorRational _feasObj
private

Definition at line 1719 of file soplex.h.

◆ _feasRhs

template<class R >
VectorRational _feasRhs
private

Definition at line 1721 of file soplex.h.

◆ _feasUpper

template<class R >
VectorRational _feasUpper
private

Definition at line 1723 of file soplex.h.

◆ _fixedOrigVars

template<class R >
int* _fixedOrigVars
private

Definition at line 1872 of file soplex.h.

◆ _hasBasis

template<class R >
bool _hasBasis
private

Definition at line 1929 of file soplex.h.

◆ _hasSolRational

template<class R >
bool _hasSolRational
private

Definition at line 1931 of file soplex.h.

◆ _hasSolReal

template<class R >
bool _hasSolReal
private

Definition at line 1930 of file soplex.h.

◆ _isRealLPLoaded

template<class R >
bool _isRealLPLoaded
private

Definition at line 1691 of file soplex.h.

◆ _isRealLPScaled

template<class R >
bool _isRealLPScaled
private

Definition at line 1693 of file soplex.h.

◆ _lastSolveMode

template<class R >
int _lastSolveMode
private

Definition at line 1920 of file soplex.h.

◆ _manualLhs

template<class R >
VectorBase<R> _manualLhs
private

Definition at line 1698 of file soplex.h.

◆ _manualLower

template<class R >
VectorBase<R> _manualLower
private

Definition at line 1696 of file soplex.h.

◆ _manualObj

template<class R >
VectorBase<R> _manualObj
private

Definition at line 1700 of file soplex.h.

◆ _manualRealLP

template<class R >
SPxLPBase<R> _manualRealLP
private

Definition at line 1701 of file soplex.h.

◆ _manualRhs

template<class R >
VectorBase<R> _manualRhs
private

Definition at line 1699 of file soplex.h.

◆ _manualUpper

template<class R >
VectorBase<R> _manualUpper
private

Definition at line 1697 of file soplex.h.

◆ _modLhs

template<class R >
VectorRational _modLhs
private

Definition at line 1726 of file soplex.h.

◆ _modLower

template<class R >
VectorRational _modLower
private

Definition at line 1724 of file soplex.h.

◆ _modObj

template<class R >
VectorRational _modObj
private

Definition at line 1728 of file soplex.h.

◆ _modRhs

template<class R >
VectorRational _modRhs
private

Definition at line 1727 of file soplex.h.

◆ _modUpper

template<class R >
VectorRational _modUpper
private

Definition at line 1725 of file soplex.h.

◆ _nCompPrimalCols

template<class R >
int _nCompPrimalCols
private

Definition at line 1880 of file soplex.h.

◆ _nCompPrimalRows

template<class R >
int _nCompPrimalRows
private

Definition at line 1879 of file soplex.h.

◆ _nDecompViolBounds

template<class R >
int _nDecompViolBounds
private

Definition at line 1866 of file soplex.h.

◆ _nDecompViolRows

template<class R >
int _nDecompViolRows
private

Definition at line 1867 of file soplex.h.

◆ _nDualCols

template<class R >
int _nDualCols
private

Definition at line 1878 of file soplex.h.

◆ _nDualRows

template<class R >
int _nDualRows
private

Definition at line 1877 of file soplex.h.

◆ _nElimPrimalRows

template<class R >
int _nElimPrimalRows
private

Definition at line 1876 of file soplex.h.

◆ _nPrimalCols

template<class R >
int _nPrimalCols
private

Definition at line 1875 of file soplex.h.

◆ _nPrimalRows

template<class R >
int _nPrimalRows
private

Definition at line 1874 of file soplex.h.

◆ _optimizeCalls

template<class R >
int _optimizeCalls
private

Definition at line 1938 of file soplex.h.

◆ _pricerAuto

template<class R >
SPxAutoPR<R> _pricerAuto
private

Definition at line 1673 of file soplex.h.

◆ _pricerDantzig

template<class R >
SPxDantzigPR<R> _pricerDantzig
private

Definition at line 1674 of file soplex.h.

◆ _pricerDevex

template<class R >
SPxDevexPR<R> _pricerDevex
private

Definition at line 1676 of file soplex.h.

◆ _pricerParMult

template<class R >
SPxParMultPR<R> _pricerParMult
private

Definition at line 1675 of file soplex.h.

◆ _pricerQuickSteep

template<class R >
SPxSteepPR<R> _pricerQuickSteep
private

Definition at line 1677 of file soplex.h.

◆ _pricerSteep

template<class R >
SPxSteepExPR<R> _pricerSteep
private

Definition at line 1678 of file soplex.h.

◆ _primalDualDiff

template<class R >
DSVectorRational _primalDualDiff
private

Definition at line 1729 of file soplex.h.

◆ _rationalFeastol

template<class R >
Rational _rationalFeastol
private

Definition at line 1650 of file soplex.h.

◆ _rationalLP

template<class R >
SPxLPRational* _rationalLP
private

Definition at line 1709 of file soplex.h.

◆ _rationalLUSolver

template<class R >
SLUFactorRational _rationalLUSolver
private

Definition at line 1710 of file soplex.h.

◆ _rationalLUSolverBind

template<class R >
DataArray<int> _rationalLUSolverBind
private

Definition at line 1711 of file soplex.h.

◆ _rationalMaxscaleincr

template<class R >
Rational _rationalMaxscaleincr
private

Definition at line 1652 of file soplex.h.

◆ _rationalNegInfty

template<class R >
Rational _rationalNegInfty
private

Definition at line 1649 of file soplex.h.

◆ _rationalNegone

template<class R >
Rational _rationalNegone
private

Definition at line 1942 of file soplex.h.

◆ _rationalOpttol

template<class R >
Rational _rationalOpttol
private

Definition at line 1651 of file soplex.h.

◆ _rationalPosInfty

template<class R >
Rational _rationalPosInfty
private

Definition at line 1648 of file soplex.h.

◆ _rationalPosone

template<class R >
Rational _rationalPosone
private

Definition at line 1941 of file soplex.h.

◆ _rationalZero

template<class R >
Rational _rationalZero
private

Definition at line 1943 of file soplex.h.

◆ _ratiotesterBoundFlipping

template<class R >
SPxBoundFlippingRT<R> _ratiotesterBoundFlipping
private

Definition at line 1682 of file soplex.h.

◆ _ratiotesterFast

template<class R >
SPxFastRT<R> _ratiotesterFast
private

Definition at line 1681 of file soplex.h.

◆ _ratiotesterHarris

template<class R >
SPxHarrisRT<R> _ratiotesterHarris
private

Definition at line 1680 of file soplex.h.

◆ _ratiotesterTextbook

template<class R >
SPxDefaultRT<R> _ratiotesterTextbook
private

Definition at line 1679 of file soplex.h.

◆ _realLP

template<class R >
SPxLPBase<R>* _realLP
private

Definition at line 1685 of file soplex.h.

◆ _rowNames

template<class R >
NameSet* _rowNames
private

Definition at line 1884 of file soplex.h.

◆ _rowTypes

template<class R >
DataArray< RangeType > _rowTypes
private

Definition at line 1757 of file soplex.h.

◆ _scaler

template<class R >
SPxScaler<R>* _scaler
private

Definition at line 1688 of file soplex.h.

◆ _scalerBiequi

template<class R >
SPxEquiliSC<R> _scalerBiequi
private

Definition at line 1665 of file soplex.h.

◆ _scalerGeo1

template<class R >
SPxGeometSC<R> _scalerGeo1
private

Definition at line 1666 of file soplex.h.

◆ _scalerGeo8

template<class R >
SPxGeometSC<R> _scalerGeo8
private

Definition at line 1667 of file soplex.h.

◆ _scalerGeoequi

template<class R >
SPxGeometSC<R> _scalerGeoequi
private

Definition at line 1668 of file soplex.h.

◆ _scalerLeastsq

template<class R >
SPxLeastSqSC<R> _scalerLeastsq
private

Definition at line 1669 of file soplex.h.

◆ _scalerUniequi

template<class R >
SPxEquiliSC<R> _scalerUniequi
private

Definition at line 1664 of file soplex.h.

◆ _simplifier

template<class R >
SPxSimplifier<R>* _simplifier
private

Definition at line 1687 of file soplex.h.

◆ _simplifierMainSM

template<class R >
SPxMainSM<R> _simplifierMainSM
private

Definition at line 1662 of file soplex.h.

◆ _simplifierPaPILO

template<class R >
Presol<R> _simplifierPaPILO
private

Definition at line 1663 of file soplex.h.

◆ _slackCols

template<class R >
LPColSetRational _slackCols
private

Definition at line 1713 of file soplex.h.

◆ _slufactor

template<class R >
SLUFactor<R> _slufactor
private

Definition at line 1661 of file soplex.h.

◆ _solRational

template<class R >
SolRational _solRational
private

Definition at line 1926 of file soplex.h.

◆ _solReal

template<class R >
SolBase<R> _solReal
private

Definition at line 1925 of file soplex.h.

◆ _solver

template<class R >
SPxSolverBase<R> _solver
private

Definition at line 1660 of file soplex.h.

◆ _starter

template<class R >
SPxStarter<R>* _starter
private

Definition at line 1689 of file soplex.h.

◆ _starterSum

template<class R >
SPxSumST<R> _starterSum
private

Definition at line 1671 of file soplex.h.

◆ _starterVector

template<class R >
SPxVectorST<R> _starterVector
private

Definition at line 1672 of file soplex.h.

◆ _starterWeight

template<class R >
SPxWeightST<R> _starterWeight
private

Definition at line 1670 of file soplex.h.

◆ _statistics

template<class R >
Statistics* _statistics
private

statistics since last call to solveReal() or solveRational()

Definition at line 1638 of file soplex.h.

◆ _status

template<class R >
SPxSolverBase<R>::Status _status
private

Definition at line 1919 of file soplex.h.

Referenced by SoPlexBase< R >::ignoreUnscaledViolations().

◆ _storedBasis

template<class R >
bool _storedBasis
private

Definition at line 1733 of file soplex.h.

◆ _storedBasisStatusCols

template<class R >
DataArray< typename SPxSolverBase<R>::VarStatus > _storedBasisStatusCols
private

Definition at line 1731 of file soplex.h.

◆ _storedBasisStatusRows

template<class R >
DataArray< typename SPxSolverBase<R>::VarStatus > _storedBasisStatusRows
private

Definition at line 1730 of file soplex.h.

◆ _tauColVector

template<class R >
DSVectorRational _tauColVector
private

Definition at line 1718 of file soplex.h.

◆ _transformedObj

template<class R >
VectorBase<R> _transformedObj
private

Definition at line 1827 of file soplex.h.

◆ _transformedRows

template<class R >
LPRowSetBase<R> _transformedRows
private

Definition at line 1830 of file soplex.h.

◆ _unboundedLhs

template<class R >
VectorRational _unboundedLhs
private

Definition at line 1716 of file soplex.h.

◆ _unboundedLower

template<class R >
VectorRational _unboundedLower
private

Definition at line 1714 of file soplex.h.

◆ _unboundedRhs

template<class R >
VectorRational _unboundedRhs
private

Definition at line 1717 of file soplex.h.

◆ _unboundedUpper

template<class R >
VectorRational _unboundedUpper
private

Definition at line 1715 of file soplex.h.

◆ _unitMatrixRational

template<class R >
Array< UnitVectorRational* > _unitMatrixRational
private

Definition at line 1732 of file soplex.h.

◆ _unscaleCalls

template<class R >
int _unscaleCalls
private

Definition at line 1939 of file soplex.h.

◆ _workSol

template<class R >
SolRational _workSol
private

Definition at line 1927 of file soplex.h.

◆ maxAbsNonzero

template<class R >
R maxAbsNonzero
private

Definition at line 1898 of file soplex.h.

◆ minAbsNonzero

template<class R >
R minAbsNonzero
private

Definition at line 1897 of file soplex.h.

◆ nNonzeros

template<class R >
int nNonzeros
private

Definition at line 1896 of file soplex.h.

◆ numCompProbIter

template<class R >
int numCompProbIter
private

Definition at line 1891 of file soplex.h.

◆ numDecompIter

template<class R >
int numDecompIter
private

Definition at line 1889 of file soplex.h.

◆ numIncludedRows

template<class R >
int numIncludedRows
private

Definition at line 1888 of file soplex.h.

◆ numProbCols

template<class R >
int numProbCols
private

Definition at line 1895 of file soplex.h.

◆ numProbRows

template<class R >
int numProbRows
private

Definition at line 1894 of file soplex.h.

◆ numRedProbIter

template<class R >
int numRedProbIter
private

Definition at line 1890 of file soplex.h.

◆ origCountBoxed

template<class R >
int origCountBoxed
private

Definition at line 1902 of file soplex.h.

◆ origCountEqual

template<class R >
int origCountEqual
private

Definition at line 1905 of file soplex.h.

◆ origCountFreeCol

template<class R >
int origCountFreeCol
private

Definition at line 1903 of file soplex.h.

◆ origCountFreeRow

template<class R >
int origCountFreeRow
private

Definition at line 1909 of file soplex.h.

◆ origCountLhs

template<class R >
int origCountLhs
private

Definition at line 1906 of file soplex.h.

◆ origCountLower

template<class R >
int origCountLower
private

Definition at line 1900 of file soplex.h.

◆ origCountRanged

template<class R >
int origCountRanged
private

Definition at line 1908 of file soplex.h.

◆ origCountRhs

template<class R >
int origCountRhs
private

Definition at line 1907 of file soplex.h.

◆ origCountUpper

template<class R >
int origCountUpper
private

Definition at line 1901 of file soplex.h.

◆ spxout

template<class R >
SPxOut spxout
mutable

Definition at line 1529 of file soplex.h.