ILOG CPLEX 11.0 Parameters Reference Manual > Index

Index
A B C CPX_PARAM_A CPX_PARAM_B CPX_PARAM_C CPX_PARAM_D CPX_PARAM_E CPX_PARAM_F CPX_PARAM_G CPX_PARAM_H CPX_PARAM_L CPX_PARAM_M CPX_PARAM_N CPX_PARAM_O CPX_PARAM_P CPX_PARAM_R CPX_PARAM_S CPX_PARAM_T CPX_PARAM_V CPX_PARAM_W C(continued) D E F G H I L M N O P Q R S T U V W Z
A
absolute gap
solution pool
absolute objective difference
accessing parameters (how to)
Callable Library
CPXgetdblparam
CPXgetintparam
CPXgetstrparam
CPXinfodblparam
CPXinfointparam
CPXinfostrparam
CPXsetdblparam
CPXsetdefaults
CPXsetintparam
CPXsetstrparam
Concert Technology
getDefault
getMax
getMin
getParam
setDefaults
setParam
advanced start
barrier and
basis and
node exploration limit
presolve and
repair tries
root algorithm and
AdvInd
AggCutLim
AggFill
AggInd
aggregation limit
B
backtracking
criteria for
node selection and
tolerance
BarAlg
BarColNz
BarCrossAlg
BarDisplay
BarEpComp
BarGrowth
BarItLim
BarMaxCor
BarObjRng
BarOrder
BarQCPEpComp
barrier
advanced start and
detecting unbounded optimal faces
maximum absolute objective function
barrier limit
absolute value of objective function
centering corrections
detecting unbounded optimal faces
growth
iterations
BarStartAlg
basic variable
bound violation and
feasitility tolerance and
basis
advanced start and
crash ordering and
factoring
factoring and
Markowitz threshold and
network feasibility tolerance and
optimal and feasibility tolerance
pivot selection and
root algorithm and
simplex iterations and
simplex refactoring frequency and
singularity repairs and
BBInterval
best bound interval
best node
absolutee mip gap and
backtracking and
relative MIP gap and
target gap and
BndStrenInd
bound strengthening
bound violation
feasibility (simplex)
FeasOpt
network flow
branch direction
branching, local
BrDir
BtTol
C
callback reduced LP parameter
callback, control
candidate list limit (MIP)
centering correction
clique cut
Cliques
ClockType
CoeRedInd
ColReadLim
complementarity convergence
barrier (LP, QP)
barrier (QCP)
LP
QCP
QP
ConflictDisplay
control callback
cover cut
cover cut, flow
Covers
CPX_PARAM_A
CPX_PARAM_ADVIND
CPX_PARAM_AGGCUTLIM
CPX_PARAM_AGGFILL
CPX_PARAM_AGGIND
CPX_PARAM_B
CPX_PARAM_BARALG
CPX_PARAM_BARCOLNZ
CPX_PARAM_BARCROSSALG
CPX_PARAM_BARDISPLAY
CPX_PARAM_BAREPCOMP
CPX_PARAM_BARGROWTH
CPX_PARAM_BARITLIM
CPX_PARAM_BARMAXCOR
CPX_PARAM_BAROBJRNG
CPX_PARAM_BARORDER
CPX_PARAM_BARQCPEPCOMP
CPX_PARAM_BARSTARTALG
CPX_PARAM_BBINTERVAL
CPX_PARAM_BNDSTRENIND
CPX_PARAM_BRDIR
CPX_PARAM_BTTOL
CPX_PARAM_C
CPX_PARAM_CLIQUES
CPX_PARAM_CLOCKTYPE
CPX_PARAM_COEREDIND
CPX_PARAM_COLREADLIM
CPX_PARAM_CONFLICTDISPLAY
CPX_PARAM_COVERS
CPX_PARAM_CRAIND
CPX_PARAM_CUTLO
CPX_PARAM_CUTPASS
CPX_PARAM_CUTSFACTOR
CPX_PARAM_CUTUP
CPX_PARAM_D
CPX_PARAM_DATACHECK
CPX_PARAM_DEPIND
CPX_PARAM_DISJCUTS
CPX_PARAM_DIVETYPE
CPX_PARAM_DPRIIND
CPX_PARAM_E
CPX_PARAM_EACHCUTLIM
CPX_PARAM_EPAGAP
CPX_PARAM_EPGAP
CPX_PARAM_EPINT
CPX_PARAM_EPMRK
CPX_PARAM_EPOPT
CPX_PARAM_EPPER
CPX_PARAM_EPRELAX
CPX_PARAM_EPRHS
CPX_PARAM_F
CPX_PARAM_FEASOPTMODE
CPX_PARAM_FLOWCOVERS
CPX_PARAM_FLOWPATHS
CPX_PARAM_FRACCAND
CPX_PARAM_FRACCUTS
CPX_PARAM_FRACPASS
CPX_PARAM_G
CPX_PARAM_GUBCOVERS
CPX_PARAM_H
CPX_PARAM_HEURFREQ
CPX_PARAM_IMPLBD
CPX_PARAM_INTSOLLIM
CPX_PARAM_ITLIM
CPX_PARAM_L
CPX_PARAM_LBHEUR
CPX_PARAM_LPMETHOD
CPX_PARAM_M
CPX_PARAM_MEMORYEMPHASIS
CPX_PARAM_MIPCBREDLP
CPX_PARAM_MIPDISPLAY
CPX_PARAM_MIPEMPHASIS
CPX_PARAM_MIPINTERVAL
CPX_PARAM_MIPORDIND
CPX_PARAM_MIPORDTYPE
CPX_PARAM_MIPSEARCH
CPX_PARAM_MIQCPSTRAT
CPX_PARAM_MIRCUTS
CPX_PARAM_MPSLONGNUM
CPX_PARAM_N
CPX_PARAM_NETDISPLAY
CPX_PARAM_NETEPOPT
CPX_PARAM_NETEPRHS
CPX_PARAM_NETFIND
CPX_PARAM_NETITLIM
CPX_PARAM_NETPPRIIND
CPX_PARAM_NODEFILEIND
CPX_PARAM_NODELIM
CPX_PARAM_NODESEL
CPX_PARAM_NUMERICALEMPHASIS
CPX_PARAM_NZREADLIM
CPX_PARAM_O
CPX_PARAM_OBJDIF
CPX_PARAM_OBJLLIM
CPX_PARAM_OBJULIM
CPX_PARAM_P
CPX_PARAM_PARALLELMODE
CPX_PARAM_PERIND
CPX_PARAM_PERLIM
CPX_PARAM_POLISHTIME
CPX_PARAM_POPULATELIM
CPX_PARAM_PPRIIND
CPX_PARAM_PREDUAL
CPX_PARAM_PREIND
CPX_PARAM_PRELINEAR
CPX_PARAM_PREPASS
CPX_PARAM_PRESLVND
CPX_PARAM_PRICELIM
CPX_PARAM_PROBE
CPX_PARAM_PROBETIME
CPX_PARAM_QPMAKEPSDIND
CPX_PARAM_QPMETHOD
CPX_PARAM_QPNZREADLIM
CPX_PARAM_R
CPX_PARAM_REDUCE
CPX_PARAM_REINV
CPX_PARAM_RELAXPREIND
CPX_PARAM_RELOBJDIF
CPX_PARAM_REPAIRTRIES
CPX_PARAM_REPEATPRESOLVE
CPX_PARAM_RINSHEUR
CPX_PARAM_ROWREADLIM
CPX_PARAM_S
CPX_PARAM_SCAIND
CPX_PARAM_SCRIND
CPX_PARAM_SIFTALG
CPX_PARAM_SIFTDISPLAY
CPX_PARAM_SIFTITLIM
CPX_PARAM_SIMDISPLAY
CPX_PARAM_SINGLIM
CPX_PARAM_SOLNPOOLAGAP
CPX_PARAM_SOLNPOOLCAPACITY
CPX_PARAM_SOLNPOOLGAP
CPX_PARAM_SOLNPOOLINTENSITY
CPX_PARAM_SOLNPOOLREPLACE
CPX_PARAM_STARTALG
CPX_PARAM_STRONGCANDLIM
CPX_PARAM_STRONGITLIM
CPX_PARAM_SUBALG
CPX_PARAM_SUBMIPNODELIM
CPX_PARAM_SYMMETRY
CPX_PARAM_T
CPX_PARAM_THREADS
CPX_PARAM_TILIM
CPX_PARAM_TRELIM
CPX_PARAM_TUNINGDISPLAY
CPX_PARAM_TUNINGMEASURE
CPX_PARAM_TUNINGREPEAT
CPX_PARAM_TUNINGTILIM
CPX_PARAM_V
CPX_PARAM_VARSEL
CPX_PARAM_W
CPX_PARAM_WORKDIR
CPX_PARAM_WORKMEM
CPX_PARAM_ZEROHALFCUTS
CPXgetchgparams
CPXgetparamname
CPXgetparamnum
C(continued)
CraInd
cut
cliques (MIP)
constraint aggregation limit and
covers (MIP)
disjunctive (MIP)
flow cover
flow path (MIP)
fractional pass limit
Gomory fractional candidate limit
Gomory fractional generation
Gomory fractional pass limit
GUB (MIP)
implied bound
limit by type
limiting number of
MIP display and
mixed integer rounding (MIR)
node limit and
pass limit
reapplying presolve and
user-defined and preprocessing
zero-half
CutLo
cutoff tolerance
CutPass
CutsFactor
CutUp
D
DataCheck
DepInd
deterministic
definition
DisjCuts
disjunctive cut
DiveType
DPriInd
E
EachCutLim
EpAGap
EpGap
EpInt
EpLin
EpMrk
EpOpt
EpPer
EpRelax
EpRHS
F
FeasOpt
absolute gap
lower objective limit
mode
relaxation tolerance
stopping criteria
FeasOptMode
flow cover cut
aggregation limit
flow path cut
FlowCovers
FlowPaths
FPHeur
FracCand
FracCuts
FracPass
fractional cut
candidate limit
generation
pass limit
G
Gomory fractional cut
candidate limit
generation
pass limit
GUB cut
GUBCovers
H
HeurFreq
heuristic
frequency
local branching
periodic
relaxation induced neighborhood search (RINS)
I
ImplBd
implied bound cut
incumbent
backtracking and
cutoff tolerance and
diving and
local branching heuristic and
multiple at node
relaxation induced neighborhood search (RINS) and
solution pool absolute gap and
solution pool relative gap and
target gap and
integer solution
diving and
probing and
integer solution limit
IntSolLim
iteration
barrier centering corrections and
iteration limit
barrier
degenerate (simplex)
network
perturbation and (simplex)
refactoring of basis (simplex) and
sifting
simplex
strong branching and (MIP)
ItLim
L
LBHeur
local branching heuristic
M
Markowitz tolerance
maximum infeasibility rule
variable selection and
MemoryEmphasis
minimum infeasibility rule
variable selection and
MIP
bound strengthening
MIP callback reduced LP parameter
MIP limit
aggregation for cuts
cut by type
cuts
cutting plane passes
Gomory fractional cut candidates
nodes explored in subproblem
nodes solved
passes for Gomory fractional cuts
polishing time
probing time
repair tries
size of tree
solutions
termination criterion
MIP strategy
backtracking
best bound interval
branch direction
branching variable
diving
heuristic frequency
local branching
node algorithm
node file management
node selection
presolve at nodes
priority order
probing
quadratically constrained programs (MIQCP)
relaxation
RINS
root algorithm
starting algorithm
strong branching and candidate limit
strong branching and iteration limit
subalgorithm
variable selection
MIP tree
advanced start and
MIPDisplay
MIPEmphasis
MIPInterval
MIPOrdInd
MIPOrdType
MIPSearch
MIQCPStrat
MIR cut
aggregation limit
MIRCuts
mixed integer programming (MIP)
threads
mixed integer rounding cut
MPSLongNum
N
NetDisplay
NetEpOpt
NetEpRHS
NetFind
NetItLim
NetPPriInd
node
best bound
best estimate
presolve and
node file
compression of
tree size and
working memory and
node relaxation in MIQCP strategy
node selection
backtracking and
best bound interval and
NodeAlg
NodeFileInd
NodeLim
NodeSel
NumericalEmphasis
NzReadLim
O
ObjDif
objective
current and backtracking
objective difference
absolute
relative
ObjLLim
ObjULim
opportunistic
definition
P
parallelism
deterministic mode
opportunistic mode
optimization mode
threads and
ParallelMode
parameter
correspondence in APIs
methods to access
naming conventions
save settings in file
path cut
PerInd
periodic heuristic
PerLim
perturbation constant (simplex)
pivot selection
PolishTime
PopulateLim
PPriInd
PreDual
PreInd
PreLinear
PrePass
PreslvNd
presolve
advanced start and
nodes and
PriceLim
pricing
candidate list limit
network
types available for dual simplex
types available in primal simplex
priority order
indicator
type to generate
Probe
ProbeTime
probing
MIP branching and
time limit
pseudo cost
variable selection and
pseudo reduced cost
variable selection and
pseudo-shadow price
variable selection and
Q
QPmakePSDInd
QPNzReadLim
quadratically constrained mixed integer program (MIQCP)
R
Reduce
ReInv
relative gap
solution pool
relative objective difference
relaxation induced neighborhood search (RINS)
RelaxPreInd
RelObjDif
RepairTries
RepeatPresolve
RINSHeur
RootAlg 1, 2, 3
RowReadLim
S
ScaInd
screen indicator
screen indicator not available in this API
SiftAlg
SiftDisplay
sifting
iteration limit
node algorithm as
root algorithm as
SiftItLim
SimDisplay
simplex
iterations and candidate list
perturbation constant
simplex limit
degenerate iterations
iterations
lower objective function
repairs of singularities
upper objective function
SingLim
singularity
SolnPoolAGap
SolnPoolCapacity
SolnPoolGap
SolnPoolIntensity
SolnPoolReplace
solution pool
absolute gap
capacity
intensity
populate limit
replacement strategy
rrelative gap
start, advanced
strong branching
candidate list and
iteration limit and
variable selection and
StrongCandLim
StrongItLim
SubMIPNodeLim
Symmetry
T
target gap
termination criterion
barrier complementarity convergence (LP, QP)
barrier complementarity convergence (QCP)
barrier iterations
FeasOpt Phase I
MIP node limit
network iteration limit
simplex iteration limit
tree size (MIP)
tree size and memory
thread
global limit
parallelism and
Threads
TiLim
tolerance
absolute MIP gap
absolute MIP objective difference
backtracking (MIP)
barrier complementarity convergence (LP, QP)
basic variables and bound violation
complementarity convergence QCP
cutoff
cutoff and backtracking
feasibility (network primal)
feasibility (simplex)
FeasOpt relaxation
linearization
lower cutoff
Markowitz
MIP integrality
optimality (network)
optimality (simplex)
relative MIP gap
relative MIP objective difference
solution pool, absolute
solution pool, relative
upper cutoff
tree
memory limit (MIP)
MIP advanced start
TreLim
tuning
measure
repetition of
reporting level
time limit
TuningDisplay
TuningMeasure
TuningRepeat
TuningTiLim
U
unbounded optimal face
V
variable selection
candidate list and
MIP strategy
simplex iterations and
strong branching
variable, basic
bound violation and
feasibility tolerance and
VarSel
W
WorkDir
working directory
node files and
temporary files and
working memory
limit on
node files and
WorkMem
Z
zero-half cuts
ZeroHalfCuts
Copyright © 1987-2007 ILOG S.A. All rights reserved. Legal terms.