List of CPLEX parameters
CPLEX parameters, documented here alphabetically by name in the Callable Library (C API),
are available in the C++, Java, .NET, and Python APIs, as well as in the Interactive
Optimizer.
test advanced start switch constraint aggregation limit for cut generation preprocessing aggregator fill preprocessing aggregator application limit API string encoding switch barrier algorithm barrier column nonzeros barrier crossover algorithm barrier display information convergence tolerance for LP and QP problems barrier growth limit barrier iteration limit barrier maximum correction limit barrier objective range barrier ordering algorithm convergence tolerance for QC problems barrier starting point algorithm Benders strategy Benders worker algorithm Benders feasibility cut tolerance Benders optimality cut tolerance MIP strategy best bound interval bound strengthening switch Boolean Quadric Polytope cuts MIP branching direction backtracking tolerance calculate QCP dual values MIP cliques switch clock type for computation time clone log in parallel optimization coefficient reduction setting variable (column) read limit conflict information display conflict refiner algorithm MIP covers switch CPU mask to bind threads to cores simplex crash ordering lower cutoff number of cutting plane passes cut factor row-multiplier limit upper cutoff data consistency checking and modeling assistance dependency switch deterministic time limit MIP disjunctive cuts switch MIP dive strategy dual simplex pricing algorithm dynamic row-management type of cut limit absolute MIP gap tolerance relative MIP gap tolerance integrality tolerance epsilon (degree of tolerance) used in linearization Markowitz tolerance optimality tolerance perturbation constant relaxation for FeasOpt CPXfeasopt in the C API or for the method feasOpt in the object-oriented APIs.feasibility tolerance mode of FeasOpt file encoding switch MIP flow cover cuts switch MIP flow path cut switch feasibility pump switch candidate limit for generating Gomory fractional cuts MIP Gomory fractional cuts switch pass limit for generating Gomory fractional cuts MIP GUB cuts switch MIP heuristic effort MIP heuristic frequency MIP globally valid implied bound cuts switch MIP locally valid implied bound cuts switch MIP integer solution-file switch and prefix MIP integer solution limit simplex maximum iteration limit local branching heuristic Lift-and-project cuts switch for MIP and MIQCP MCF cut switch memory reduction switch MIP callback switch between original model and reduced, presolved model MIP node log display information MIP emphasis switch MIP node log interval MIP kappa computation MIP priority order switch MIP priority order generation MIP dynamic search switch MIQCP strategy switch MIP MIR (mixed integer rounding) cut switch precision of numerical output in MPS and REW file formats level of display during multiobjective optimization network logging display switch network optimality tolerance network primal feasibility tolerance simplex network extraction level network simplex iteration limit network simplex pricing algorithm MIP subproblem algorithm node cuts switch node storage file switch CPX_PARAM_WORKMEM, WorkMem) has been exceeded by the size of the search tree.MIP node limit MIP node selection strategy numerical precision emphasis nonzero element read limit absolute objective difference cutoff lower objective value limit upper objective value limit optimality target parallel mode switch simplex perturbation switch simplex perturbation limit deterministic time before starting to polish a feasible solution absolute MIP gap before starting to polish a feasible solution relative MIP gap before starting to polish a feasible solution MIP integer solutions to find before starting to polish a feasible solution nodes to process before starting to polish a feasible solution time before starting to polish a feasible solution time spent polishing a solution (deprecated) maximum number of solutions generated for solution pool by populate changed parameter display switch primal simplex pricing algorithm presolve dual setting presolve switch linear reduction switch (deprecated) limit on the number of presolve passes made node presolve switch simplex pricing candidate list size MIP probing level deterministic time spent probing time spent probing indefinite MIQP switch QP Q-matrix nonzero read limit linearization switch for QP, MIQP deterministic time spent in ramp up during distributed parallel optimization time spent in ramp up during distributed parallel optimization ramp up duration random seed recording switch primal and dual reduction type reformulations simplex refactoring frequency relaxed LP presolve switch relative objective difference cutoff number of attempts to repair infeasible MIP start MIP repeat presolve switch RINS heuristic frequency Reformulation Linearization Technique (RLT) cuts algorithm for continuous linear problems algorithm for continuous quadratic optimization CPXqpopt (or the command optimize in the Interactive Optimizer) is invoked.algorithm for initial MIP relaxation auxiliary root threads constraint (row) read limit scale parameter messages to screen switch sifting subproblem algorithm sifting from simplex switch sifting information display upper limit on sifting iterations simplex iteration information display simplex singularity repair limit absolute gap for solution pool maximum number of solutions kept in solution pool relative gap for solution pool solution pool intensity solution pool replacement strategy solution type for LP and QP SOS1 reformulations SOS2 reformulations MIP strong branching candidate list limit MIP strong branching iterations limit limit on nodes explored when CPLEX solves a subMIP scale parameter for subMIPs algorithm for initial MIP relaxation of a subMIP of a MIP algorithm for subproblems of a subMIP of a MIP symmetry breaking for MIP models folding for LP models global thread count optimizer time limit in seconds tree memory limit deterministic tuning time limit tuning information display tuning measure tuning repeater tuning time limit in seconds MIP variable selection strategy warning limit directory for working files memory available for working storage write level for MST, SOL files MIP zero-half cuts switch