You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>CPLEX</strong> <strong>11</strong> 9epopteprhsnetepoptneteprhsoptimality tolerancefeasibility toleranceoptimality tolerance for the network simplex methodfeasibility tolerance for the network simplex method5.5 Barrier Specific Optionsbaralgbarcolnzbarcrossalgbarepcompbargrowthbaritlimbarmaxcorbarobjrngbarorderbarqcpepcompbarstartalgalgorithm selectiondense column handlingbarrier crossover methodconvergence toleranceunbounded face detectioniteration limitmaximum correction limitmaximum objective functionrow ordering algorithm selectionconvergence tolerance for the barrier optimizer for QCPsbarrier starting point algorithm5.6 Sifting Specific Optionssiftalgsiftitlimsifting subproblem algorithmlimit on sifting iterations5.7 MIP Algorithmic Optionsbbintervalbndstrenindbrdirbttolcliquescoverscutlocutscutsfactorcutupdisjcutsdivetypeeachcutlimflowcoversflowpathsfpheurfraccutsgubcoversheurfreqimplbdlbheurmipemphasisbest bound intervalbound strengtheningset branching directionbacktracking limitclique cut generationcover cut generationlower cutoff for tree searchdefault cut generationcut limitupper cutoff for tree searchdisjunctive cuts generationMIP dive strategySets a limit for each type of cutflow cover cut generationflow path cut generationfeasibility pump heuristicGomory fractional cut generationGUB cover cut generationheuristic frequencyimplied bound cut generationlocal branching heuristicMIP solution tactics
Change language