spxdevexpr.cpp
Go to the documentation of this file.
168 MSG_INFO3( (*thesolver->spxout), (*thesolver->spxout) << "WDEVEX02 trying refinement step..\n"; ) 233 assert(thesolver->isInfeasible[idx] == VIOLATED || thesolver->isInfeasible[idx] == VIOLATED_AND_CHECKED); 459 MSG_INFO3( (*thesolver->spxout), (*thesolver->spxout) << "WDEVEX02 trying refinement step..\n"; ) 484 enterCoId = (thesolver->sparsePricingEnter) ? buildBestPriceVectorEnterDim(best, tol) : selectEnterDenseDim(best, tol); 486 enterCoId = (thesolver->sparsePricingEnter) ? selectEnterHyperDim(best, tol) : selectEnterDenseDim(best, tol); 489 enterId = (thesolver->sparsePricingEnterCo) ? buildBestPriceVectorEnterCoDim(bestCo, tol) : selectEnterDenseCoDim(bestCo, tol); 491 enterId = (thesolver->sparsePricingEnterCo) ? selectEnterHyperCoDim(bestCo, tol) : selectEnterDenseCoDim(bestCo, tol); 495 enterCoId = (thesolver->sparsePricingEnter && !refined) ? selectEnterSparseDim(best, tol) : selectEnterDenseDim(best, tol); 496 enterId = (thesolver->sparsePricingEnterCo && !refined) ? selectEnterSparseCoDim(bestCo, tol) : selectEnterDenseCoDim(bestCo, tol); 499 // prefer coIds to increase the number of unit vectors in the basis matrix, i.e., rows in colrep and cols in rowrep
void reDim(int newdim, const bool setZero=true) Resets DVectorBase's dimension to newdim. Definition: dvectorbase.h:249 SPxId buildBestPriceVectorEnterCoDim(Real &best, Real feastol) Definition: spxdevexpr.cpp:398 DIdxSet updateViols store indices that were changed in the previous iteration and must be checked in hyper pricing ... Definition: spxsolver.h:363 DataArray< IdxElement > pricesCo temporary array of precomputed pricing values Definition: spxdevexpr.h:52 bool isValid() const returns TRUE iff the id is a valid column or row identifier. Definition: spxid.h:150 bool sparsePricingEnterCo true if sparsePricing is turned on in the entering Simplex Definition: spxsolver.h:376 DataArray< int > isInfeasible 0: index not violated, 1: index violated, 2: index violated and among candidate list ... Definition: spxsolver.h:370 SPxId selectEnterDenseCoDim(Real &best, Real feastol, int start=0, int incr=1) SPxPricer::selectEnter() in dense case. Definition: spxdevexpr.cpp:778 SPxId buildBestPriceVectorEnterDim(Real &best, Real feastol) build up vector of pricing values for later use Definition: spxdevexpr.cpp:348 Devex pricer. SPxId selectEnterSparseCoDim(Real &best, Real feastol) implementation of sparse pricing in the entering Simplex Definition: spxdevexpr.cpp:708 int buildBestPriceVectorLeave(Real feastol) build up vector of pricing values for later use Definition: spxdevexpr.cpp:102 Generic Ids for LP rows or columns.Both SPxColIds and SPxRowIds may be treated uniformly as SPxIds: ... Definition: spxid.h:85 DataArray< IdxElement > prices temporary array of precomputed pricing values Definition: spxdevexpr.h:51 int selectLeaveSparse(Real feastol) implementation of sparse pricing in the leaving Simplex Definition: spxdevexpr.cpp:203 virtual void setRep(SPxSolver::Representation) set row/column representation Definition: spxdevexpr.cpp:92 #define MSG_ERROR(x) Prints out message x if the verbosity level is at least SPxOut::ERROR. Definition: spxdefines.h:109 SPxId selectEnterHyperCoDim(Real &best, Real feastol) implementation of hyper sparse pricing in the entering Simplex Definition: spxdevexpr.cpp:588 bool sparsePricingEnter true if sparsePricing is turned on in the entering Simplex for slack variables Definition: spxsolver.h:375 Definition: spxpricer.h:67 Debugging, floating point type and parameter definitions. Sequential object-oriented SimPlex.SPxSolver is an LP solver class using the revised Simplex algorith... Definition: spxsolver.h:84 Everything should be within this namespace. int lastUpdate() const returns number of basis changes since last refactorization. Definition: spxbasis.h:533 int selectLeaveHyper(Real feastol) implementation of hyper sparse pricing in the leaving Simplex Definition: spxdevexpr.cpp:240 Definition: spxpricer.h:100 int SPxQuicksortPart(T *keys, COMPARATOR &compare, int start, int end, int size, int start2=0, int end2=0, bool type=true) Generic implementation of Partial QuickSort. Definition: sorter.h:219 SPxId selectEnterHyperDim(Real &best, Real feastol) implementation of hyper sparse pricing in the entering Simplex Definition: spxdevexpr.cpp:506 int selectLeaveX(Real feastol, int start=0, int incr=1) internal implementation of SPxPricer::selectLeave() Definition: spxdevexpr.cpp:177 DataArray< int > isInfeasibleCo 0: index not violated, 1: index violated, 2: index violated and among candidate list ... Definition: spxsolver.h:371 bool hyperPricingEnter true if hyper sparse pricing is turned on in the entering Simplex Definition: spxsolver.h:378 virtual void addedCoVecs(int n) n covectors have been added to loaded LP. Definition: spxdevexpr.cpp:861 Definition: spxpricer.h:101 #define MSG_INFO3(spxout, x) Prints out message x if the verbosity level is at least SPxOut::INFO3. Definition: spxdefines.h:117 void reMax(int newMax=1, int newSize=-1) reset maximum number of elements. Definition: dataarray.h:254 SPxId selectEnterSparseDim(Real &best, Real feastol) implementation of sparse pricing in the entering Simplex (slack variables) Definition: spxdevexpr.cpp:669 SPxId selectEnterDenseDim(Real &best, Real feastol, int start=0, int incr=1) SPxPricer::selectEnter() in dense case (slack variabels) Definition: spxdevexpr.cpp:748 bool hyperPricingLeave true if hyper sparse pricing is turned on in the leaving Simplex Definition: spxsolver.h:377 Set of indices.Class IdxSet provides a set of indices. At construction it must be given an array of i... Definition: idxset.h:56 SPxId selectEnterX(Real tol) choose the best entering index among columns and rows but prefer sparsity Definition: spxdevexpr.cpp:467 |