173#include "spxdevexpr.hpp"
Safe arrays of arbitrary types.
SPxId selectEnterDenseDim(R &best, R feastol, int start=0, int incr=1)
SPxPricer::selectEnter() in dense case (slack variabels)
int selectLeaveX(R feastol, int start=0, int incr=1)
internal implementation of SPxPricer::selectLeave()
SPxDevexPR & operator=(const SPxDevexPR &rhs)
assignment operator
int selectLeaveHyper(R feastol)
implementation of hyper sparse pricing in the leaving Simplex
SPxDevexPR(const SPxDevexPR &old)
copy constructor
virtual SPxPricer< R > * clone() const
clone function for polymorphism
SPxId selectEnterSparseDim(R &best, R feastol)
implementation of sparse pricing in the entering Simplex (slack variables)
Array< typename SPxPricer< R >::IdxElement > pricesCo
temporary array of precomputed pricing values
int buildBestPriceVectorLeave(R feastol)
build up vector of pricing values for later use
SPxId selectEnterSparseCoDim(R &best, R feastol)
implementation of sparse pricing in the entering Simplex
SPxId selectEnterHyperDim(R &best, R feastol)
implementation of hyper sparse pricing in the entering Simplex
SPxId buildBestPriceVectorEnterDim(R &best, R feastol)
build up vector of pricing values for later use
virtual void addedCoVecs(int n)
n covectors have been added to loaded LP.
virtual ~SPxDevexPR()
destructor
bool refined
has a refinement step already been tried?
void setupWeights(typename SPxSolverBase< R >::Type)
set entering/leaving algorithm
virtual void entered4(SPxId id, int n)
SPxId selectEnterDenseCoDim(R &best, R feastol, int start=0, int incr=1)
SPxPricer::selectEnter() in dense case.
int selectLeaveSparse(R feastol)
implementation of sparse pricing in the leaving Simplex
virtual bool isConsistent() const
consistency check
virtual void load(SPxSolverBase< R > *base)
sets the solver
SPxId selectEnterX(R tol)
choose the best entering index among columns and rows but prefer sparsity
SPxId buildBestPriceVectorEnterCoDim(R &best, R feastol)
SPxId selectEnterHyperCoDim(R &best, R feastol)
implementation of hyper sparse pricing in the entering Simplex
DIdxSet bestPricesCo
set of best pricing candidates
virtual void setType(typename SPxSolverBase< R >::Type)
set entering/leaving algorithm
virtual void addedVecs(int n)
n vectors have been added to loaded LP.
virtual void setRep(typename SPxSolverBase< R >::Representation)
set row/column representation
Array< typename SPxPricer< R >::IdxElement > prices
temporary array of precomputed pricing values
virtual void left4(int n, SPxId id)
virtual int selectLeave()
SPxDevexPR()
default constructor
DIdxSet bestPrices
set of best pricing candidates
R last
penalty, selected at last iteration.
virtual SPxId selectEnter()
Generic Ids for LP rows or columns.
Abstract pricer base class.
SPxPricer & operator=(const SPxPricer &rhs)
assignment operator
Sequential object-oriented SimPlex.
Representation
LP basis representation.
Everything should be within this namespace.
Debugging, floating point type and parameter definitions.
Abstract pricer base class.