A B C I M N P Q S 
A
accessing parameters
Callable Library
CPXgetdblparam
CPXgetintparam
CPXgetstrparam
CPXinfodblparam
CPXinfointparam
CPXinfostrparam
CPXsetdblparam
CPXsetdefaults
CPXsetintparam
CPXsetstrparam
Concert Technology
getDefault
getMax
getMin
getParam
setDefaults
setParam
B
barrier
algorithm
as algorithm for continuous quadratic optimization
as algorithm for linear optimization
as MIP starting LP algorithm
as MIP subproblem LP algorithm
as sifting subproblem algorithm
column nonzeros
convergence tolerance for LP and QP problems
convergence tolerance for QCP problems
crossover algorithm
directory for working files (out of core)
display information
global time limit
growth limit
iteration limit
maximum correction limit
objective range
ordering algorithm
out-of-core indicator
starting point algorithm
thread limit
C
Callable Library
CPX_PARAM_ADVIND
CPX_PARAM_AGGCUTLIM
CPX_PARAM_AGGFILL
CPX_PARAM_AGGIND
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_BAROOC
CPX_PARAM_BARORDER
CPX_PARAM_BARQCPEPCOMP
CPX_PARAM_BARSTARTALG
CPX_PARAM_BARTHREADS
CPX_PARAM_BASINTERVAL
CPX_PARAM_BBINTERVAL
CPX_PARAM_BNDSTRENIND
CPX_PARAM_BRDIR
CPX_PARAM_BTTOL
CPX_PARAM_CLIQUES
CPX_PARAM_CLOCKTYPE
CPX_PARAM_COEREDIND
CPX_PARAM_COLGROWTH
CPX_PARAM_COLREADLIM
CPX_PARAM_COVERS
CPX_PARAM_CRAIND
CPX_PARAM_CUTLO
CPX_PARAM_CUTPASS
CPX_PARAM_CUTSFACTOR
CPX_PARAM_CUTUP
CPX_PARAM_DATACHECK
CPX_PARAM_DEPIND
CPX_PARAM_DISJCUTS
CPX_PARAM_DIVETYPE
CPX_PARAM_DPRIIND
CPX_PARAM_EPAGAP
CPX_PARAM_EPGAP
CPX_PARAM_EPINT
CPX_PARAM_EPMRK
CPX_PARAM_EPOPT
CPX_PARAM_EPPER
CPX_PARAM_EPRHS
CPX_PARAM_FINALFACTOR
CPX_PARAM_FLOWCOVERS
CPX_PARAM_FLOWPATHS
CPX_PARAM_FRACCAND
CPX_PARAM_FRACCUTS
CPX_PARAM_FRACPASS
CPX_PARAM_GUBCOVERS
CPX_PARAM_HEURFREQ
CPX_PARAM_IISIND
CPX_PARAM_IMPLBD
CPX_PARAM_INTSOLLIM
CPX_PARAM_ITLIM
CPX_PARAM_LPMETHOD
CPX_PARAM_MIPDISPLAY
CPX_PARAM_MIPEMPHASIS
CPX_PARAM_MIPINTERVAL
CPX_PARAM_MIPORDIND
CPX_PARAM_MIPORDTYPE
CPX_PARAM_MIPSTART
CPX_PARAM_MIPTHREADS
CPX_PARAM_MIRCUTS
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_NZGROWTH
CPX_PARAM_NZREADLIM
CPX_PARAM_OBJDIF
CPX_PARAM_OBJLLIM
CPX_PARAM_OBJULIM
CPX_PARAM_PERIND
CPX_PARAM_PERLIM
CPX_PARAM_PPRIIND
CPX_PARAM_PRECOMPRESS
CPX_PARAM_PREDUAL
CPX_PARAM_PREIND
CPX_PARAM_PRELINEAR
CPX_PARAM_PREPASS
CPX_PARAM_PRESLVND
CPX_PARAM_PRICELIM
CPX_PARAM_PROBE
CPX_PARAM_QPMAKEPSDIND
CPX_PARAM_QPMETHOD
CPX_PARAM_QPNZGROWTH
CPX_PARAM_QPNZREADLIM
CPX_PARAM_REDUCE
CPX_PARAM_REINV
CPX_PARAM_RELAXPREIND
CPX_PARAM_RELOBJDIF
CPX_PARAM_REVERSEIND
CPX_PARAM_RINSHEUR
CPX_PARAM_ROWGROWTH
CPX_PARAM_ROWREADLIM
CPX_PARAM_SCAIND
CPX_PARAM_SCRIND
CPX_PARAM_SIFTALG
CPX_PARAM_SIFTDISPLAY
CPX_PARAM_SIFTITLIM
CPX_PARAM_SIMDISPLAY
CPX_PARAM_SINGLIM
CPX_PARAM_STARTALG
CPX_PARAM_STRONGCANDLIM
CPX_PARAM_STRONGITLIM
CPX_PARAM_STRONGTHREADLIM
CPX_PARAM_SUBALG
CPX_PARAM_SUBMIPNODELIM
CPX_PARAM_SYMMETRY
CPX_PARAM_THREADS
CPX_PARAM_TILIM
CPX_PARAM_TRELIM
CPX_PARAM_VARSEL
CPX_PARAM_WORKDIR
CPX_PARAM_WORKMEM
CPX_PARAM_XXXIND
Concert Technology
AdvInd
AggCutLim
AggFill
AggInd
BarAlg
BarColNz
BarCrossAlg
BarDisplay
BarEpComp
BarGrowth
BarItLim
BarMaxCor
BarObjRng
BarOOC
BarOrder
BarQCPEpComp
BarStartAlg
BarThreads
BasInterval
BBInterval
BndStrenInd
BrDir
BtTol
Cliques
ClockType
CoeRedInd
ColGrowth
ColReadLim
Covers
CraInd
CutLo
CutPass
CutsFactor
CutUp
DataCheck
DepInd
DisjCuts
DiveType
DPriInd
EpAGap
EpGap
EpInt
EpMrk
EpOpt
EpPer
EpRHS
FinalFactor
FlowCovers
FlowPaths
FracCand
FracCuts
FracPass
GUBCovers
HeurFreq
IISInd
ImplBd
IntSolLim
ItLim
MIPDisplay
MIPEmphasis
MIPInterval
MIPOrdInd
MIPOrdType
MIPStart
MIPThreads
MIRCuts
NetDisplay
NetEpOpt
NetEpRHS
NetFind
NetItLim
NetPPriInd
NodeAlg
NodeFileInd
NodeLim
NodeSel
NzGrowth
NzReadLim
ObjDif
ObjLLim
ObjULim
PerInd
PerLim
PPriInd
PreCompress
PreDual
PreInd
PrePass
PreslvNd
PriceLim
Probe
QPmakePSDInd
QPNzGrowth
QPNzReadLim
Reduce
ReInv
RelaxPreInd
RelObjDif
ReverseInd
RINSHeur
RootAlg 1, 2, 3
RowGrowth
RowReadLim
ScaInd
SiftAlg
SiftDisplay
SiftItLim
SimDisplay
SingLim
StrongCandLim
StrongItLim
StrongThreadLim
SubMIPNodeLim
Symmetry
Threads
TiLim
TreLim
VarSel
WorkDir
WorkMem
XXXInd
concurrent
as algorithm for linear optimization
as MIP starting LP algorithm
I
Interactive Optimizer
advance
barrier algorithm
barrier colnonzeros
barrier convergetol
barrier crossover
barrier display
barrier limits corrections
barrier limits growth
barrier limits iterations
barrier limits objrange
barrier limits threads
barrier ordering
barrier outofcore
barrier startalg
clocktype
lpmethod
mip cuts cliques
mip cuts covers
mip cuts disjunctive
mip cuts flowcuts
mip cuts gomory
mip cuts gubcovers
mip cuts implied
mip cuts mircut
mip cuts pathcut
mip display
mip emphasis
mip interval
mip lim submipnodes
mip limits aggforcut
mip limits cutpasses
mip limits cutsfactor
mip limits gomorycand
mip limits gomorypass
mip limits nodes
mip limits solutions
mip limits strongcand
mip limits strongit
mip limits strongthreads
mip limits threads
mip limits treememory
mip ordertype
mip strategy backtrack
mip strategy bbinterval
mip strategy branch
mip strategy dive
mip strategy file
mip strategy heuristicfreq
mip strategy mipstart
mip strategy nodeselect
mip strategy order
mip strategy presolvenode
mip strategy probe
mip strategy rinsheur
mip strategy startalgorithm
mip strategy subalgorithm
mip strategy variableselect
mip tolerances absmipgap
mip tolerances integrality
mip tolerances lowercutoff
mip tolerances mipgap
mip tolerances objdifference
mip tolerances relobjdifference
mip tolerances uppercutoff
network display
network iterations
network netfind
network pricing
network tolerances feasibility
network tolerances optimality
preprocessing aggregator
preprocessing boundstrength
preprocessing coeffreduce
preprocessing compress
preprocessing dependency
preprocessing dual
preprocessing fill
preprocessing linear
preprocessing numpass
preprocessing presolve
preprocessing qpmakepsd
preprocessing reduce
preprocessing relax
preprocessing symmetry
qpmethod
read constraints
read datacheck
read nonzeros
read qpnonzeros 1, 2
read reverse
read scale
read variables
set bar qcpconvergetol
sifting algorithm
sifting display
sifting iterations
simplex basisinterval
simplex crash
simplex dgradient
simplex display
simplex finalfactor
simplex iisfind
simplex limits iterations
simplex limits lowerobj
simplex limits perturbation
simplex limits singularity
simplex limits upperobj
simplex perturbation 1, 2
simplex pgradient
simplex pricing
simplex refactor
simplex tolerances feasibility
simplex tolerances markowitz
simplex tolerances optimality
simplex xxxstart
threads
workdir
workmem
M
MIP
absolute mipgap tolerance
absolute objective difference cutoff
advanced starting indicator
backtracking tolerance
barrier in infeasibility start
branching direction
candidate limit for generating Gomory fractional cuts
candidate list
cliques indicator
constraint aggregation limit for cut generation
covers indicator
cutting plane passes
directory for working files
disjunctive cuts indicator
dive strategy
emphasis indicator
flow cover cuts indicator
flow path cut indicator
Gomory fractional cuts indicator
GUB cuts indicator
heuristic frequency
implied bound cuts indicator
integrality tolerance
mixed integer rounding (MIR) cut indicator
node log display information
node log interval
node selection strategy
number of cutting plane passes
parallel threads
pass limit for generating Gomory fractional cuts
preprocessing aggregator application limit
priority order generation
priority order indicator
relative mipgap tolerance
relaxation induced neighborhood search (RINS) heuristic
row multiplier factor for cuts
simplex iterations
solution limit.
starting LP algorithm
starting values
strategy best bound interval
subnode limit
subproblem LP algorithm
subproblems and barrier
symmetry breaking cuts
thread limit
tolerances lower cutoff
tolerances upper cutoff
MIQP
algorithm for root relaxation
indefiniteness indicator
N
network
as algorithm for continuous quadratic optimization
as algorithm for linear optimization
as MIP starting LP algorithm
as MIP subproblem LP algorithm
as sifting subproblem algorithm
extraction level
feasibility tolerance
global time limit
logging display indicator
optimality tolerance
simplex iteration limit
simplex pricing algorithm
P
parameter
correspondence in APIs
methods to access
naming conventions
save settings in file
Q
QCP
convergence tolerance
QP
algorithm for continuous quadratic optimization
convergence tolerance
indefinite MIQP indicator
positive semi-definiteness and
Q matrix memory growth
Q matrix nonzero read limit
simplex crash ordering for
S
sifting
as algorithm for linear optimization
as MIP starting LP algorithm
as MIP subproblem LP algorithm
display information
subproblem algorithm
upper limit on iterations
simplex
as algorithm for linear optimization
as MIP starting LP algorithm
as MIP subproblem LP algorithm
as QP algorithm at root
as sifting subproblem algorithm
basis file saving frequency
crash ordering
dual pricing algorithm
feasibility tolerance
final factor
global time limit
irreducibly inconsistent set (IIS) algorithm indicator
iteration display information
iterations in MIP
lower objective value limit
Markowitz tolerance
maximum iteration limit
network extraction level
network iteration limit
network pricing algorithm
optimality tolerance
perturbation constant
perturbation indicator
perturbation limit
pgradient indicator
pricing candidate list size
primal pricing algorithm
refactoring frequency
singularity repair limit
upper objective value limit
Copyright © 1987-2003 ILOG, S.A. All rights reserved. Legal terms.