| adjustTableauRow(int var, TabRow &row, int direction) | LAP::CglLandPSimplex | [protected] |
| basics_ | LAP::CglLandPSimplex | [private] |
| basis_ | LAP::CglLandPSimplex | [private] |
| cacheUpdate(const CglLandP::CachedData &cached, bool reducedSpace=0) | LAP::CglLandPSimplex | |
| CglLandPSimplex(const OsiSolverInterface &si, const CglLandP::CachedData &cached, bool reducedSpace, int numPivots) | LAP::CglLandPSimplex | |
| CglLandPSimplex() | LAP::CglLandPSimplex | [inline] |
| changeBasis(int incoming, int leaving, int direction) | LAP::CglLandPSimplex | [protected] |
| chosenReducedCostVal_ | LAP::CglLandPSimplex | [private] |
| clp enum value | LAP::CglLandPSimplex | [private] |
| colCandidateToLeave_ | LAP::CglLandPSimplex | [private] |
| colHasToComputeContrib_ | LAP::CglLandPSimplex | [private] |
| colsol_ | LAP::CglLandPSimplex | [private] |
| colsolToCut_ | LAP::CglLandPSimplex | [private] |
| computeCglpObjective(double gamma, bool strengthen) | LAP::CglLandPSimplex | [protected] |
| computeCglpObjective(TabRow &row) const | LAP::CglLandPSimplex | [protected] |
| computeCglpRedCost(int direction, int gammaSign) | LAP::CglLandPSimplex | [protected] |
| computeRedCostConstantsInRow() | LAP::CglLandPSimplex | [protected] |
| cplex enum value | LAP::CglLandPSimplex | [private] |
| createIntersectionCut(const TabRow &row, OsiRowCut &cut) const | LAP::CglLandPSimplex | [protected] |
| createMIG(TabRow &row, OsiRowCut &cut) const | LAP::CglLandPSimplex | [protected] |
| extra | LAP::CglLandPSimplex | [mutable] |
| fastFindBestPivotColumn(int direction, int gammaSign, double pivotTol, double rhsTol, bool reducedSpace, bool allowNonImproving, double &bestSigma) | LAP::CglLandPSimplex | [protected] |
| fastFindCutImprovingPivotRow(int &direction, int &gammaSign, double tolerance) | LAP::CglLandPSimplex | [protected] |
| findBestCut(int var, OsiRowCut &cut, const CglLandP::CachedData &cached, const CglLandP::Parameters ¶ms) | LAP::CglLandPSimplex | |
| findBestPivot(int &leaving, int &direction, const CglLandP::Parameters ¶ms) | LAP::CglLandPSimplex | [protected] |
| findBestPivotColumn(int direction, double pivotTol, bool reducedSpace, bool allowDegeneratePivot, bool modularize) | LAP::CglLandPSimplex | [protected] |
| findCutImprovingPivotRow(int &direction, int &gammaSign, double tolerance) | LAP::CglLandPSimplex | [protected] |
| freeSi() | LAP::CglLandPSimplex | [inline] |
| gammas_ | LAP::CglLandPSimplex | [private] |
| generateMig(int row, OsiRowCut &cut, const CglLandP::CachedData &cached, const CglLandP::Parameters ¶ms) const | LAP::CglLandPSimplex | |
| getLoBound(int index) | LAP::CglLandPSimplex | [inline, protected] |
| getUpBound(int index) | LAP::CglLandPSimplex | [inline, protected] |
| handler_ | LAP::CglLandPSimplex | [private] |
| inDegenerateSequence_ | LAP::CglLandPSimplex | [private] |
| inM1_ | LAP::CglLandPSimplex | [private] |
| inM2_ | LAP::CglLandPSimplex | [private] |
| inM3_ | LAP::CglLandPSimplex | [private] |
| integers_ | LAP::CglLandPSimplex | [private] |
| intersectionCutCoef(double alpha_i, double beta) const | LAP::CglLandPSimplex | [inline, protected] |
| loBounds_ | LAP::CglLandPSimplex | [private] |
| lpSolver enum name | LAP::CglLandPSimplex | [private] |
| messages_ | LAP::CglLandPSimplex | [private] |
| modularizedCoef(double alpha, double beta) const | LAP::CglLandPSimplex | [inline, protected] |
| modularizeRow(TabRow &row) | LAP::CglLandPSimplex | [protected] |
| newRow_ | LAP::CglLandPSimplex | [private] |
| newRowCoefficient(int j, double gamma) const | LAP::CglLandPSimplex | [inline, protected] |
| nNegativeRc_ | LAP::CglLandPSimplex | [private] |
| nNegativeRcRows_ | LAP::CglLandPSimplex | [private] |
| nonBasics_ | LAP::CglLandPSimplex | [private] |
| normCoef(TabRow &row) | LAP::CglLandPSimplex | [protected] |
| numcols_ | LAP::CglLandPSimplex | [private] |
| numrows_ | LAP::CglLandPSimplex | [private] |
| own_ | LAP::CglLandPSimplex | [private] |
| perturbed_row_k_ | LAP::CglLandPSimplex | [private] |
| printTableau(std::ostream &os) | LAP::CglLandPSimplex | [protected] |
| pullTableauRow(TabRow &row) const | LAP::CglLandPSimplex | [protected] |
| rescanReducedCosts(int &direction, int &gammaSign, double tolerance) | LAP::CglLandPSimplex | [protected] |
| resetOriginalTableauRow(int var, TabRow &row, int direction) | LAP::CglLandPSimplex | [protected] |
| resetSolver(const CoinWarmStartBasis *basis) | LAP::CglLandPSimplex | |
| rIntWork_ | LAP::CglLandPSimplex | [private] |
| row_i_ | LAP::CglLandPSimplex | [private] |
| row_k_ | LAP::CglLandPSimplex | [mutable, private] |
| rowFlags_ | LAP::CglLandPSimplex | [private] |
| rWk1_ | LAP::CglLandPSimplex | [private] |
| rWk2_ | LAP::CglLandPSimplex | [private] |
| rWk3_ | LAP::CglLandPSimplex | [private] |
| rWk4_ | LAP::CglLandPSimplex | [private] |
| scale(OsiRowCut &cut, double norma) | LAP::CglLandPSimplex | [protected] |
| scale(OsiRowCut &cut) | LAP::CglLandPSimplex | [protected] |
| setLogLevel(int level) | LAP::CglLandPSimplex | [inline] |
| setSi(OsiSolverInterface *si) | LAP::CglLandPSimplex | [inline] |
| si_ | LAP::CglLandPSimplex | [private] |
| sigma_ | LAP::CglLandPSimplex | [private] |
| solver_ | LAP::CglLandPSimplex | [private] |
| strengthenedIntersectionCutCoef(int i, double alpha_i, double beta) const | LAP::CglLandPSimplex | [inline, protected] |
| tau_ | LAP::CglLandPSimplex | [private] |
| upBounds_ | LAP::CglLandPSimplex | [private] |
| updateM1_M2_M3(TabRow &row, double tolerance, bool recucedSpace, bool alwaysComputeCheap) | LAP::CglLandPSimplex | [private] |
| xpress enum value | LAP::CglLandPSimplex | [private] |
| ~CglLandPSimplex() | LAP::CglLandPSimplex | |
