ODH to AIMMS Mapping

ODH engine parameters

The table below shows in the left column the ODH engine parameters from ODH-CPLEX that can be set in AIMMS; the right column displays for each ODH-CPLEX 5.3 parameter the associated AIMMS option.

Name in ODH-CPLEX	Option name in AIMMS
DECOMPDENSITY	Decomposition Density
DETERMINISTIC	Solution Improvement Heuristic Mode
DIVISOR	Initial Divisor Value Sub Models
FEASOPT	Optimization Method
FEASTOL	ODH Feasibility Tolerance
FIRSTFEAS	First Feasible Heuristic
FIRSTFEASCONTINUE	First Feasible Heuristic Continue
FIRSTFEASEFFORT	First Feasible Heuristic Effort Level
FIRSTFEASSHIFT	First Feasible Heuristic Shift
GLOBALBOUNDS	Global Bounds
INTERDIV	Initial Divisor Value
MAXBACKTRACK	Backtrack Limit
MAXINFREPEAT	Maximum Divisor Repeats Infeasible
MAXINTERDIV	Maximum Divisor Value
MAXREPEAT	Maximum Divisor Repeats
OBJTARGET	Objective Target
ODHPRESOLVE	ODH Presolve
PENALTY	Solution Improvement Heuristic Penalty
PHASE12	Remove Infeasibilities Method
PRESOLVE	Presolve
PROCESSORLOCK	Processor Lock
QUICKFIRSTSOLVE	Quick First Solve
RECURSE	Recurse
RECURSEDECOMP	Recurse Decomposition Method
RECURSEITERLIM	Recurse Iteration Limit
RECURSELOG	Recurse Log
RECURSEMINITERLIM	Recurse Minimum Iterations
RECURSESOLITERLIM	Recurse Iteration Limit Solution
REJECTINFSOL	Reject Infeasible Solutions
RELAXSOS2	Relax SOS2
SEED	ODH Seed
STRATEGY	Solution Improvement Heuristic Strategy
SYNCFREQ	Thread Synchronization Frequency
THREADLOG	Thread Log
THREADS	Thread Limit
TIMELIMIT	Time Limit
VARIABLECLEAN	Clean Variables Sub Models
WRITESOLUTION	Write Solution File

Main CPLEX solve parameters

The table below shows CPLEX options for the main CPLEX solve in ODH-CPLEX (if the Search Mode is set to ‘Global Solution’) or for getting an initial feasible solution (if the Search Mode is set to ‘Local Solution’). The table below shows in the left column the CPLEX parameters from ODH-CPLEX that can be set in AIMMS; the right column displays for each ODH-CPLEX 5.3 parameter the associated AIMMS option.

Name in ODH-CPLEX	Option name in AIMMS
CPX_ADVIND	Advanced Start
CPX_AGGCUTLIM	Cut Generation Limit
CPX_AGGFILL	Limit Substitutions
CPX_AGGIND	Aggregator
CPX_AUXROOTTHREADS	Auxiliary Root Threads
CPX_BARALG	Barrier Algorithm
CPX_BARCOLNZ	Barrier Density Definition
CPX_BARCROSSALG	Barrier Crossover Algorithm
CPX_BARDISPLAY	Barrier Display
CPX_BAREPCOMP	Barrier Convergence Tolerance
CPX_BARGROWTH	Barrier Growth Limit
CPX_BARITLIM	Barrier Iterations
CPX_BARMAXCOR	Barrier Maximal Number of Corrections
CPX_BAROBJRNG	Barrier Objective Range
CPX_BARORDER	Barrier Ordering
CPX_BARQCPEPCOMP	Barrier Convergence Tolerance for QCP
CPX_BARSTARTALG	Barrier Start Algorithm
CPX_BNDSTRENIND	Boundstrength
CPX_BQPCUTS	BQP Cuts
CPX_BRDIR	Branch
CPX_BTTOL	Backtrack
CPX_CLIQUES	Clique Cuts
CPX_CLOCKTYPE	Clock Type
CPX_CLONELOG	Clone Log Files
CPX_COEREDIND	Coefficient Reduction
CPX_CONFLICTALG	Conflict Algorithm
CPX_COVERS	Cover Cuts
CPX_CRAIND	Crash Ordering
CPX_CUTLO	Cutoff
CPX_CUTPASS	MIP Number of Cut Passes
CPX_CUTSFACTOR	Cuts Factor
CPX_CUTUP	Cutoff
CPX_DATACHECK	Data Check and Modeling Assistance
CPX_DEPIND	Dependency
CPX_DETTILIM	Deterministic Time Limit
CPX_DISJCUTS	Disjunctive Cuts
CPX_DIVETYPE	MIP Dive Strategy
CPX_DPRIIND	Dual Pricing Algorithm
CPX_DYNAMICROWS	Dynamic Row Management
CPX_EACHCUTLIM	Cut Limit
CPX_EPAGAP	MIP Absolute Optimality Tolerance
CPX_EPGAP	MIP Relative Optimality Tolerance
CPX_EPINT	Integrality
CPX_EPMRK	Markowitz
CPX_EPOPT	Optimality
CPX_EPPER	Perturbation Constant
CPX_EPRHS	Feasibility
CPX_FLOWCOVERS	Flow Cover Cuts
CPX_FLOWPATHS	Flow Path Cuts
CPX_FOLDING	Folding
CPX_FPHEUR	Feasibility Pump Heuristic
CPX_FRACCAND	Gomory Cuts Candidate Limit
CPX_FRACCUTS	Gomory Cuts
CPX_FRACPASS	Gomory Cuts Pass Limit
CPX_GUBCOVERS	GUB Cover Cuts
CPX_HEUREFFORT	Heuristic Effort
CPX_HEURFREQ	Heuristic Frequency
CPX_IMPLBD	Implied Bound Cuts
CPX_INTSOLLIM	Maximal Number of Integer Solutions
CPX_ITLIM	Iteration Limit
CPX_LANDPCUTS	Lift and Project Cuts
CPX_LBHEUR	Local Branching Heuristic
CPX_LOCALIMPLBD	Local Implied Bound Cuts
CPX_MCFCUTS	MCF Cuts
CPX_MEMORYEMPHASIS	Memory Emphasis
CPX_MIPDISPLAY	MIP Display
CPX_MIPEMPHASIS	MIP Emphasis
CPX_MIPINTERVAL	MIP Interval
CPX_MIPORDIND	MIP Priority Order Switch
CPX_MIPORDTYPE	MIP Priority Order Type
CPX_MIPSEARCH	MIP Search Strategy
CPX_MIQCPSTRAT	MIQCP Strategy
CPX_MIRCUTS	Mixed Integer Rounding Cuts
CPX_NETEPOPT	Network Optimality
CPX_NETEPRHS	Network Feasibility
CPX_NETITLIM	Network Iterations
CPX_NETPPRIIND	Network Pricing
CPX_NODECUTS	Node Cuts
CPX_NODEFILEIND	Node File
CPX_NODELIM	Maximal Number of Nodes
CPX_NODESEL	Selection of Nodes
CPX_NUMERICALEMPHASIS	Numerical Emphasis
CPX_OBJDIF	Difference Objective
CPX_OPTIMALITYTARGET	Solution Target
CPX_PARALLELMODE	Parallel Mode
CPX_PERIND	Perturbation Indicator
CPX_PERLIM	Stalled Iterations
CPX_POLISHAFTERDETTIME	Polishing Time Deterministic
CPX_POLISHAFTEREPAGAP	Polishing Absolute MIP Gap
CPX_POLISHAFTEREPGAP	Polishing Relative MIP Gap
CPX_POLISHAFTERINTSOL	Polishing Number of Solutions
CPX_POLISHAFTERNODE	Polishing Number of Nodes
CPX_POLISHAFTERTIME	Polishing Time
CPX_POPULATELIM	Population Limit
CPX_PREDUAL	Presolve Pass Dual
CPX_PREPASS	Number of Iterations in Presolve
CPX_PRESLVND	MIP Node Presolve
CPX_PRICELIM	Pricing
CPX_PROBE	MIP Probing
CPX_PROBEDETTIME	Probing Time Deterministic
CPX_PROBETIME	Probing Time
CPX_PPRIIND	Primal Pricing Algorithm
CPX_QPMAKEPSDIND	Adjust MIQP
CPX_QPMETHOD	QP Method
CPX_QPNZREADLIM	QP Nonzeros Read Limit
CPX_QTOLININD	QP Linearization
CPX_RANDOMSEED	Random Seed
CPX_REDUCE	Preprocessing Reduction Types
CPX_REINV	Refactor
CPX_RELAXPREIND	Presolve Relaxed MIP
CPX_RELOBJDIF	Relative Difference Objective
CPX_REPAIRTRIES	Number of Repair Attempts
CPX_REPEATPRESOLVE	Repeat Presolve
CPX_RINSHEUR	RINS Heuristic Frequency
CPX_RLTCUTS	RLT Cuts
CPX_SCAIND	Scale
CPX_SIFTALG	Sifting Algorithm
CPX_SIFTSIM	Sifting from Simplex
CPX_SIMDISPLAY	Simplex Display
CPX_SINGLIM	Singular
CPX_SOLNPOOLAGAP	Pool Absolute Objective Gap
CPX_SOLNPOOLCAPACITY	Pool Capacity
CPX_SOLNPOOLGAP	Pool Relative Objective Gap
CPX_SOLNPOOLINTENSITY	Pool Intensity
CPX_SOLNPOOLREPLACE	Pool Replacement Strategy
CPX_SOS1REFORM	SOS1 Reformulations
CPX_SOS2REFORM	SOS2 Reformulations
CPX_STARTALG	MIP Start Algorithm
CPX_STRONGCANDLIM	MIP Candidate List
CPX_STRONGITLIM	Number of Simplex Iterations
CPX_SUBALG	MIP Method
CPX_SUBMIPNODELIMIT	SubMIP Node Limit
CPX_SUBMIPSCAIND	SubMIP Scale
CPX_SUBMIPSTARTALG	SubMIP Start Algorithm
CPX_SUBMIPSUBALG	SubMIP Subproblem Algorithm
CPX_SYMMETRY	Preprocessing Symmetry
CPX_THREADS	Global Thread Limit
CPX_TRELIM	MIP Tree Memory Limit
CPX_VARSEL	Select Variables
CPX_WORKMEM	Working Memory Limit
CPX_ZEROHALFCUTS	Zero Half Cuts

Heuristic sub-model parameters

The heuristic sub-model parameters can only be set using a Parameter File. The syntax for the parameters that influence the heuristic sub-model CPLEX solves is the following: SUB_<parameter> where <parameter> refers to the ODH-CPLEX name in the second table above. The syntax for the parameters that influence the heuristic sub-model CPLEX solves in Phase I is the following: PHASE1_<parameter>.

For example, SUB_CPX_RINSHEUR specifies the RINS heuristic frequency for CPLEX if it used to solve a heuristic sub-model, while PHASE1_CPX_RINSHEUR specifies the RINS heuristic frequency for CPLEX if it used to solve a heuristic sub-model in Phase I.

Learn more about

• Parameter File

• Search Mode