Loading...
Searching...
No Matches
SPxSolverBase< R > Class Template Reference Sequential object-oriented SimPlex. More...
Inheritance diagram for SPxSolverBase< R >:
![]()
Detailed Descriptiontemplate<class R> class soplex::SPxSolverBase< R > Sequential object-oriented SimPlex. SPxSolverBase is an LP solver class using the revised Simplex algorithm. It provides two basis representations, namely a column basis and a row basis (see Representation). For both representations, a primal and dual algorithm is available (see Type). In addition, SPxSolverBase can be customized with various respects:
SPxSolverBase is derived from SPxLPBase<R> that is used to store the LP to be solved. Hence, the LPs solved with SPxSolverBase have the general format \[ \begin{array}{rl} \hbox{max} & \mbox{maxObj}^T x \\ \hbox{s.t.} & \mbox{lhs} \le Ax \le \mbox{rhs} \\ & \mbox{low} \le x \le \mbox{up} \end{array} \] Also, SPxLPBase<R> provide all manipulation methods for the LP. They allow SPxSolverBase to be used within cutting plane algorithms. Definition at line 103 of file spxsolver.h. Member Enumeration Documentation◆ Pricing
template<class R >
Pricing type. In case of the ENTERing Simplex algorithm, for performance reasons it may be advisable not to compute and maintain up to date vectors pVec() and test() and instead compute only some of its elements explicitely. This is controled by the Pricing type.
Definition at line 170 of file spxsolver.h. ◆ Representation
template<class R >
LP basis representation. Solving LPs with the Simplex algorithm requires the definition of a basis. A basis can be defined as a set of column vectors or a set of row vectors building a nonsingular matrix. We will refer to the first case as the columnwise representation and the latter case will be called the rowwise representation. Type Representation determines the representation of SPxSolverBase, i.e. a columnwise (COLUMN == 1) or rowwise (ROW == -1) one.
Definition at line 123 of file spxsolver.h. ◆ SolutionPolish
template<class R >
objective for solution polishing Definition at line 232 of file spxsolver.h. ◆ Status
template<class R >
Definition at line 208 of file spxsolver.h. ◆ Type
template<class R >
Algorithmic type. SPxSolverBase uses the reviesed Simplex algorithm to solve LPs. Mathematically, one distinguishes the primal from the dual algorihm. Algorithmically, these relate to the two types ENTER or LEAVE. How they relate, depends on the chosen basis representation. This is desribed by the following table:
Definition at line 142 of file spxsolver.h. ◆ VarStatus
template<class R >
Definition at line 195 of file spxsolver.h. Constructor & Destructor Documentation◆ SPxSolverBase() [1/2]
template<class R >
default constructor. Constructors / destructors ◆ ~SPxSolverBase()
template<class R >
◆ SPxSolverBase() [2/2]
template<class R >
copy constructor Member Function Documentation◆ addedCols()
template<class R >
Reimplemented from SPxLPBase< R >. ◆ addedRows()
template<class R >
Reimplemented from SPxLPBase< R >. ◆ basis() [1/2]
template<class R >
Definition at line 1872 of file spxsolver.h. ◆ basis() [2/2]
template<class R >
Return current basis.
Definition at line 1867 of file spxsolver.h. Referenced by SPxSolverBase< R >::getBasisMetric(), SPxSolverBase< R >::iterations(), and SPxSolverBase< R >::statistics(). ◆ basisStatusToVarStatus()
template<class R >
converts basis status to VarStatus
◆ boundFlips()
template<class R >
get number of bound flips. Definition at line 2195 of file spxsolver.h. References SPxSolverBase< R >::totalboundflips. ◆ calculateProblemRanges()
template<class R >
determine ranges of problem values for bounds, sides and objective to assess numerical difficulties ◆ changeBounds() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeBounds(). ◆ changeBounds() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeBounds() [3/3]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1109 of file spxsolver.h. References SPxSolverBase< R >::changeBounds(), and SPxLPBase< R >::number(). ◆ changeCol() [1/2]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeCol(). ◆ changeCol() [2/2]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1161 of file spxsolver.h. References SPxSolverBase< R >::changeCol(), and SPxLPBase< R >::number(). ◆ changeElement() [1/2]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeElement(). ◆ changeElement() [2/2]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1169 of file spxsolver.h. References SPxSolverBase< R >::changeElement(), and SPxLPBase< R >::number(). ◆ changeLhs() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeLhs(). ◆ changeLhs() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeLhs() [3/3]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1122 of file spxsolver.h. References SPxSolverBase< R >::changeLhs(), and SPxLPBase< R >::number(). ◆ changeLhsStatus()
template<class R >
◆ changeLower() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeLower(). ◆ changeLower() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeLower() [3/3]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1086 of file spxsolver.h. References SPxSolverBase< R >::changeLower(), and SPxLPBase< R >::number(). ◆ changeLowerStatus()
template<class R >
◆ changeMaxObj() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeMaxObj(). ◆ changeMaxObj() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeMaxObj() [3/3]
template<class R >
overloading a virtual function Reimplemented from SPxLPBase< R >. Definition at line 1058 of file spxsolver.h. References SPxSolverBase< R >::changeMaxObj(), and SPxLPBase< R >::number(). ◆ changeObj() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeObj(). ◆ changeObj() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeObj() [3/3]
template<class R >
overloading a virtual function Reimplemented from SPxLPBase< R >. Definition at line 1048 of file spxsolver.h. References SPxSolverBase< R >::changeObj(), and SPxLPBase< R >::number(). ◆ changeRange() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeRange(). ◆ changeRange() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeRange() [3/3]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1145 of file spxsolver.h. References SPxSolverBase< R >::changeRange(), and SPxLPBase< R >::number(). ◆ changeRhs() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeRhs(). ◆ changeRhs() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeRhs() [3/3]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1134 of file spxsolver.h. References SPxSolverBase< R >::changeRhs(), and SPxLPBase< R >::number(). ◆ changeRhsStatus()
template<class R >
◆ changeRow() [1/2]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeRow(). ◆ changeRow() [2/2]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1153 of file spxsolver.h. References SPxSolverBase< R >::changeRow(), and SPxLPBase< R >::number(). ◆ changeRowObj() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeRowObj(). ◆ changeRowObj() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeRowObj() [3/3]
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1068 of file spxsolver.h. References SPxSolverBase< R >::changeRowObj(), and SPxLPBase< R >::number(). ◆ changeSense()
template<class R >
◆ changeUpper() [1/3]
template<class R >
Reimplemented from SPxLPBase< R >. Referenced by SPxSolverBase< R >::changeUpper(). ◆ changeUpper() [2/3]
template<class R >
Reimplemented from SPxLPBase< R >. ◆ changeUpper() [3/3]
template<class R >
overloading virtual function Reimplemented from SPxLPBase< R >. Definition at line 1098 of file spxsolver.h. References SPxSolverBase< R >::changeUpper(), and SPxLPBase< R >::number(). ◆ changeUpperStatus()
template<class R >
◆ clear()
template<class R >
clear all data in solver. Reimplemented from SPxLPBase< R >. ◆ clearDualBounds()
template<class R >
The following methods serve for initializing the bounds for dual or primal Simplex algorithm of entering or leaving type. ◆ clearRowObjs()
template<class R >
Reimplemented from SPxLPBase< R >. Definition at line 1073 of file spxsolver.h. References SPxLPBase< R >::clearRowObjs(), and SPxSolverBase< R >::unInit(). ◆ clearUpdateVecs()
template<class R >
◆ coDim()
template<class R >
codimension. Definition at line 1186 of file spxsolver.h. References SPxSolverBase< R >::thevectors. ◆ coId()
template<class R >
id of The Definition at line 1223 of file spxsolver.h. References SPxLPBase< R >::cId(), SPxSolverBase< R >::rep(), SPxLPBase< R >::rId(), and SPxSolverBase< R >::ROW. ◆ colId()
template<class R >
ColId of Definition at line 2341 of file spxsolver.h. References SPxLPBase< R >::cId(). ◆ cols()
template<class R >
return const lp's cols if available. Definition at line 2284 of file spxsolver.h. References SPxLPBase< R >::lpcolset(). ◆ computeCoTest()
template<class R >
compute coTest vector. ◆ computeDualfarkas4Col()
template<class R >
◆ computeDualfarkas4Row()
template<class R >
◆ computeEnterCoPrhs()
template<class R >
compute theCoPrhs for entering Simplex. ◆ computeEnterCoPrhs4Col()
template<class R >
◆ computeEnterCoPrhs4Row()
template<class R >
◆ computeFrhs()
template<class R >
compute feasibility vector from scratch. ◆ computeFrhs1()
template<class R >
◆ computeFrhs2()
template<class R >
◆ computeFrhsXtra()
template<class R >
◆ computeFtest()
template<class R >
compute basis feasibility test vector. ◆ computeLeaveCoPrhs()
template<class R >
compute theCoPrhs for leaving Simplex. ◆ computeLeaveCoPrhs4Col()
template<class R >
◆ computeLeaveCoPrhs4Row()
template<class R >
◆ computePrimalray4Col()
template<class R >
Compute the primal ray or the farkas proof in case of unboundedness or infeasibility. ◆ computePrimalray4Row()
template<class R >
◆ computePvec() [1/2]
template<class R >
compute entire pVec(). ◆ computePvec() [2/2]
template<class R >
compute and return pVec()[i]. ◆ computeTest() [1/2]
template<class R >
compute test VectorBase<R> in ENTERing Simplex. ◆ computeTest() [2/2]◆ coPrhs()
template<class R >
Right-hand side vector for coPvec. The vector coPvec is computed by solving a linear system with the basis matrix and coPrhs as the right-hand side vector. For column basis representation, coPrhs is build up of the objective vector elements of all basic variables. For a row basis, it consists of the tight bounds of all basic constraints. Definition at line 1517 of file spxsolver.h. References SPxSolverBase< R >::theCoPrhs. ◆ coPvec()
template<class R >
copricing vector. The copricing vector coPvec along with the pricing vector pVec are used for pricing in the ENTERing Simplex algorithm, i.e. one variable is selected, that violates its bounds. In contrast to this, the LEAVEing Simplex algorithm keeps both vectors within their bounds. Definition at line 1504 of file spxsolver.h. References SPxSolverBase< R >::theCoPvec. ◆ coTest() [1/2]
template<class R >
violations of coPvec. In entering Simplex pricing selects checks vectors coPvec() and pVec() for violation of its bounds. coTest() contains the violations for coPvec() which are indicated by a negative value. That is, if coTest()[i] < 0, the Definition at line 1571 of file spxsolver.h. References SPxSolverBase< R >::ENTER, SPxSolverBase< R >::theCoTest, and SPxSolverBase< R >::type(). ◆ coTest() [2/2]
template<class R >
test coVector ◆ covarStatus()
template<class R >
Status of Definition at line 1363 of file spxsolver.h. References SPxBasisBase< R >::Desc::coStatus(), and SPxBasisBase< R >::desc(). ◆ coVector() [1/4]
template<class R >
Definition at line 1320 of file spxsolver.h. References DataKey::isValid(), SPxLPBase< R >::number(), SPxSolverBase< R >::rep(), SPxSolverBase< R >::ROW, and SPxSolverBase< R >::unitVecs. ◆ coVector() [2/4]
template<class R >
coVector associated to
Definition at line 1334 of file spxsolver.h. References SPxSolverBase< R >::coVector(), SPxId::isSPxRowId(), and SPxId::isValid(). ◆ coVector() [3/4]
template<class R >
Definition at line 1312 of file spxsolver.h. References SPxSolverBase< R >::COLUMN, DataKey::isValid(), SPxLPBase< R >::number(), SPxSolverBase< R >::rep(), and SPxSolverBase< R >::unitVecs. ◆ coVector() [4/4]
template<class R >
Definition at line 1307 of file spxsolver.h. References SPxSolverBase< R >::thecovectors. Referenced by SPxSolverBase< R >::coVector(). ◆ cumulativeTime()
template<class R >
cumulative time spent in all calls to method solve(). Definition at line 2266 of file spxsolver.h. References SPxSolverBase< R >::theCumulativeTime. ◆ delta()
template<class R >
guaranteed primal and dual bound violation for optimal solution, returning the maximum of floatingPointFeastol() and floatingPointOpttol(). Definition at line 886 of file spxsolver.h. References SOPLEX_MAX, and SPxSolverBase< R >::tolerances(). ◆ dim()
template<class R >
dimension of basis matrix. Definition at line 1181 of file spxsolver.h. References SPxSolverBase< R >::thecovectors. ◆ doPupdate()
template<class R >
◆ doRemoveCol()
template<class R >
Reimplemented from SPxLPBase< R >. ◆ doRemoveCols()
template<class R >
Reimplemented from SPxLPBase< R >. ◆ doRemoveRow()
template<class R >
Reimplemented from SPxLPBase< R >. ◆ doRemoveRows()
template<class R >
Reimplemented from SPxLPBase< R >. ◆ dualDegeneratePivots()
template<class R >
get number of dual degenerate pivots Definition at line 2201 of file spxsolver.h. References SPxSolverBase< R >::enterCycles, SPxSolverBase< R >::leaveCycles, SPxSolverBase< R >::rep(), and SPxSolverBase< R >::ROW. ◆ dualIterations()
template<class R >
return number of iterations done with primal algorithm Definition at line 2238 of file spxsolver.h. References SPxSolverBase< R >::iterations(), and SPxSolverBase< R >::primalIterations(). ◆ enter()
template<class R >
let id enter the basis and manage leaving of another one.
◆ entertol()
template<class R >
feasibility tolerance maintained by ratio test during ENTER algorithm. Definition at line 855 of file spxsolver.h. References SPxSolverBase< R >::COLUMN, SPxSolverBase< R >::entertolscale, SPxSolverBase< R >::theRep, and SPxSolverBase< R >::tolerances(). ◆ enterVector()
template<class R >
Get pointer to the Definition at line 2002 of file spxsolver.h. References SPxId::isSPxRowId(), SPxId::isValid(), and SPxSolverBase< R >::vector(). ◆ epsilon()
template<class R >
values \(|x| < \epsilon\) are considered to be 0. if you want another value for epsilon, use Tolerances::setEpsilon(). Definition at line 850 of file spxsolver.h. References SPxSolverBase< R >::tolerances(). ◆ factorize()
template<class R >
Factorize basis matrix.
Reimplemented from SPxBasisBase< R >. ◆ factorizeAndRecompute()
template<class R >
helper method that computes a fresh factorization of the basis matrix (if at least one update has been performed) and recomputes Frhs, Fvec, CoPrhs, Pvec, and the nonbasic values. In LEAVE the Ftest is recomputed, in ENTER the CoTest and Test are recomputed. This method is called to eliminate accumulated errors from LU updates especially required before checking if the solver can terminate (optimality or objective limit) ◆ forceRecompNonbasicValue()
template<class R >
Definition at line 725 of file spxsolver.h. References SPxSolverBase< R >::m_nonbasicValue, and SPxSolverBase< R >::m_nonbasicValueUpToDate. ◆ fRhs()
template<class R >
right-hand side vector for fVec The feasibility vector is computed by solving a linear system with the basis matrix. The right-hand side vector of this system is referred to as feasibility, right-hand side vector fRhs(). For a row basis, fRhs() is the objective vector (ignoring shifts). For a column basis, it is the sum of all nonbasic vectors scaled by the factor of their bound. Definition at line 1442 of file spxsolver.h. References SPxSolverBase< R >::theFrhs. ◆ fTest()
template<class R >
Violations of fVec. For the leaving Simplex algorithm, pricing involves selecting a variable from fVec that violates its bounds that is to leave the basis. When a SPxPricer is called to select such a leaving variable, fTest() contains the vector of violations: For fTest()[i] < 0, the Definition at line 1491 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theCoTest, and SPxSolverBase< R >::type(). ◆ fVec()
template<class R >
feasibility vector. This method return the feasibility vector. If it satisfies its bound, the basis is called feasible (independently of the chosen representation). The feasibility vector has dimension dim(). For the entering Simplex, fVec is kept within its bounds. In contrast to this, the pricing of the leaving Simplex selects an element of fVec, that violates its bounds. Definition at line 1429 of file spxsolver.h. References SPxSolverBase< R >::theFvec. ◆ getBasis()
template<class R >
get current basis, and return solver status. ◆ getBasisColStatus()
template<class R >
gets basis status for a single column ◆ getBasisMetric()
template<class R >
Definition at line 991 of file spxsolver.h. References SPxSolverBase< R >::basis(), and SPxSolverBase< R >::type(). ◆ getBasisRowStatus()
template<class R >
gets basis status for a single row ◆ getBasisStatus()
template<class R >
gets basis status Definition at line 2146 of file spxsolver.h. References SPxBasisBase< R >::status(). ◆ getDegeneracyLevel()
template<class R >
get level of dual degeneracy ◆ getDisplayFreq()
template<class R >
get display frequency Definition at line 921 of file spxsolver.h. References SPxSolverBase< R >::displayFreq. ◆ getDualfarkas()
template<class R >
get dual farkas proof of infeasibility.
◆ getDualNorms()
template<class R >
get dual norms ◆ getDualSol()
template<class R >
get current solution VectorBase<R> for dual variables. This method returns the Status of the basis. If it is REGULAR or better, the VectorBase<R> of dual variables of the current basis will be copied to the argument
◆ getEnterVals()
template<class R >
◆ getEnterVals2()
template<class R >
◆ getLeaveVals()
template<class R >
◆ getLeaveVals2()
template<class R >
◆ getLhs()
template<class R >
copy lhs value VectorBase<R> to Definition at line 2301 of file spxsolver.h. References SPxLPBase< R >::lhs(). ◆ getLower()
template<class R >
copy lower bound VectorBase<R> to Definition at line 2290 of file spxsolver.h. References SPxLPBase< R >::lower(). ◆ getMaxIters()
template<class R >
the maximum number of iterations Definition at line 2272 of file spxsolver.h. References SPxSolverBase< R >::maxIters. ◆ getMaxTime()
template<class R >
the maximum runtime Definition at line 2260 of file spxsolver.h. References SPxSolverBase< R >::maxTime. ◆ getNdualNorms()
template<class R >
get number of dual norms ◆ getOldBasisStatusCols()Definition at line 947 of file spxsolver.h. References SPxSolverBase< R >::oldBasisStatusCols. ◆ getOldBasisStatusRows()Definition at line 941 of file spxsolver.h. References SPxSolverBase< R >::oldBasisStatusRows. ◆ getPrimalray()
template<class R >
get primal ray in case of unboundedness.
◆ getPrimalSol()
template<class R >
get solution vector for primal variables. This method returns the Status of the basis. If it is REGULAR or better, the primal solution vector of the current basis will be copied to the argument
◆ getRedCostSol()
template<class R >
get vector of reduced costs. This method returns the Status of the basis. If it is REGULAR or better, the vector of reduced costs of the current basis will be copied to the argument Let d denote the vector of dual variables, as defined above, and A the LPs constraint matrix. Then the reduced cost vector r is defined as \(r^T = c^T - d^TA\).
◆ getResult()
template<class R >
get all results of last solve. ◆ getRhs()
template<class R >
copy rhs value VectorBase<R> to Definition at line 2307 of file spxsolver.h. References SPxLPBase< R >::rhs(). ◆ getSlacks()
template<class R >
get VectorBase<R> of slack variables. This method returns the Status of the basis. If it is REGULAR or better, the slack variables of the current basis will be copied to the argument
◆ getSolutionPolishing()
template<class R >
return objective of solution polishing Definition at line 693 of file spxsolver.h. References SPxSolverBase< R >::polishObj. ◆ getTiming()
template<class R >
set timing type Definition at line 904 of file spxsolver.h. References SPxSolverBase< R >::multTimeColwise, SPxSolverBase< R >::multTimeFull, SPxSolverBase< R >::multTimeSparse, SPxSolverBase< R >::multTimeUnsetup, SPxSolverBase< R >::theTime, SPxSolverBase< R >::timerType, and Timer::type(). ◆ getUpper()
template<class R >
copy upper bound VectorBase<R> to Definition at line 2295 of file spxsolver.h. References SPxLPBase< R >::upper(). ◆ hyperPricing()
template<class R >
enable or disable hyper sparse pricing ◆ id()
template<class R >
id of The Definition at line 1204 of file spxsolver.h. References SPxLPBase< R >::cId(), SPxSolverBase< R >::rep(), SPxLPBase< R >::rId(), and SPxSolverBase< R >::ROW. ◆ init()
template<class R >
intialize data structures. If SPxSolverBase is not initialized, the method solve() calls init() to setup all vectors and internal data structures. Most of the other methods within this section are called by init(). Derived classes should add the initialization of additional data structures by overriding this method. Don't forget, however, to call SPxSolverBase<R>::init(). ◆ initRep()
template<class R >
◆ invalidateBasis()
template<class R >
invalidates the basis, triggers refactorization ◆ isBasic() [1/5]
template<class R >
is the Definition at line 1390 of file spxsolver.h. References SPxBasisBase< R >::desc(), SPxSolverBase< R >::isBasic(), and SPxLPBase< R >::number(). ◆ isBasic() [2/5]
template<class R >
is the Definition at line 1375 of file spxsolver.h. References SPxSolverBase< R >::isBasic(), SPxId::isSPxRowId(), and SPxId::isValid(). ◆ isBasic() [3/5]
template<class R >
is the Definition at line 1384 of file spxsolver.h. References SPxBasisBase< R >::desc(), SPxSolverBase< R >::isBasic(), and SPxLPBase< R >::number(). ◆ isBasic() [4/5]
template<class R >
is the Definition at line 1408 of file spxsolver.h. References SPxBasisBase< R >::desc(), SPxSolverBase< R >::isBasic(), and SPxSolverBase< R >::status(). ◆ isBasic() [5/5]
template<class R >
does Definition at line 1369 of file spxsolver.h. References SPxSolverBase< R >::rep(). Referenced by SPxSolverBase< R >::isBasic(), SPxSolverBase< R >::isBasic(), SPxSolverBase< R >::isBasic(), SPxSolverBase< R >::isBasic(), SPxSolverBase< R >::isCoBasic(), SPxSolverBase< R >::isColBasic(), and SPxSolverBase< R >::isRowBasic(). ◆ isBasisValid()check a given basis for validity. ◆ isCoBasic()
template<class R >
is the Definition at line 1414 of file spxsolver.h. References SPxBasisBase< R >::desc(), and SPxSolverBase< R >::isBasic(). ◆ isCoId()
template<class R >
Is This method returns wheather or not Definition at line 1250 of file spxsolver.h. References DataKey::info, and SPxSolverBase< R >::theRep. ◆ isColBasic()
template<class R >
is the Definition at line 1402 of file spxsolver.h. References SPxBasisBase< R >::desc(), and SPxSolverBase< R >::isBasic(). ◆ isConsistent()
template<class R >
check consistency. Miscellaneous ◆ isId()
template<class R >
Is This method returns wheather or not Definition at line 1241 of file spxsolver.h. References DataKey::info, and SPxSolverBase< R >::theRep. ◆ isInitialized()
template<class R >
has the internal data been initialized? As long as an instance of SPxSolverBase is not initialized, no member contains setup data. Initialization is performed via method init(). Afterwards all data structures are kept up to date (even for all manipulation methods), until unInit() is called. However, some manipulation methods call unInit() themselfs. Definition at line 1956 of file spxsolver.h. References SPxSolverBase< R >::initialized. ◆ isRowBasic()
template<class R >
is the Definition at line 1396 of file spxsolver.h. References SPxBasisBase< R >::desc(), and SPxSolverBase< R >::isBasic(). ◆ isTerminationValueEnabled()
template<class R >
true if objective limit should be used in the next solve Definition at line 699 of file spxsolver.h. References SPxSolverBase< R >::useTerminationValue. ◆ isTimeLimitReached()
template<class R >
returns whether current time limit is reached; call to time() may be skipped unless ◆ iterations()
template<class R >
get number of iterations of current solution. Definition at line 2225 of file spxsolver.h. References SPxSolverBase< R >::basis(). Referenced by SPxSolverBase< R >::dualIterations(), SPxSolverBase< R >::primalIterations(), and SPxSolverBase< R >::statistics(). ◆ lbBound() [1/2]
template<class R >
lower bound for fVec, writable. This method returns the lower bound for the feasibility vector. It may only be called for the ENTERing Simplex. For the ENTERing Simplex algorithms, the feasibility vector is maintained to fullfill its bounds. As fVec itself, also its bound depend on the chosen representation. Further, they may need to be shifted (see below). Definition at line 1478 of file spxsolver.h. References SPxSolverBase< R >::theLBbound. ◆ lbBound() [2/2]
template<class R >
lower bound for fVec. Definition at line 1465 of file spxsolver.h. References SPxSolverBase< R >::theLBbound. ◆ lcBound() [1/2]
template<class R >
lower bound for coPvec. This method returns the lower bound for coPvec. It may only be called for the leaving Simplex algorithm. For the leaving Simplex algorithms coPvec is maintained to fullfill its bounds. As coPvec itself, also its bound depend on the chosen representation. Further, they may need to be shifted (see below). Definition at line 1558 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theCoLbound, and SPxSolverBase< R >::theType. ◆ lcBound() [2/2]
template<class R >
Definition at line 1544 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theCoLbound, and SPxSolverBase< R >::theType. ◆ leave()
template<class R >
let index
◆ leavetol()
template<class R >
feasibility tolerance maintained by ratio test during LEAVE algorithm. Definition at line 863 of file spxsolver.h. References SPxSolverBase< R >::COLUMN, SPxSolverBase< R >::leavetolscale, SPxSolverBase< R >::theRep, and SPxSolverBase< R >::tolerances(). ◆ loadBasis()
template<class R >
set a start basis. ◆ loadLP()
template<class R >
copy LP. ◆ localAddCols()
template<class R >
◆ localAddRows()
template<class R >
◆ lpBound() [1/2]
template<class R >
lower bound for pVec. This method returns the lower bound for pVec. It may only be called for the leaving Simplex algorithm. For the leaving Simplex algorithms pVec is maintained to fullfill its bounds. As pVec itself, also its bound depend on the chosen representation. Further, they may need to be shifted (see below). Definition at line 1624 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theLbound, and SPxSolverBase< R >::theType. ◆ lpBound() [2/2]
template<class R >
Definition at line 1610 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theLbound, and SPxSolverBase< R >::theType. ◆ maxCycle()
template<class R >
maximum number of degenerate simplex steps before we detect cycling. SPxSolverBase considers a Simplex step as degenerate if the steplength does not exceed epsilon(). Cycling occurs if only degenerate steps are taken. To prevent this situation, SPxSolverBase perturbs the problem such that nondegenerate steps are ensured. maxCycle() controls how agressive such perturbation is performed, since no more than maxCycle() degenerate steps are accepted before perturbing the LP. The current number of consecutive degenerate steps is counted by numCycle(). Definition at line 975 of file spxsolver.h. References SPxSolverBase< R >::m_maxCycle. ◆ maxInfeas()
template<class R >
maximal infeasibility of basis This method is called before concluding optimality. Since it is possible that some stable implementation of class SPxRatioTester yielded a slightly infeasible (or unpriced) basis, this must be checked before terminating with an optimal solution. ◆ nonbasicValue()
template<class R >
◆ noViols()
template<class R >
check for violations above tol and immediately return false w/o checking the remaining values This method is useful for verifying whether an objective limit can be used as termination criterion ◆ numCycle()
template<class R >
actual number of degenerate simplex steps encountered so far. Definition at line 980 of file spxsolver.h. References SPxSolverBase< R >::m_numCycle. ◆ objValue()
template<class R >
get objective value of current solution. Definition at line 2109 of file spxsolver.h. References SPxSolverBase< R >::value(). ◆ operator=()
template<class R >
assignment operator assignment operator and copy constructor ◆ performSolutionPolishing()
template<class R >
Identify primal basic variables that have zero reduced costs and try to pivot them out of the basis to make them tight. This is supposed to decrease the number of fractional variables when solving LP relaxations of (mixed) integer programs. The objective must not be modified during this procedure.
◆ perturbMax() [1/2]
template<class R >
◆ perturbMax() [2/2]
template<class R >
◆ perturbMaxEnter()
template<class R >
perturb basis bounds. ◆ perturbMaxLeave()
template<class R >
perturb nonbasic bounds. ◆ perturbMin() [1/2]
template<class R >
◆ perturbMin() [2/2]
template<class R >
◆ perturbMinEnter()
template<class R >
◆ perturbMinLeave()
template<class R >
◆ polishIterations()
template<class R >
return number of iterations done with primal algorithm Definition at line 2244 of file spxsolver.h. References SPxSolverBase< R >::polishCount. ◆ precisionReached()
template<class R >
is the solution precise enough, or should we increase delta() ? ◆ pricer()
template<class R >
return loaded SPxPricer. Definition at line 1877 of file spxsolver.h. References SPxSolverBase< R >::thepricer. ◆ pricing()
template<class R >
return current Pricing. Definition at line 556 of file spxsolver.h. References SPxSolverBase< R >::thePricing. ◆ primalDegeneratePivots()
template<class R >
get number of primal degenerate pivots Definition at line 2207 of file spxsolver.h. References SPxSolverBase< R >::enterCycles, SPxSolverBase< R >::leaveCycles, SPxSolverBase< R >::rep(), and SPxSolverBase< R >::ROW. ◆ primalIterations()
template<class R >
return number of iterations done with primal algorithm Definition at line 2231 of file spxsolver.h. References SPxSolverBase< R >::iterations(), and SPxSolverBase< R >::primalCount. Referenced by SPxSolverBase< R >::dualIterations(). ◆ printDisplayLine()
template<class R >
print display line of flying table ◆ pVec()
template<class R >
pricing vector. The pricing vector pVec is the product of coPvec with the constraint matrix. As coPvec, also pVec is maintained within its bound for the leaving Simplex algorithm, while the bounds are tested for the entering Simplex. pVec is of dimension coDim(). Vector pVec() is only up to date for LEAVEing Simplex or FULL pricing in ENTERing Simplex. Definition at line 1584 of file spxsolver.h. References SPxSolverBase< R >::thePvec. ◆ qualBoundViolation()
template<class R >
get violations of bounds. ◆ qualConstraintViolation()
template<class R >
get violation of constraints. ◆ qualRedCostViolation()
template<class R >
get violation of optimality criterion. ◆ qualSlackViolation()
template<class R >
get the residuum |Ax-b|. ◆ ratiotester()
template<class R >
return loaded SPxRatioTester. Definition at line 1887 of file spxsolver.h. References SPxSolverBase< R >::theratiotester. ◆ read()
template<class R >
read LP from input stream. Reimplemented from SPxLPBase< R >. ◆ readBasisFile()
template<class R >
Load basis from ◆ reDim()
template<class R >
reset dimensions of vectors according to loaded LP. ◆ reinitializeVecs()
template<class R >
setup all vecs fresh ◆ rejectEnter()
template<class R >
◆ rejectLeave()
template<class R >
◆ reLoad()
template<class R >
reload LP. ◆ rep()
template<class R >
return the current basis representation. Definition at line 544 of file spxsolver.h. References SPxSolverBase< R >::theRep. Referenced by SPxSolverBase< R >::coId(), SPxSolverBase< R >::coVector(), SPxSolverBase< R >::coVector(), SPxSolverBase< R >::dualDegeneratePivots(), SPxSolverBase< R >::id(), SPxSolverBase< R >::isBasic(), SPxSolverBase< R >::primalDegeneratePivots(), SPxSolverBase< R >::vector(), and SPxSolverBase< R >::vector(). ◆ resetClockStats()
template<class R >
resets clock average statistics ◆ resetCumulativeTime()
template<class R >
reset cumulative time counter to zero. Definition at line 2189 of file spxsolver.h. References SPxSolverBase< R >::theCumulativeTime. ◆ rowId()
template<class R >
RowId of Mapping between numbers and Ids Definition at line 2336 of file spxsolver.h. References SPxLPBase< R >::rId(). ◆ rows()
template<class R >
return const lp's rows if available. Definition at line 2278 of file spxsolver.h. References SPxLPBase< R >::lprowset(). ◆ scaleEntertol()
template<class R >
scale the entering tolerance Definition at line 871 of file spxsolver.h. Referenced by SPxSolverBase< R >::scaleTolerances(). ◆ scaleLeavetol()
template<class R >
scale the leaving tolerance Definition at line 876 of file spxsolver.h. Referenced by SPxSolverBase< R >::scaleTolerances(). ◆ scaleTolerances()
template<class R >
Definition at line 880 of file spxsolver.h. References SPxSolverBase< R >::scaleEntertol(), and SPxSolverBase< R >::scaleLeavetol(). ◆ sense()
template<class R >
optimization sense. Definition at line 2313 of file spxsolver.h. References SPxLPBase< R >::spxSense(). ◆ setBasis()set the lp solver's basis. ◆ setBasisSolver()
template<class R >
setup linear solver to use. If ◆ setBasisStatus()
template<class R >
set the lp solver's basis status. Definition at line 2158 of file spxsolver.h. References SPxSolverBase< R >::m_status, SPxSolverBase< R >::OPTIMAL, SPxBasisBase< R >::setStatus(), and SPxSolverBase< R >::UNKNOWN. ◆ setDisplayFreq()
template<class R >
set display frequency Definition at line 915 of file spxsolver.h. References SPxSolverBase< R >::displayFreq. ◆ setDual()
template<class R >
◆ setDualColBounds()
template<class R >
◆ setDualNorms()
template<class R >
set dual norms ◆ setDualRowBounds()
template<class R >
◆ setEnterBound4Col()
template<class R >
◆ setEnterBound4Row()
template<class R >
◆ setEnterBounds()
template<class R >
◆ setFillFactor()
template<class R >
set refactor threshold for fill-in in current factor update compared to fill-in in last factorization Definition at line 520 of file spxsolver.h. ◆ setIntegralityInformation()
template<class R >
pass integrality information about the variables to the solver ◆ setLeaveBound4Col()
template<class R >
◆ setLeaveBound4Row()
template<class R >
◆ setLeaveBounds()
template<class R >
◆ setMemFactor()
template<class R >
set refactor threshold for memory growth in current factor update compared to the last factorization Definition at line 526 of file spxsolver.h. ◆ setMetricInformation()
template<class R >
print basis metric within the usual output Definition at line 927 of file spxsolver.h. References SPxSolverBase< R >::printBasisMetric, and SPxSolverBase< R >::type(). ◆ setNonzeroFactor()
template<class R >
set refactor threshold for nonzeros in last factorized basis matrix compared to updated basis matrix Definition at line 514 of file spxsolver.h. ◆ setOutstream()
template<class R >
Definition at line 486 of file spxsolver.h. References SPxSolverBase< R >::spxout. ◆ setPricer()
template<class R >
setup pricer to use. If ◆ setPricing()◆ setPrimal()
template<class R >
◆ setPrimalBounds()
template<class R >
setup feasibility bounds for entering algorithm ◆ setRedCost()
template<class R >
◆ setRep()
template<class R >
◆ setSlacks()
template<class R >
◆ setSolutionPolishing()
template<class R >
set objective of solution polishing (0: off, 1: max_basic_slack, 2: min_basic_slack) Definition at line 687 of file spxsolver.h. References SPxSolverBase< R >::polishObj. ◆ setSolverStatus()
template<class R >
setting the solver status external from the solve loop. Definition at line 2167 of file spxsolver.h. References SPxSolverBase< R >::m_status. ◆ setSolvingForBoosted()
template<class R >
Definition at line 953 of file spxsolver.h. References SPxSolverBase< R >::solvingForBoosted, and SPxSolverBase< R >::value(). ◆ setSparsePricingFactor()
template<class R >
Definition at line 933 of file spxsolver.h. References SPxSolverBase< R >::sparsePricingFactor. ◆ setStarter()
template<class R >
setup starting basis generator to use. If ◆ setStoreBasisFreqForBoosting()
template<class R >
Definition at line 959 of file spxsolver.h. References SPxSolverBase< R >::storeBasisSimplexFreq. ◆ setTerminationIter()
template<class R >
set iteration limit. ◆ setTerminationTime()set time limit. Limits and status inquiry ◆ setTerminationValue()
template<class R >
set objective limit. ◆ setTester()
template<class R >
setup ratio-tester to use. If ◆ setTiming()
template<class R >
set timing type Definition at line 893 of file spxsolver.h. References SPxSolverBase< R >::multTimeColwise, SPxSolverBase< R >::multTimeFull, SPxSolverBase< R >::multTimeSparse, SPxSolverBase< R >::multTimeUnsetup, TimerFactory::switchTimer(), SPxSolverBase< R >::theTime, and SPxSolverBase< R >::timerType. ◆ setTolerances()
template<class R >
set the _tolerances member variable Reimplemented from SPxLPBase< R >. Definition at line 493 of file spxsolver.h. References SPxLPBase< R >::_tolerances, and UpdateVector< R >::setTolerances(). ◆ setType()◆ setup4coSolve()
template<class R >
Setup vectors to be cosolved within Simplex loop. Load vector Definition at line 1828 of file spxsolver.h. References SPxSolverBase< R >::coSolveVector2, SPxSolverBase< R >::coSolveVector2rhs, SPxSolverBase< R >::ENTER, and SPxSolverBase< R >::type(). ◆ setup4coSolve2()
template<class R >
Setup vectors to be cosolved within Simplex loop. Load a second vector Definition at line 1840 of file spxsolver.h. References SPxSolverBase< R >::coSolveVector3, SPxSolverBase< R >::coSolveVector3rhs, SPxSolverBase< R >::ENTER, and SPxSolverBase< R >::type(). ◆ setup4solve()
template<class R >
Setup vectors to be solved within Simplex loop. Load vector Definition at line 1800 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::solveVector2, SPxSolverBase< R >::solveVector2rhs, and SPxSolverBase< R >::type(). ◆ setup4solve2()
template<class R >
Setup vectors to be solved within Simplex loop. Load a second additional vector Definition at line 1814 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::solveVector3, SPxSolverBase< R >::solveVector3rhs, and SPxSolverBase< R >::type(). ◆ setupPupdate()
template<class R >
◆ shift()
template<class R >
total current shift amount. Definition at line 1733 of file spxsolver.h. References SPxSolverBase< R >::theShift. ◆ shiftFvec()
template<class R >
Perform initial shifting to optain an feasible or pricable basis. ◆ shiftLBbound()
template<class R >
shift Definition at line 1690 of file spxsolver.h. References SPxSolverBase< R >::ENTER, SOPLEX_MAX, SPxSolverBase< R >::theLBbound, SPxSolverBase< R >::theShift, and SPxSolverBase< R >::theType. ◆ shiftLCbound()
template<class R >
shift Definition at line 1722 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SOPLEX_MAX, SPxSolverBase< R >::theCoLbound, SPxSolverBase< R >::theShift, and SPxSolverBase< R >::theType. ◆ shiftLPbound()
template<class R >
shift Definition at line 1706 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SOPLEX_MAX, SPxSolverBase< R >::theLbound, SPxSolverBase< R >::theShift, and SPxSolverBase< R >::theType. ◆ shiftPvec()
template<class R >
Perform initial shifting to optain an feasible or pricable basis. ◆ shiftUBbound()
template<class R >
shift Definition at line 1682 of file spxsolver.h. References SPxSolverBase< R >::ENTER, SOPLEX_MAX, SPxSolverBase< R >::theShift, SPxSolverBase< R >::theType, and SPxSolverBase< R >::theUBbound. ◆ shiftUCbound()
template<class R >
shift Definition at line 1714 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SOPLEX_MAX, SPxSolverBase< R >::theCoUbound, SPxSolverBase< R >::theShift, and SPxSolverBase< R >::theType. ◆ shiftUPbound()
template<class R >
shift Definition at line 1698 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SOPLEX_MAX, SPxSolverBase< R >::theShift, SPxSolverBase< R >::theType, and SPxSolverBase< R >::theUbound. ◆ slinSolver()
template<class R >
return loaded SLinSolver. Definition at line 1882 of file spxsolver.h. ◆ solve()
template<class R >
solve loaded LP. Solves the loaded LP by processing the Simplex iteration until the termination criteria is fullfilled (see terminate()). The SPxStatus of the solver will indicate the reason for termination.
◆ starter()
template<class R >
return current starter. Definition at line 562 of file spxsolver.h. References SPxSolverBase< R >::thestarter. ◆ statistics()
template<class R >
returns statistical information in form of a string. Definition at line 2319 of file spxsolver.h. References SPxSolverBase< R >::basis(), SPxSolverBase< R >::iterations(), and SPxSolverBase< R >::time(). ◆ status()
template<class R >
Status of solution process. Referenced by SPxSolverBase< R >::isBasic(). ◆ subversion()
template<class R >
return the internal subversion of SPxSolverBase as number Definition at line 539 of file spxsolver.h. References SOPLEX_SUBVERSION. ◆ sumDualDegeneracy()
template<class R >
get the sum of dual degeneracy Definition at line 2213 of file spxsolver.h. References SPxSolverBase< R >::dualDegenSum. ◆ sumPrimalDegeneracy()
template<class R >
get the sum of primal degeneracy Definition at line 2219 of file spxsolver.h. References SPxSolverBase< R >::primalDegenSum. ◆ terminate()
template<class R >
Termination criterion. This method is called in each Simplex iteration to determine, if the algorithm is to terminate. In this case a nonzero value is returned. This method is declared virtual to allow for implementation of other stopping criteria or using it as callback method within the Simplex loop, by overriding the method in a derived class. However, all implementations must terminate with the statement Note, that the Simplex loop stopped even when terminate() returns 0, if the LP has been solved to optimality (i.e. no further pricing succeeds and no shift is present). ◆ terminationIter()
template<class R >
return iteration limit. ◆ terminationTime()
template<class R >
return time limit. ◆ terminationValue()
template<class R >
return objective limit. ◆ test() [1/2]
template<class R >
Violations of pVec. In entering Simplex pricing selects checks vectors coPvec() and pVec() for violation of its bounds. Vector test() contains the violations for pVec(), i.e., if test()[i] < 0, the i'th element of pVec() is violated by test()[i]. Vector test() is only up to date for FULL pricing. Definition at line 1637 of file spxsolver.h. References SPxSolverBase< R >::ENTER, SPxSolverBase< R >::theTest, and SPxSolverBase< R >::type(). ◆ test() [2/2]
template<class R >
test VectorBase<R> ◆ testBounds()
template<class R >
◆ testVecs()
template<class R >
◆ time()
template<class R >
time spent in last call to method solve(). Definition at line 2250 of file spxsolver.h. References SPxSolverBase< R >::theTime, and Timer::time(). Referenced by SPxSolverBase< R >::statistics(). ◆ toggleTerminationValue()
template<class R >
toggle objective limit for next solve Definition at line 705 of file spxsolver.h. References SPxSolverBase< R >::useTerminationValue. ◆ tolerances()
template<class R >
returns current tolerances Definition at line 508 of file spxsolver.h. References SPxLPBase< R >::_tolerances. Referenced by SPxSolverBase< R >::delta(), SPxSolverBase< R >::entertol(), SPxSolverBase< R >::epsilon(), and SPxSolverBase< R >::leavetol(). ◆ type()
template<class R >
return current Type. Definition at line 550 of file spxsolver.h. References SPxSolverBase< R >::theType. Referenced by SPxSolverBase< R >::coTest(), SPxSolverBase< R >::fTest(), SPxSolverBase< R >::getBasisMetric(), SPxSolverBase< R >::setMetricInformation(), SPxSolverBase< R >::setup4coSolve(), SPxSolverBase< R >::setup4coSolve2(), SPxSolverBase< R >::setup4solve(), SPxSolverBase< R >::setup4solve2(), and SPxSolverBase< R >::test(). ◆ ubBound() [1/2]
template<class R >
upper bound for fVec, writable. This method returns the upper bound for the feasibility vector. It may only be called for the ENTERing Simplex. For the ENTERing Simplex algorithms, the feasibility vector is maintained to fullfill its bounds. As fVec itself, also its bounds depend on the chosen representation. Further, they may need to be shifted (see below). Definition at line 1460 of file spxsolver.h. References SPxSolverBase< R >::theUBbound. ◆ ubBound() [2/2]
template<class R >
upper bound for fVec. Definition at line 1447 of file spxsolver.h. References SPxSolverBase< R >::theUBbound. ◆ ucBound() [1/2]
template<class R >
upper bound for coPvec. This method returns the upper bound for coPvec. It may only be called for the leaving Simplex algorithm. For the leaving Simplex algorithms coPvec is maintained to fullfill its bounds. As coPvec itself, also its bound depend on the chosen representation. Further, they may need to be shifted (see below). Definition at line 1537 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theCoUbound, and SPxSolverBase< R >::theType. ◆ ucBound() [2/2]
template<class R >
Definition at line 1523 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theCoUbound, and SPxSolverBase< R >::theType. ◆ ungetEnterVal()
template<class R >
◆ unInit()
template<class R >
uninitialize data structures. Definition at line 1965 of file spxsolver.h. References SPxSolverBase< R >::initialized. Referenced by SPxSolverBase< R >::clearRowObjs(). ◆ unitVector()
template<class R >
return Definition at line 1342 of file spxsolver.h. References SPxSolverBase< R >::unitVecs. ◆ unscaleLPandReloadBasis()
template<class R >
unscales the LP and reloads the basis ◆ unShift()
template<class R >
remove shift as much as possible. ◆ upBound() [1/2]
template<class R >
upper bound for pVec. This method returns the upper bound for pVec. It may only be called for the leaving Simplex algorithm. For the leaving Simplex algorithms pVec is maintained to fullfill its bounds. As pVec itself, also its bound depend on the chosen representation. Further, they may need to be shifted (see below). Definition at line 1603 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theType, and SPxSolverBase< R >::theUbound. ◆ upBound() [2/2]
template<class R >
Definition at line 1589 of file spxsolver.h. References SPxSolverBase< R >::LEAVE, SPxSolverBase< R >::theType, and SPxSolverBase< R >::theUbound. ◆ updateCoTest()
template<class R >
recompute coTest vector. ◆ updateFtest()
template<class R >
update basis feasibility test vector. ◆ updateNonbasicValue()
template<class R >
◆ updateTest()
template<class R >
recompute test vector. ◆ useFullPerturbation()
template<class R >
perturb entire problem or only the bounds relevant to the current pivot Definition at line 986 of file spxsolver.h. References SPxSolverBase< R >::fullPerturbation. ◆ value()
template<class R >
current objective value.
Referenced by SPxSolverBase< R >::objValue(), and SPxSolverBase< R >::setSolvingForBoosted(). ◆ varStatus()
template<class R >
Status of Definition at line 1357 of file spxsolver.h. References SPxBasisBase< R >::desc(), and SPxBasisBase< R >::Desc::status(). ◆ varStatusToBasisStatusCol()
template<class R >
converts VarStatus to basis status for columns ◆ varStatusToBasisStatusRow()
template<class R >
converts VarStatus to basis status for rows ◆ vector() [1/4]
template<class R >
Definition at line 1277 of file spxsolver.h. References SPxSolverBase< R >::COLUMN, DataKey::isValid(), SPxLPBase< R >::number(), SPxSolverBase< R >::rep(), and SPxSolverBase< R >::unitVecs. ◆ vector() [2/4]
template<class R >
VectorBase<R> associated to
Definition at line 1294 of file spxsolver.h. References SPxId::isSPxRowId(), SPxId::isValid(), and SPxSolverBase< R >::vector(). ◆ vector() [3/4]
template<class R >
Definition at line 1269 of file spxsolver.h. References DataKey::isValid(), SPxLPBase< R >::number(), SPxSolverBase< R >::rep(), SPxSolverBase< R >::ROW, and SPxSolverBase< R >::unitVecs. ◆ vector() [4/4]
template<class R >
Definition at line 1263 of file spxsolver.h. References SPxSolverBase< R >::thevectors. Referenced by SPxSolverBase< R >::enterVector(), and SPxSolverBase< R >::vector(). ◆ version()
template<class R >
return the version of SPxSolverBase as number like 123 for 1.2.3 Definition at line 534 of file spxsolver.h. References SOPLEX_VERSION. ◆ writeBasisFile()
template<class R >
Write basis to ◆ writeState()
template<class R >
Write current LP, basis, and parameter settings. LP is written in MPS format to "\p filename".mps, basis is written in "\p filename".bas, and parameters are written to "\p filename".set. If Member Data Documentation◆ addVec
template<class R >
storage for thePvec = &addVec Definition at line 351 of file spxsolver.h. ◆ boundflips
template<class R >
number of performed bound flips Definition at line 399 of file spxsolver.h. ◆ boundrange
template<class R >
absolute range of all bounds in the problem Definition at line 413 of file spxsolver.h. ◆ coSolveVector2
template<class R >
when 2 systems are to be solved at a time; typically for speepest edge weights Definition at line 290 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4coSolve(). ◆ coSolveVector2rhs
template<class R >
when 2 systems are to be solved at a time; typically for speepest edge weights Definition at line 292 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4coSolve(). ◆ coSolveVector3
template<class R >
when 3 systems are to be solved at a time; typically reserved for bound flipping ratio test (basic solution will be modified!) Definition at line 294 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4coSolve2(). ◆ coSolveVector3rhs
template<class R >
when 3 systems are to be solved at a time; typically reserved for bound flipping ratio test (basic solution will be modified!) Definition at line 296 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4coSolve2(). ◆ coWeights
template<class R >
store dual norms Definition at line 467 of file spxsolver.h. ◆ displayFreq
template<class R >
Definition at line 320 of file spxsolver.h. Referenced by SPxSolverBase< R >::getDisplayFreq(), and SPxSolverBase< R >::setDisplayFreq(). ◆ displayLine
template<class R >
Definition at line 319 of file spxsolver.h. ◆ dualDegenSum
template<class R >
the sum of the dual degeneracy percentage Definition at line 407 of file spxsolver.h. Referenced by SPxSolverBase< R >::sumDualDegeneracy(). ◆ dualFarkas
template<class R >
stores dual farkas proof in case of infeasibility Definition at line 392 of file spxsolver.h. ◆ dualRhs
template<class R >
rhs VectorBase<R> for computing the dual vector Definition at line 349 of file spxsolver.h. ◆ dualVec
template<class R >
dual vector Definition at line 350 of file spxsolver.h. ◆ enterCount
template<class R >
number of ENTER iterations Definition at line 395 of file spxsolver.h. ◆ enterCycles
template<class R >
the number of degenerate steps during the entering algorithm Definition at line 402 of file spxsolver.h. Referenced by SPxSolverBase< R >::dualDegeneratePivots(), and SPxSolverBase< R >::primalDegeneratePivots(). ◆ enterDegenCand
template<class R >
the number of degenerate candidates in the entering algorithm Definition at line 404 of file spxsolver.h. ◆ entertolscale
template<class R >
factor to temporarily decrease the entering tolerance Definition at line 273 of file spxsolver.h. Referenced by SPxSolverBase< R >::entertol(). ◆ freePricer
template<class R >
true iff thepricer should be freed inside of object Definition at line 298 of file spxsolver.h. ◆ freeRatioTester
template<class R >
true iff theratiotester should be freed inside of object Definition at line 299 of file spxsolver.h. ◆ freeStarter
template<class R >
true iff thestarter should be freed inside of object Definition at line 300 of file spxsolver.h. ◆ fullPerturbation
template<class R >
whether to perturb the entire problem or just the bounds relevant for the current pivot Definition at line 332 of file spxsolver.h. Referenced by SPxSolverBase< R >::useFullPerturbation(). ◆ hyperPricingEnter
template<class R >
true if hyper sparse pricing is turned on in the entering Simplex Definition at line 459 of file spxsolver.h. ◆ hyperPricingLeave
template<class R >
true if hyper sparse pricing is turned on in the leaving Simplex Definition at line 458 of file spxsolver.h. ◆ infeasibilities
template<class R >
For the leaving Simplex algorithm this vector contains the indices of infeasible basic variables; for the entering Simplex algorithm this vector contains the indices of infeasible slack variables. Definition at line 436 of file spxsolver.h. ◆ infeasibilitiesCo
template<class R >
For the entering Simplex algorithm these vectors contains the indices of infeasible basic variables. Definition at line 439 of file spxsolver.h. ◆ initialized
template<class R >
true, if all vectors are setup. Definition at line 279 of file spxsolver.h. Referenced by SPxSolverBase< R >::isInitialized(), and SPxSolverBase< R >::unInit(). ◆ instableEnter
template<class R >
Definition at line 313 of file spxsolver.h. ◆ instableEnterId
template<class R >
Definition at line 312 of file spxsolver.h. ◆ instableEnterVal
template<class R >
Definition at line 314 of file spxsolver.h. ◆ instableLeave
template<class R >
Definition at line 306 of file spxsolver.h. ◆ instableLeaveNum
template<class R >
Definition at line 305 of file spxsolver.h. ◆ instableLeaveVal
template<class R >
Definition at line 307 of file spxsolver.h. ◆ integerVariables
template<class R >
supplementary variable information, 0: continous variable, 1: integer variable Definition at line 483 of file spxsolver.h. ◆ isInfeasible
template<class R >
0: index not violated, 1: index violated, 2: index violated and among candidate list Binary vectors to store whether basic indices are infeasible the i-th entry equals false, if the i-th basic variable is not infeasible the i-th entry equals true, if the i-th basic variable is infeasible Definition at line 450 of file spxsolver.h. ◆ isInfeasibleCo
template<class R >
0: index not violated, 1: index violated, 2: index violated and among candidate list Definition at line 452 of file spxsolver.h. ◆ lastShift
template<class R >
for forcing feasibility. Definition at line 276 of file spxsolver.h. ◆ leaveCount
template<class R >
number of LEAVE iterations Definition at line 394 of file spxsolver.h. ◆ leaveCycles
template<class R >
the number of degenerate steps during the leaving algorithm Definition at line 403 of file spxsolver.h. Referenced by SPxSolverBase< R >::dualDegeneratePivots(), and SPxSolverBase< R >::primalDegeneratePivots(). ◆ leaveDegenCand
template<class R >
the number of degenerate candidates in the leaving algorithm Definition at line 405 of file spxsolver.h. ◆ leavetolscale
template<class R >
factor to temporarily decrease the leaving tolerance Definition at line 274 of file spxsolver.h. Referenced by SPxSolverBase< R >::leavetol(). ◆ m_maxCycle
template<class R >
maximum steps before cycling is detected. Definition at line 277 of file spxsolver.h. Referenced by SPxSolverBase< R >::maxCycle(). ◆ m_nonbasicValue
template<class R >
nonbasic part of current objective value Definition at line 262 of file spxsolver.h. Referenced by SPxSolverBase< R >::forceRecompNonbasicValue(). ◆ m_nonbasicValueUpToDate
template<class R >
true, if the stored objValue is up to date Definition at line 263 of file spxsolver.h. Referenced by SPxSolverBase< R >::forceRecompNonbasicValue(). ◆ m_numCycle
template<class R >
actual number of degenerate steps so far. Definition at line 278 of file spxsolver.h. Referenced by SPxSolverBase< R >::numCycle(). ◆ m_numViol
template<class R >
number of violations of current solution Definition at line 271 of file spxsolver.h. ◆ m_pricingViol
template<class R >
maximal feasibility violation of current solution Definition at line 265 of file spxsolver.h. ◆ m_pricingViolCo
template<class R >
maximal feasibility violation of current solution in coDim Definition at line 269 of file spxsolver.h. ◆ m_pricingViolCoUpToDate
template<class R >
true, if the stored violation in coDim is up to date Definition at line 270 of file spxsolver.h. ◆ m_pricingViolUpToDate
template<class R >
true, if the stored violation is up to date Definition at line 266 of file spxsolver.h. ◆ m_status
template<class R >
status of algorithm. Definition at line 260 of file spxsolver.h. Referenced by SPxSolverBase< R >::setBasisStatus(), and SPxSolverBase< R >::setSolverStatus(). ◆ maxIters
template<class R >
maximum allowed iterations. Definition at line 254 of file spxsolver.h. Referenced by SPxSolverBase< R >::getMaxIters(). ◆ maxTime
template<class R >
maximum allowed time. Definition at line 255 of file spxsolver.h. Referenced by SPxSolverBase< R >::getMaxTime(). ◆ multColwiseCalls
template<class R >
number of products, columnwise multiplication Definition at line 477 of file spxsolver.h. ◆ multFullCalls
template<class R >
number of products ignoring sparsity Definition at line 476 of file spxsolver.h. ◆ multSparseCalls
template<class R >
number of products exploiting sparsity Definition at line 475 of file spxsolver.h. ◆ multTimeColwise
template<class R >
time spent in setupPupdate(), columnwise multiplication Definition at line 473 of file spxsolver.h. Referenced by SPxSolverBase< R >::getTiming(), and SPxSolverBase< R >::setTiming(). ◆ multTimeFull
template<class R >
time spent in setupPupdate() ignoring sparsity Definition at line 472 of file spxsolver.h. Referenced by SPxSolverBase< R >::getTiming(), and SPxSolverBase< R >::setTiming(). ◆ multTimeSparse
template<class R >
time spent in setupPupdate() exploiting sparsity Definition at line 471 of file spxsolver.h. Referenced by SPxSolverBase< R >::getTiming(), and SPxSolverBase< R >::setTiming(). ◆ multTimeUnsetup
template<class R >
time spent in setupPupdate() w/o sparsity information Definition at line 474 of file spxsolver.h. Referenced by SPxSolverBase< R >::getTiming(), and SPxSolverBase< R >::setTiming(). ◆ multUnsetupCalls
template<class R >
number of products w/o sparsity information Definition at line 478 of file spxsolver.h. ◆ nCallsToTimelim
template<class R >
Definition at line 257 of file spxsolver.h. ◆ nClckSkipsLeft
template<class R >
remaining number of times the clock can be safely skipped Definition at line 256 of file spxsolver.h. ◆ objLimit
template<class R >
< the number of calls to the method isTimeLimitReached() objective value limit. Definition at line 258 of file spxsolver.h. ◆ objrange
template<class R >
absolute range of all objective coefficients in the problem Definition at line 415 of file spxsolver.h. ◆ oldBasisStatusColsThey don't have setters because only the internal simplex method is meant to fill them. Definition at line 325 of file spxsolver.h. Referenced by SPxSolverBase< R >::getOldBasisStatusCols(). ◆ oldBasisStatusRowsstored stable basis met before a simplex pivot (used to warm start the solver) Definition at line 323 of file spxsolver.h. Referenced by SPxSolverBase< R >::getOldBasisStatusRows(). ◆ polishCount
template<class R >
number of solution polishing iterations Definition at line 397 of file spxsolver.h. Referenced by SPxSolverBase< R >::polishIterations(). ◆ polishObj
template<class R >
objective of solution polishing Definition at line 250 of file spxsolver.h. Referenced by SPxSolverBase< R >::getSolutionPolishing(), and SPxSolverBase< R >::setSolutionPolishing(). ◆ primalCount
template<class R >
number of primal iterations Definition at line 396 of file spxsolver.h. Referenced by SPxSolverBase< R >::primalIterations(). ◆ primalDegenSum
template<class R >
the sum of the primal degeneracy percentage Definition at line 406 of file spxsolver.h. Referenced by SPxSolverBase< R >::sumPrimalDegeneracy(). ◆ primalRay
template<class R >
stores primal ray in case of unboundedness Definition at line 391 of file spxsolver.h. ◆ primRhs
template<class R >
rhs VectorBase<R> for computing the primal vector Definition at line 347 of file spxsolver.h. ◆ primVec
template<class R >
primal vector Definition at line 348 of file spxsolver.h. ◆ printBasisMetric
template<class R >
printing the current basis metric in the log (-1: off, 0: condition estimate, 1: trace, 2: determinant, 3: condition) Definition at line 334 of file spxsolver.h. Referenced by SPxSolverBase< R >::setMetricInformation(). ◆ random
template<class R >
The random number generator used throughout the whole computation. Its seed can be modified. Definition at line 431 of file spxsolver.h. ◆ recomputedVectors
template<class R >
flag to perform clean up step to reduce numerical errors only once Definition at line 317 of file spxsolver.h. ◆ remainingRoundsEnter
template<class R >
Definition at line 462 of file spxsolver.h. ◆ remainingRoundsEnterCo
template<class R >
Definition at line 463 of file spxsolver.h. ◆ remainingRoundsLeave
template<class R >
number of dense rounds/refactorizations until sparsePricing is enabled again Definition at line 461 of file spxsolver.h. ◆ siderange
template<class R >
absolute range of all side in the problem Definition at line 414 of file spxsolver.h. ◆ solveVector2
template<class R >
when 2 systems are to be solved at a time; typically for speepest edge weights Definition at line 282 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4solve(). ◆ solveVector2rhs
template<class R >
when 2 systems are to be solved at a time; typically for speepest edge weights Definition at line 284 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4solve(). ◆ solveVector3
template<class R >
when 3 systems are to be solved at a time; typically reserved for bound flipping ratio test (basic solution will be modified!) Definition at line 286 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4solve2(). ◆ solveVector3rhs
template<class R >
when 3 systems are to be solved at a time; typically reserved for bound flipping ratio test (basic solution will be modified!) Definition at line 288 of file spxsolver.h. Referenced by SPxSolverBase< R >::setup4solve2(). ◆ solvingForBoosted
template<class R >
is this solver involved in a higher precision solving scheme? Definition at line 328 of file spxsolver.h. Referenced by SPxSolverBase< R >::setSolvingForBoosted(). ◆ sparsePricingEnter
template<class R >
true if sparsePricing is turned on in the entering Simplex for slack variables Definition at line 456 of file spxsolver.h. ◆ sparsePricingEnterCo
template<class R >
true if sparsePricing is turned on in the entering Simplex Definition at line 457 of file spxsolver.h. ◆ sparsePricingFactor
template<class R >
enable sparse pricing when viols < factor * dim() Definition at line 321 of file spxsolver.h. Referenced by SPxSolverBase< R >::setSparsePricingFactor(). ◆ sparsePricingLeave
template<class R >
These values enable or disable sparse pricing. true if sparsePricing is turned on in the leaving Simplex Definition at line 455 of file spxsolver.h. ◆ SPxBoundFlippingRT< R >
template<class R >
Definition at line 106 of file spxsolver.h. ◆ SPxFastRT< R >
template<class R >
Definition at line 105 of file spxsolver.h. ◆ spxout
template<class R >
message handler Definition at line 480 of file spxsolver.h. Referenced by SPxSolverBase< R >::setOutstream(). ◆ storeBasisSimplexFreq
template<class R >
number of simplex pivots -1 to perform before storing stable basis Definition at line 329 of file spxsolver.h. Referenced by SPxSolverBase< R >::setStoreBasisFreqForBoosting(). ◆ theCoLbound
template<class R >
Lower bound for covars. Definition at line 385 of file spxsolver.h. Referenced by SPxSolverBase< R >::lcBound(), SPxSolverBase< R >::lcBound(), and SPxSolverBase< R >::shiftLCbound(). ◆ theCoPrhs
template<class R >
Definition at line 372 of file spxsolver.h. Referenced by SPxSolverBase< R >::coPrhs(). ◆ theCoPvec
template<class R >
Definition at line 373 of file spxsolver.h. Referenced by SPxSolverBase< R >::coPvec(). ◆ theCoTest
template<class R >
Definition at line 388 of file spxsolver.h. Referenced by SPxSolverBase< R >::coTest(), and SPxSolverBase< R >::fTest(). ◆ theCoUbound
template<class R >
Upper bound for covars. Definition at line 384 of file spxsolver.h. Referenced by SPxSolverBase< R >::shiftUCbound(), SPxSolverBase< R >::ucBound(), and SPxSolverBase< R >::ucBound(). ◆ thecovectors
template<class R >
the LP coVectors according to representation Definition at line 345 of file spxsolver.h. Referenced by SPxSolverBase< R >::coVector(), and SPxSolverBase< R >::dim(). ◆ theCPvec
template<class R >
column pricing vector Definition at line 378 of file spxsolver.h. ◆ theCumulativeTime
template<class R >
cumulative time spent in all calls to method solve() Definition at line 253 of file spxsolver.h. Referenced by SPxSolverBase< R >::cumulativeTime(), and SPxSolverBase< R >::resetCumulativeTime(). ◆ theFrhs
template<class R >
The values of the rhs corresponding to the current basis. Definition at line 367 of file spxsolver.h. Referenced by SPxSolverBase< R >::fRhs(). ◆ theFvec
template<class R >
The values of all basis variables. Definition at line 369 of file spxsolver.h. Referenced by SPxSolverBase< R >::fVec(). ◆ theLBbound
template<class R >
Lower Basic Feasibility bound. Definition at line 364 of file spxsolver.h. Referenced by SPxSolverBase< R >::lbBound(), SPxSolverBase< R >::lbBound(), and SPxSolverBase< R >::shiftLBbound(). ◆ theLbound
template<class R >
Lower bound for vars. Definition at line 383 of file spxsolver.h. Referenced by SPxSolverBase< R >::lpBound(), SPxSolverBase< R >::lpBound(), and SPxSolverBase< R >::shiftLPbound(). ◆ theLCbound
template<class R >
Lower Column Feasibility bound. Definition at line 356 of file spxsolver.h. ◆ theLRbound
template<class R >
Lower Row Feasibility bound. Definition at line 354 of file spxsolver.h. ◆ thepricer
template<class R >
Definition at line 409 of file spxsolver.h. Referenced by SPxSolverBase< R >::pricer(). ◆ thePricing
template<class R >
full or partial pricing. Definition at line 248 of file spxsolver.h. Referenced by SPxSolverBase< R >::pricing(). ◆ thePvec
template<class R >
The pricing VectorBase<R> Definition at line 375 of file spxsolver.h. Referenced by SPxSolverBase< R >::pVec(). ◆ theratiotester
template<class R >
Definition at line 410 of file spxsolver.h. Referenced by SPxSolverBase< R >::ratiotester(). ◆ theRep
template<class R >
row or column representation. Definition at line 249 of file spxsolver.h. Referenced by SPxSolverBase< R >::entertol(), SPxSolverBase< R >::isCoId(), SPxSolverBase< R >::isId(), SPxSolverBase< R >::leavetol(), and SPxSolverBase< R >::rep(). ◆ theRPvec
template<class R >
row pricing vector Definition at line 377 of file spxsolver.h. ◆ theShift
template<class R >
sum of all shifts applied to any bound. Definition at line 275 of file spxsolver.h. Referenced by SPxSolverBase< R >::shift(), SPxSolverBase< R >::shiftLBbound(), SPxSolverBase< R >::shiftLCbound(), SPxSolverBase< R >::shiftLPbound(), SPxSolverBase< R >::shiftUBbound(), SPxSolverBase< R >::shiftUCbound(), and SPxSolverBase< R >::shiftUPbound(). ◆ thestarter
template<class R >
Definition at line 411 of file spxsolver.h. Referenced by SPxSolverBase< R >::starter(). ◆ theTest
template<class R >
Definition at line 389 of file spxsolver.h. Referenced by SPxSolverBase< R >::test(). ◆ theTime
template<class R >
time spent in last call to method solve() Definition at line 251 of file spxsolver.h. Referenced by SPxSolverBase< R >::getTiming(), SPxSolverBase< R >::setTiming(), and SPxSolverBase< R >::time(). ◆ theType
template<class R >
entering or leaving algortihm. Definition at line 247 of file spxsolver.h. Referenced by SPxSolverBase< R >::lcBound(), SPxSolverBase< R >::lcBound(), SPxSolverBase< R >::lpBound(), SPxSolverBase< R >::lpBound(), SPxSolverBase< R >::shiftLBbound(), SPxSolverBase< R >::shiftLCbound(), SPxSolverBase< R >::shiftLPbound(), SPxSolverBase< R >::shiftUBbound(), SPxSolverBase< R >::shiftUCbound(), SPxSolverBase< R >::shiftUPbound(), SPxSolverBase< R >::type(), SPxSolverBase< R >::ucBound(), SPxSolverBase< R >::ucBound(), SPxSolverBase< R >::upBound(), and SPxSolverBase< R >::upBound(). ◆ theUBbound
template<class R >
Upper Basic Feasibility bound. In entering Simplex algorithm, the ratio test must ensure that all basic variables remain within their feasibility bounds. To give fast acces to them, the bounds of basic variables are copied into the following two vectors. Definition at line 363 of file spxsolver.h. Referenced by SPxSolverBase< R >::shiftUBbound(), SPxSolverBase< R >::ubBound(), and SPxSolverBase< R >::ubBound(). ◆ theUbound
template<class R >
Upper bound for vars. Definition at line 382 of file spxsolver.h. Referenced by SPxSolverBase< R >::shiftUPbound(), SPxSolverBase< R >::upBound(), and SPxSolverBase< R >::upBound(). ◆ theUCbound
template<class R >
Upper Column Feasibility bound. Definition at line 355 of file spxsolver.h. ◆ theURbound
template<class R >
Upper Row Feasibility bound. Definition at line 353 of file spxsolver.h. ◆ thevectors
template<class R >
the LP vectors according to representation Definition at line 344 of file spxsolver.h. Referenced by SPxSolverBase< R >::coDim(), and SPxSolverBase< R >::vector(). ◆ timerType
template<class R >
type of timer (user or wallclock) Definition at line 252 of file spxsolver.h. Referenced by SPxSolverBase< R >::getTiming(), and SPxSolverBase< R >::setTiming(). ◆ totalboundflips
template<class R >
total number of bound flips Definition at line 400 of file spxsolver.h. Referenced by SPxSolverBase< R >::boundFlips(). ◆ unitVecs
template<class R >
array of unit vectors Definition at line 343 of file spxsolver.h. Referenced by SPxSolverBase< R >::coVector(), SPxSolverBase< R >::coVector(), SPxSolverBase< R >::unitVector(), SPxSolverBase< R >::vector(), and SPxSolverBase< R >::vector(). ◆ updateViols
template<class R >
store indices that were changed in the previous iteration and must be checked in hyper pricing Definition at line 442 of file spxsolver.h. ◆ updateViolsCo
template<class R >
Definition at line 443 of file spxsolver.h. ◆ useTerminationValue
template<class R >
true, if objective limit should be used in the next solve. Definition at line 259 of file spxsolver.h. Referenced by SPxSolverBase< R >::isTerminationValueEnabled(), and SPxSolverBase< R >::toggleTerminationValue(). ◆ weights
template<class R >
◆ weightsAreSetup
template<class R >
are the dual norms already set up? Definition at line 468 of file spxsolver.h.
|