10.07.2015 Views

CPLEX 11

CPLEX 11

CPLEX 11

SHOW MORE
SHOW LESS

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> 21bndstrenind (integer)Use bound strengthening when solving mixed integer problems. Bound strengthening tightens the boundson variables, perhaps to the point where the variable can be fixed and thus removed from considerationduring the branch and bound algorithm. This reduction is usually beneficial, but occasionally, due to itsiterative nature, takes a long time.(default = -1)-1 Determine automaticallybrdir (integer)0 Don’t use bound strengthening1 Use bound strengtheningUsed to decide which branch (up or down) should be taken first at each node.(default = 0)bttol (real)-1 Down branch selected first0 Algorithm decides1 Up branch selected firstThis option controls how often backtracking is done during the branching process. At each node, Cplexcompares the objective function value or estimated integer objective value to these values at parent nodes;the value of the bttol parameter dictates how much relative degradation is tolerated before backtracking.Lower values tend to increase the amount of backtracking, making the search more of a pure best-boundsearch. Higher values tend to decrease the amount of backtracking, making the search more of a depth-firstsearch. This parameter is used only once a first integer solution is found or when a cutoff has been specified.Range: [0,1](default = 0.9999)cliques (integer)Determines whether or not clique cuts should be generated during optimization.(default = 0)-1 Do not generate clique cuts0 Determined automatically1 Generate clique cuts moderately2 Generate clique cuts aggressively3 Generate clique cuts very aggressivelycoeredind (integer)Coefficient reduction is a technique used when presolving mixed integer programs. The benefit is to improvethe objective value of the initial (and subsequent) linear programming relaxations by reducing the numberof non-integral vertices. However, the linear programs generated at each node may become more difficultto solve.(default = 2)0 Do not use coefficient reduction1 Reduce only to integral coefficients2 Reduce all potential coefficientscovers (integer)Determines whether or not cover cuts should be generated during optimization.(default = 0)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!