> Index

Index

A B C D E F G H I K L M N O P Q R S T U V W X 
A
absolute objective difference 1, 2
absolute optimality tolerance
gap
accessing
basis information
current parameter value 1, 2
default parameter value
dual values
maximum parameter value
minimum parameter value
objective function value (C++)
reduced costs
solution quality
solution values
active model
MIP
active node
add method
IloModel class 1, 2
addMinimize
advanced basis
example
in networks
parallel threads and
primal feasibility and
reading from file (LP)
saving to file (LP)
starting from (LP)
advanced starting basis
AggCutLim
aggregator
barrier preprocessing
simplex and
alg
algorithm
choosing in LP
controlling in IloCplex
pricing
type
using multiple
Algorithm.Barrier
application
creating with Concert Technology
development steps
arc
architecture
arguments
null pointers
optional
array
constructing
creating multi-dimensional
extensible
using for I/O
B
barrier
barrier optimizer
algorithm
algorithms and infeasibility
barrier display parameter
centering corrections
column nonzeros parameter 1, 2
corrections limit
growth parameter
infeasibility analysis
inhibiting dual formulation
linear 1, 2
log file
numerical difficulties and
out-of-core barrier
parallel
performance tuning
preprocessing
primal-dual
quadratic 1, 2
row-ordering algorithms
simplex optimizer and
solution quality
solving LP problems
starting-point heuristics
unbounded optimal face and
unbounded problems
uses
working storage allocation
BarThreads
BAS file format
basis
accessing information
advanced, primal feasible
advanced, role in network
advanced, starting from (example)
column generation and
condition number 1, 2
crash parameter and
crossover algorithms
current
differences between LP and network optimizers
from basis file
infeasibility and
maximum row residuals and
no factoring in network optimizer
objective in Phase I and
optimal, condition number and
optimal, numerical stability and
parallel threads and advanced basis
preprocessing versus starting (MIP)
previous optimal
refactoring rate
removing objects from
role in converting LP to network flow
role in converting network-flow to LP
role in network optimizer
role in network optimizer to solve QP
saving best so far
singularities and
starting from advanced
unexplored nodes in tree (MIP)
unstable optimal
see also advanced basis
Best Bound
Best Estimate
bibliography
column generation
models for LPs, MIPs
Boolean or semi-continuous variables
single LP
boolVar
boolVarArray
bound
violation
Bounded return status (Java)
branch & cut 1, 2
algorithm
controlling process with presolve
parallel processing
parameters
solves MIP models
tree
branch & cut algorithm
memory problems and
priority order
special ordered sets (SOS)
storing tree nodes
tree subproblems
branch & cut tree
solving linear problem at each node
branch variable selection callback
branching directions
breakpoint
discontinuous piecewise linear and
example
piecewise linear function and
BtTol
C
call by value
Callable Library
categories of routines
core
debugging and
description
parameters
using 1, 2
see also individual CPXxxx routines
callback
branch variable selection
control
cut
diagnostic
graphic user interface and
heuristic
incumbent
node selection
resetting to null 1, 2
solve
using status variables
cardinality as logical constraint
changing
coefficients in model
limit on barrier corrections
maximization to minimization
pricing algorithm
problem type
network to LP
qp
zeroed_qp
quadratic coefficients
type of variable
variable type
channel
example
character string
length requirements
check.c CPLEX file
Cholesky factor
barrier iteration
barrier log file and
choosing
algorithm in LP
clique cuts
defined
cloneK.log
clones
log files
threads and
closing
application 1, 2
environment 1, 2
log files
coefficient, changing
column
dense
density
growth parameter
index number
modeling by
name
nonzeros parameter 1, 2
referencing
column generation
basis and
cutting plane method and
reduced cost and 1, 2
columnwise modeling 1, 2, 3, 4
comma-separated values see CSV file format
complementarity 1, 2
convergence tolerance
Component Libraries
defined
concave
logical constraints and
piecewise linear
Concert Technology
accessing parameter values
application development steps
creating application
description
design
error handling
solving problem with
using 1, 2
writing programs with
see also individual Iloxxx methods
Concurrent Optimizer
concurrent optimizer
licensing issues
non-default parameters and
option for
parallel processing and
root relaxation and
constraint
adding with user-written callback
convex quadratic
cumulative 1, 2
cuts as
lazy 1, 2
logical
modeling linear
quadratic
removing from basis
representing with IloRange
violation
constraints
create ranged
ranged
constructing arrays of variables
continuous piecewise linear
continuous relaxation 1, 2
continuous relaxation subproblem
control callback
definition
types of
conventions
character strings
naming
notation
numbering 1, 2
numbering rows, columns
convergence tolerance
barrier algorithm and
definitioin
effect of tightness
performance and
convert CPLEX utility
converting
error code to string
file formats
network-flow model to LP
network-flow problem to LP
convex
logical constraints and
piecewise linear
convex quadratic constraint
convex quadratic programming see quadratic programming
cover cuts
defined
CPLEX
Component Libraries
core
licensing
parameters
cplex object
creating
notifying changes to
cplex.h header file 1, 2, 3, 4
cplex.log file
changing name
clone logs
default name 1, 2
CPX_ALG_AUTO symbolic constant
CPX_ALG_CONCURRENT symbolic constant
CPX_ALG_DUAL symbolic constant
CPX_ALG_HYBNETOPT symbolic constant
CPX_ALG_PRIMAL symbolic constant
CPX_ALG_SIFTING symbolic constant
CPX_INTEGER_INFEASIBLE
CPX_PARAM_AGGIND parameter
CPX_PARAM_BARSTARTALG parameter
CPX_PARAM_BARTHREADS parameter
CPX_PARAM_BBINTERVAL parameter
CPX_PARAM_BNDSTRENIND parameter
CPX_PARAM_BRDIR parameter
CPX_PARAM_BTTOL parameter
CPX_PARAM_CLIQUES parameter
CPX_PARAM_CLOCKTYPE parameter 1, 2
CPX_PARAM_COEREDIND parameter
CPX_PARAM_COLGROWTH parameter 1, 2
CPX_PARAM_COVERS parameter
CPX_PARAM_DISJCUTS parameter
CPX_PARAM_FLOWCOVERS parameter
CPX_PARAM_FLOWPATHS parameter
CPX_PARAM_FRACCUTS parameter
CPX_PARAM_GUBCOVERS parameter
CPX_PARAM_IMPLBD parameter
CPX_PARAM_INTSOLLIM parameter
CPX_PARAM_MIPCBREDLP 1, 2, 3
CPX_PARAM_MIPTHREADS parameter
CPX_PARAM_MIRCUTS parameter
CPX_PARAM_NODELIM parameter
CPX_PARAM_NODESEL parameter
CPX_PARAM_NZGROWTH parameter
CPX_PARAM_PREIND parameter
CPX_PARAM_PRELINEAR 1, 2
CPX_PARAM_PREPASS parameter
CPX_PARAM_PROBE parameter
CPX_PARAM_REDUCE 1, 2, 3, 4, 5
CPX_PARAM_REDUCE parameter
CPX_PARAM_RELAXPREIND
CPX_PARAM_RELAXPREIND parameter
CPX_PARAM_ROWGROWTH parameter 1, 2
CPX_PARAM_SCRIND parameter 1, 2, 3, 4, 5, 6, 7
CPX_PARAM_STARTALG parameter
CPX_PARAM_STRONGTHREADLIM parameter
CPX_PARAM_THREADS parameter
CPX_PARAM_TILIM parameter
CPX_PARAM_TRELIM parameter
CPX_PARAM_VARSEL parameter
CPX_PARAM_WORKMEM parameter
CPX_PREREDUCE_DUALONLY
CPX_PREREDUCE_NO_PRIMALORDUAL
CPX_PREREDUCE_PRIMALANDDUAL
CPX_PREREDUCE_PRIMALONLY
CPX_SEMICONT
CPX_SEMIINT
CPXaddchannel routine 1, 2
CPXaddcols
CPXaddcols routine 1, 2
CPXaddfpdest routine 1, 2, 3
CPXaddfuncdest routine 1, 2, 3
CPXaddrows routine 1, 2, 3
CPXaddusercuts
CPXALG_BARRIER symbolic constant
CPXbaropt
CPXbasicpresolve
CPXCENVptr
CPXCHANNELptr data type
CPXCHARptr data type
CPXcheckaddcols routine
CPXcheckaddrows routine
CPXcheckchgcoeflist routine
CPXcheckcopyctype routine
CPXcheckcopylp routine
CPXcheckcopylpwnames routine
CPXcheckcopyqsep routine
CPXcheckcopyquad routine
CPXcheckcopysos routine
CPXcheckvals routine
CPXchgbds
CPXchgcoeflist routine
CPXchgprobtype routine 1, 2
CPXchgqpcoef routine 1, 2
CPXchgrhs
CPXcloneprob 1, 2
CPXcloseCPLEX routine 1, 2, 3, 4, 5, 6, 7, 8
CPXCLPptr
CPXCNETptr
CPXcopybase
CPXcopybase routine
CPXcopycttype routine
CPXcopyctype routine 1, 2, 3
CPXcopylp routine 1, 2
CPXcopynettolp routine
CPXcopyorder routine 1, 2
CPXcopyprotected 1, 2
CPXcopyquad routine
CPXcopysos routine 1, 2, 3
CPXcopystart 1, 2
CPXcreateprob
CPXcreateprob routine 1, 2, 3, 4, 5, 6, 7, 8
CPXcutcallbackadd 1, 2
CPXdelchannel routine 1, 2
CPXdelfpdest routine 1, 2, 3
CPXdelfuncdest routine 1, 2
CPXdisconnectchannel routine
CPXdisplayiis routine
CPXdualopt 1, 2
CPXENVptr data type
CPXERR_NEGATIVE_SURPLUS symbolic constant
CPXERR_PRESLV_INF
CPXERR_PRESLV_UNBD
CPXERR_PRESOLVE_BAD_PARAM
cpxerror message channel 1, 2
CPXfclose routine
CPXFILEptr data type
CPXflushchannel routine
CPXfopen routine 1, 2
CPXfputs routine
CPXfreepresolve
CPXfreeprob
CPXfreeprob routine 1, 2, 3, 4, 5, 6
CPXgetcallbackgloballb 1, 2
CPXgetcallbackglobalub
CPXgetcallbackincumbent
CPXgetcallbackinfo routine 1, 2, 3, 4
CPXgetcallbacklp 1, 2
CPXgetcallbacknodeintfeas 1, 2
CPXgetcallbacknodelb
CPXgetcallbacknodelp
CPXgetcallbacknodeub
CPXgetcallbacknodex
CPXgetcallbackorder
CPXgetcallbackpseudocosts
CPXgetchannels routine 1, 2, 3
CPXgetcolindex routine
CPXgetcolname routine
CPXgetcols routine 1, 2, 3
CPXgetctype routine
CPXgetdblparam routine 1, 2
CPXgetdblquality routine 1, 2, 3
CPXgeterrorstring routine 1, 2
CPXgetintparam routine 1, 2
CPXgetintquality routine
CPXgetmipobjval routine 1, 2
CPXgetmipslack routine
CPXgetmipx routine 1, 2
CPXgetnumcols routine
CPXgetredlp
CPXgetrowindex routine
CPXgetrowname routine
CPXgetsos routine
CPXgetstat routine 1, 2, 3
CPXgetstrparam routine 1, 2
CPXgetx routine 1, 2
CPXhybnetopt
CPXiiswrite routine 1, 2
CPXinfodblparam routine 1, 2
CPXinfointparam routine 1, 2
CPXinfostrparam routine 1, 2
cpxlog message channel
CPXlpopt 1, 2
CPXlpopt routine 1, 2
CPXLPptr data type
CPXmemcpy routine
CPXMIP_ABORT_FEAS symbolic constant
CPXMIP_ABORT_INFEAS symbolic constant
CPXmipopt
CPXmipopt routine 1, 2
CPXmsg routine 1, 2, 3, 4
CPXmsgstr routine
CPXNETaddarcs routine
CPXNETaddnodes routine
CPXNETcheckcopynet routine
CPXNETchgobjsen routine
CPXNETcreateprob routine 1, 2
CPXNETdelnodes routine
CPXNETfreeprob routine
CPXNETprimopt routine 1, 2
CPXNETptr data type
CPXNETsolution routine
CPXnewcols routine 1, 2
CPXnewrows routine
CPXopenCPLEX routine 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
CPXordwrite routine
CPXpreaddrows
CPXpresolve 1, 2
CPXprimopt
CPXprimopt routine 1, 2
CPXPROB_FIXEDMILP symbolic constant
CPXPUBLIC symbolic constant
CPXPUBVARARGS symbolic constant
CPXqpopt routine 1, 2
CPXqpwrite routine
CPXreadcopyprob routine 1, 2
cpxresults message channel
CPXsavwrite routine
CPXsetbranchcallbackfunc
CPXsetcutcallbackfunc
CPXsetdblparam routine 1, 2
CPXsetdefaults routine
CPXsetheuristiccallbackfunc
CPXsetintparam routine 1, 2, 3, 4, 5, 6, 7
CPXsetlogfile routine 1, 2, 3, 4, 5, 6
CPXsetlpcallbackfunc routine 1, 2, 3
CPXsetmipcallbackfunc routine 1, 2
CPXsetnodecallbackfunc
CPXsetsolvecallbackfunc
CPXsetstrparam routine 1, 2
CPXsolution routine 1, 2, 3
CPXsoswrite routine
CPXstrcpy routine
CPXstrlen routine
CPXtreewrite routine
CPXVOIDptr data type
cpxwarning message channel
CPXwriteprob routine 1, 2, 3, 4
CPXwritesol routine
create
modeling variables
new rows
objective function
ranged constraints
creating
application with Concert Technology
CPLEX environment
log file
network flow problem object
problem object
crossover
file format
irreducibly inconsistent set (IIS) and
verifying barrier solutions
CSV file format
cumulative constraint 1, 2
cut
dual reductions and
cut callback
cuts 1, 2
adding
clique
cover
disjunctive
flow cover
flow path
Gomory fractional
GUB cover
implied bound
local or global
MIR
recorded in MIP node log file
re-optimizing
what are
cutting plane method
D
data
entering
data types
special
debugging
Callable Library and
diagnostic routines and
heap
Interactive Optimizer and
return values and
definition
degeneracy
dual
delete goal stacks
deleting
model objects
deleting nodes
deleting variables
dense column
Depth First
destroying
CPLEX environment
nodes
problem object
devex pricing
diagnosing
infeasibility in QPs
network infeasibility
diagnostic callback
definition
types of
diagnostic routine
log file and
message channels and
redirecting output from
diet model
diff
dimensions, checking
discontinuous piecewise linear
breakpoints and
segments and
disjunctive cuts
displaying
barrier information
barrier solution quality
basis condition
bound infeasibilities
column-nonzeros parameter
infeasibilities on screen 1, 2
messages
MIP information periodically
network objective values
network solution information
network solution on screen
optimization progress
problem dimensions
problem statistics
reduced-cost infeasibilities
simplex solution quality
solution quality
solutions on screen
variables
DPE file format
dual feasibility
dual reduction
dual residual
dual simplex optimizer
perturbing objective function
selecting
stalling
see also simplex
dual variable
solution data
duality gap
E
elapsed time for the MIP optimizer
empty goal 1, 2
end method
IloEnv class
enter Interactive Optimizer command
entering
LPs for barrier optimizer
mixed integer programs (MIPs)
network arcs
network data
network data from file
network nodes
enumeration
Algorithm
BasisStatus
BoolParam
IntParam
NumParam
Quality
Status
String Param
environment
initializing
multithreaded
releasing
environment object
constructing
EpAGap
EpGap
eq method
error checking
diagnostic routines for
MPS file format
problem dimensions
error handling
in Concert Technology
querying exceptions
Error return status (C++)
Error return status (Java)
example
Column Generation
columnwise modeling 1, 2
contents of IIS file
creating multi-dimensional arrays
Cutting Stock
FORTRAN
message handler
MIP node log file
MIP optimization
MIP problem from file
MIP with SOS and priority orders
network optimization
optimizing QP
output channels
output from infeasibility finder
Piecewise Linear
reading QP from file 1, 2
rowwise modeling 1, 2
using arrays for I/O
executing a goal
expr
expression
building
editable
linear
logical
piecewise linear
using modeling variables to construct
external variables
extra rim vectors
F
FailGoal
feasibility
analysis and barrier optimizer
check
dual 1, 2
network flows and
primal
progress toward 1, 2
feasibility tolerance
default
largest bound violation and
network optimizer and
range of
reducing
Feasible return status (C++)
Feasible return status (Java)
file format
converting
described
example of quadratic program 1, 2
file reading routines in Callable Library
file writing routines in Callable Library
flow cover cuts
defined
flow path cuts
defined
FORTRAN 1, 2
FracCand
FracPass
fractional cuts
defined
free row
G
ge method
generalized upper bound (GUB)
see also GUB
generalized upper bound (GUB) cover cuts
getBasisStatus method
IloCplex Java class
getBasisStatuses method
IloCplex C++ class
getBoundSA
getBoundSA method
IloCplex class
getCplexStatus method
IloCplex class 1, 2
getDefault method
IloCplex class
getDual
getDual method
IloCplex class
getDuals
getDuals method
IloCplex class
getIIS
getIIS method
IloCplex class
getMax
getMax method
IloCplex class
getMessage method
IloException class
getMin
getMin method
IloCplex class
getObjSA
getObjSA method
IloCplex class
getObjValue method
IloCplex class
getParam
getParam method
IloCplex class
getQuality method
IloCplex class 1, 2, 3
getRangeSA
getReducedCost
getReducedCost method
IloCplex class
getReducedCosts
getReducedCosts method
IloCplex class
getRHSSA method
IloCplex class
getSlack method
IloCplex class
getSlacks method
IloCplex class
getStatus method
IloCplex class
IloCplex::Exception class
getStatuses method
IloCplex class
getting see accessing
getValue method
IloCplex class
getValues method
IloCplex class
global thread limit
global thread parameter
global variables
goal
empty
executing
goal stack
goals as parameters
Gomory fractional cuts
defined
graphic user interface (GUI)
GUB
constraint
H
head
header file
heap, debugging
heuristic
definition
node
relaxation induced neighborhood search (RINS)
RINSHeur 1, 2
SubMIPNodeLimMDefault Para Font> 1, 2
heuristic callback
heuristic solutions
heuristics
starting point
I
ill-conditioned
basis
factors in
maximum dual residual and
problem
ILM see ILOG License Manager (ILM)
IloAdd template class
IloAddable 1, 2
IloAlgorithm::Exception class
IloAlgorithm::Status enumeration
IloArray template class
IloColumn class
and example
IloColumnArray
IloConstraint class
IloConversion
IloConversion class 1, 2, 3
IloCplex
implements IloMPModeler
objects in user application
IloCplex class
getBasisStatus method
getBasisStatuses method
getBoundSA method
getCplexStatus method 1, 2
getDefault method
getDual method
getDuals method
getIIS method
getMax method
getMin method
getObjSA method
getObjValue method
getParam method
getQuality method 1, 2, 3
getReducedCost method
getReducedCosts method
getRHSSA method
getSlack method
getSlacks method
getStatus method
getStatuses method
getValue method
getValues method
isDualFeasible method
isPrimalFeasible method
setDefaults method
setParam method
solve method 1, 2, 3, 4, 5, 6, 7
writeBasis method
IloCplex::Algorithm enumeration
IloCplex::BarStartAlg
IloCplex::BasisStatus enumeration
IloCplex::BoolParam enumeration
IloCplex::Exception class 1, 2
getStatus method
IloCplex::IntParam enumeration
IloCplex::Kappa
IloCplex::NumParam enumeration
IloCplex::Quality enumeration
IloCplex::Reduce
IloCplex::StringParam enumeration
IloCPModeler
IloEnv class
end method
IloException class
getMessage method
IloExpr class
ILOG License Manager (ILM)
CPLEX and
IloMaximize function
IloMinimize function 1, 2
IloModel class
add method 1, 2
remove method 1, 2
IloModel.add
IloModel.delete
IloModel.remove
IloModeler 1, 2
basic modeling
IloMPModeler 1, 2, 3
IloNumArray class
IloNumExpr 1, 2
IloNumVar
extension of IloNumExpr
IloNumVar class 1, 2
IloNumVarArray class
IloObjective 1, 2
IloObjective class 1, 2, 3
setExpr method
IloObjectiveSense
IloObjectiveSense.Maximize
IloObjectiveSense.Minimize
iloqpex1.cpp example
example
iloqpex1.cpp
IloRange 1, 2
IloRange class 1, 2
IloSemiContVar class
IloSolver
IloSOS1 class
IloSOS2 class
implied bound cuts
defined
include file
inconsistent constraints
incumbent
node
solution
incumbent callback
index number
Individual optimizer parallel processing
inf.getNumVar
inf.getRange
infeasibility
barrier optimizer and
diagnosing in network flows
diagnosing in QPs
displaying on screen
dual 1, 2
maximum bound
maximum reduced-cost
network flow
network optimizer and
norms
primal 1, 2, 3
ratio in barrier log file
reports
scaling and
unscaled
infeasibility finder 1, 2
multiple IISs
network-flows and
preprocessing and
sample output
setting time limit on
infeasible problem
analyzing
Infeasible return status (C++)
Infeasible return status (Java)
infeasible solution
information
InfeasibleOrUnbounded
return status
InfeasibleOrUnbounded return status (C++)
initializing
CPLEX environment
problem object 1, 2
input operator
instantiating
CPLEX environment
problem object 1, 2
int
integer variables
single LP
integrality constraints
integrality tolerance
MIP
parameter
Interactive Optimizer
debugging and
description
experimenting with optimizers
improving application performance
testing code in
IntParam
IntSolLim
intVar
irreducibly inconsistent constraints
irreducibly inconsistent set (IIS)
algorithms
example, cumulative constraint
example, network
Java API and
network flows and
sample file
isDualFeasible method
IloCplex class
isPrimalFeasible method
IloCplex class
K
knapsack constraint 1, 2
knapsack with reduced cost in objective
L
lazy constraint
definition
pool 1, 2
lazy constraints
in pools
le method
license
CPLEX
parallel
limiting
network iterations
strong branching candidate list
strong branching iterations
linear expression
linear objective function
Linear Programming problem see LP
linear relaxation
network flow and
log file
barrier optimizer
Cholesky factor in
clones and
closing
contents 1, 2
creating
default
description
diagnostic routines and
iteration
naming
network
parallel MIP optimizer and
parameter
records infeasibilities
records infeasibility information
records singularities
relocating
renaming
logical constraint 1, 2
example in early tardy scheduling
logical expression
LP
barrier optimizer
choosing algorithm
network optimizer
problem formulation 1, 2
solving 1, 2, 3
LP file format
IISs and
QPs and
row, column order
special considerations
M
managing
log file
Markowitz tolerance 1, 2
default
increasing to stay feasible
maximum value
numerical stability and
pivots and
slow progress in Phase I and
maximal cliques
recorded in MIP node log file
maximization
concave QPs
lower cutoff parameter
see also optimization
maximize
maximum bound infeasibility
maximum reduced-cost infeasibility
maximum row residual
memory
memory allocation
memory leaks
memory management 1, 2
refactoring frequency and
message channel
diagnostic routines and
message handler (example)
MILP
definition
minimal covers
recorded in MIP node log file
minimization
convex QPs
see also optimization
upper cutoff parameter
minimize
MIP 1, 2
active model
branch & cut
changing variable type
memory problems and
optimizer
problem formulation
progress reports
relaxation algorithm
subproblem algorithm
subproblems
supplying first integer solution
terminating optimization
MIPEmphasis
MipThreads
MIQP
definition
MIR
cuts
Mixed Integer Linear Program (MILP)
definition
Mixed Integer Programming (MIP)
definition
Mixed Integer Programming problem see MIP
Mixed Integer Quadratic Program (MIQP)
definition
Mixed Integer Quadratically Constrained Program (MIQCP)
model
active
adding columns to
adding objects
adding submodels
changing coefficients in
changing variable type
consistency and tolerance
deleting objects
extracting
manipulations
modifying
notifying changes to cplex object
removing objects
serializing
solving 1, 2
solving with IloCplex
XML representation of
modeling
columnwise 1, 2
objects
rowwise 1, 2
modeling by column 1, 2
modeling variable
IloNumVar
modelling variables
create
modifying a model
MPS file format
CPLEX extensions
reference row values
saving modifications
saving QP
weights
multithreaded application
needs multiple environments
N
name
namespace conflicts
naming
arcs in network flow
conventions
log file
node file
nodes in network flow
negative
negative semi-definite
objective
nested parallel processing
NET file format
NetItLim
network
converting to LP model
embedded
infeasibility in
modeling variables
problem formulation 1, 2
network extractor
Network Flow problem
see network
network object
network optimizer 1, 2, 3
column growth parameter
preprocessing and
problem formulation
row growth parameter
turn off preprocessing
nexample.net
node
demand
from
head
sink
solving linear problem at
source
supply
tail
to
transshipment
viable
node file
cpx name convention
using with MIP
when to use
node heuristic
node log
node problem
node selection callback
node selection strategy
best estimate
depth-first search
NodeLim
nondeterminism
nonlinear expression
definition
nonseparable
notation
notation in this manual
notifying
changes to cplex object
numbering conventions
C
Fortran
row, column order
numerical difficulties 1, 2
barrier growth parameter
basis condition number and
complementarity
convergence tolerance
dense columns removed
infeasibility and
sensitivity
unbounded optimal face
numerical variable
numVarArray
O
ObjDif tolerance parameter
objective
optimality tolerance and
objective coefficients
crash parameter and
modified in log file
network flows and
priority and
objective difference
absolute 1, 2
relative 1, 2
objective function
accessing value of (C++)
changing sense
constructor
create
free row as
in log file
in MPS file format
maximization
maximize
minimize
network flows and
preprocessing and
primal reductions and
quadratic terms in a single LP
representing with IloObjective
sign reversal in
objective value
accessing slack in (C++)
in log file
network flows and
object range parameter
unbounded
operator <<
operator >>
Optimal return status (C++)
Optimal return status (Java)
optimality
basis condition number and
cutoff parameters
duality and
infeasibility ration
normalized error and
singularities and
tolerance 1, 2
relative
optimality tolerance
absolute
changing relative or absolute
gap
maximum reduced-cost infeasibility and
Network and
reducing
relative
relative, default
setting
when to change
optimization
interrupting
stopping 1, 2
optimization problem
defining with modeling objects
representing with IloModel
optimization routines in Callable Library
optimizer
barrier (linear) 1, 2
barrier (quadratic) 1, 2
concurrent
differences between Barrier, simplex
dual simplex
MIP
network 1, 2, 3
parallel 1, 2
primal simplex
primal-dual barrier
selecting
optimizing
cuts
ORD file format
setting priorities in
OrGoal
out-of-core barrier
output
channel parameter
debugging and
redirecting
output operator
P
parallel
license 1, 2
optimizers 1, 2
threads
Parallel Barrier Optimizer
Parallel MIP Optimizer
memory considerations
output log file
parallel processing
branch & cut
individual optimizer
nested
root relaxation
selected starting algorithm
parameter
accessing current value 1, 2
accessing default value
accessing maximum value
accessing minimum value
algorithmic
barrier corrections
Callable Library and
controlling branch & cut strategy
gradient
iisfind
log file
netfind
object range
optimality cutoff
output channel
perturbation limit
preprocessing dependency
screen indicator
setting
setting all defaults 1, 2
setting in C++
symbolic constants as
tree memory
parameter routines in Callable Library
Parameters
parameters
max and min values for
query
performance
convergence tolerance and
perturbing
objective function
variable bounds
piecewise linear
breakpoint
concave
continuous
convex
definition
discontinuous
example
example in early tardy scheduling
steps
piecewise linear expression
piecewise linear functions
single LP
pool
of cuts
of lazy constraints
of user cuts
populating problem object 1, 2
portability
positive semi-definite
objective
quadratic constraint
PreCompress
preprocessing
advanced basis and (LP)
barrier and
barrier optimizer
dense columns removed
dependency parameter
dual reductions in
IIS files and
infeasibility finder and
MIPs
network optimizer and
primal reductions in
simplex
simplex and
starting-point heuristics and
presolve
dependency checking in
final factorization after uncrush in
gathering information about
interface
limited
process
process for MIP
protecting variables during
restricting dual reductions
restricting primal reductions
presolve compression parameter
presolved problem
adding constraints to
and branch & cut process
building
freeing
freeing memory
retaining
presolver
barrier preprocessing
simplex and
simplex preprocessing
pricing algorithms
primal feasibility
primal reduction
reduction
primal
primal simplex algorithm
primal simplex optimizer
perturbing variable bounds
stalling
see also simplex
primal variables
primal-degenerate problem
primal-dual barrier optimizer
see barrier optimizer
PrimalPricing class
priority
binary variables and
derived from set members
integer variables and
order 1, 2
parameter to control
reading from file
semi-continuous variables and
semi-integer variables and
special ordered set (SOS) and
special ordered sets (SOSs) and
priority orders
probing parameter
problem
analyzing infeasible
solving with Concert Technology
problem description
example: Rates
example: semi-continuous variables
example:Column Generation
example:Cutting Stock
problem formulation
barrier
dual 1, 2
ill-conditioned
infeasibility reports
linear
network
network-flow
primal 1, 2
removing dense columns
switching from network to LP 1, 2
problem modification routines in Callable Library
problem object
creating
destroying
freeing
initializing
instantiating
network
populating 1, 2
problem query routines in Callable Library
problem representation
example: Rates
example: semi-continuous variables
example:Column Generation
example:Cutting Stock
problem solution
example: Rates
example: semi-continuous variables
example:Column Generation
example:Cutting Stock
problem type
changing from network to LP
changing to qp
changing to zeroed_qp
quadratic programming and
prod
pruned node
PSD
positive semi-definite in objective function
Q
QP
example 1, 2, 3
problem formulation
solution example 1, 2
solving 1, 2
QP file format
QP relaxation
quadratic
constraints
convex constraints
quadratic coefficient
changing
quadratic objective functions
Quadratic Programming problem see QP
quadratically constrained programming (QCP) 1, 2, 3
query routine
R
ranged constraints
create
ranged row
reading
MIP problem data
MIP problem data from file
MIP tree from TRE file
network data from file
perturbed problem from DPE file
problem data from VEC file
QP problem data from file 1, 2
start values from MST file
redirecting
diagnostic routines
log file output
oputput
screen output
reduced cost
column generation and 1, 2
reduced costs
accessing
reduced-cost pricing
reduction
dual
refactoring frequency
dual simplex algorithm and
primal simplex algorithm and
reference counting
reference row values
reflection scaling
relative objective difference 1, 2
relative optimality tolerance
relaxation
algorithm applied to
continuous
of MIP problem
QP
series of
relaxation induced neighborhood search (RINS)
RelObjDif tolerance parameter
relocating
log file
remove method
IloModel class 1, 2
renaming
log file
residual
dual
maximum dual
maximum row
row
return status
Bounded (Java)
Error (C++)
Error (Java)
Feasible (C++)
Feasible (Java)
Infeasible (C++)
Infeasible (Java)
InfeasibleOrUnbounded
InfeasibleOrUnbounded (C++)
Optimal (C++)
Optimal (Java)
Unbounded
Unbounded (C++)
Unknown (C++)
Unknown (Java)
return value
debugging with
routines to access parameters
RHS see right-hand side
right-hand side (RHS)
file formats for
rim vectors
RINSHeur 1, 2
root relaxation
parallel processing
RootAlg
row
growth parameter
index number
name
referencing
residual
row-ordering algorithms
approximate minimum degree (AMD)
approximate minimum fill (AMF)
automatic
nested dissection (ND)
rowwise modeling 1, 2
S
SAV file format
saving
best factorable basis
DPE file
MIP tree
perturbed problem
SAV file
TRE file
scaling 1, 2
alternative methods of
definition
in network extraction
infeasibility and
numeric difficulties and QP
objective function in QP
singularities and
search tree
semi-continuous variable 1, 2, 3
priority and
semi-continuous variables
semi-definite
negative and objective
positive and constraints
positive and objective
semi-integer variable
priority and
sensitivity analysis
performing
separable
serializing
setDefaults
setDefaults method
IloCplex class
setDirection
setDirections
setExpr method
IloObjective class
setLB
setLinearCoef
setOut
setParam 1, 2
setParam method
IloCplex class
setPriorities
setPriority
setting
all default parameters 1, 2
callbacks to null 1, 2
parameters
parameters in C++
see also changing
setUB
sifting
simplex
dual
feasibility tolerance in MIP
optimizer
primal
see also dual simplex optimizer
see also primal simplex optimizer
simplex method
column generation and 1, 2
pricing phase and 1, 2
singularity
slack
accessing bound violations in (C++)
accessing in constraints in active model (Java)
accessing slack variables in constraints (C++)
accessing slack variables in objective (C++)
as indicator of ill-conditioning
as reduced cost in infeasibility analysis
example CPXgetmipslack
in primal formulation (Barrier)
in summary statistics
infeasibilities as bound violations and
infeasibility in dual associated with reduced costs
initial norms and
maximum bound violation and (Java)
pivoted in when constraint is removed
primal bound error in solution quality (Barrier)
reducing computation of steepest edge pricing
role in inequality constraints (Barrier)
role in infeasibility analysis
row complementarity in solution quality (Barrier)
steepest edge and (dual)
steepest edge and (primal)
using primal variables instead
variable needed in basis (Network)
variables and primal variables (dual)
solution
accessing quality information
accessing values of
basic infeasible primal
basis
complementary
differences between barrier, simplex
example QP 1, 2
feasible in MIPs
incumbent
infeasible basis
midface
nonbasis
quality 1, 2
serializing
supplying first integer in MIPs
using advanced presolved
verifying
XML representation of
solve callback
solve method
IloCplex class 1, 2, 3, 4, 5, 6, 7
solving
diet problem (Java example)
model
single LP (Java)
subsequent LPs or QPs in a MIP (Java)
SOS
branching priority
role in model (Java)
setting priorities and
type 1
type 2
using
weights in
sparse matrix
Special Ordered Set see SOS
special ordered sets
single LP
speed increase
square
stalling
starting algorithm
parallel processing
static variables
status variables, using
steepest-edge pricing 1, 2
step in piecewise linear function
string
StringParam
strong branching
StrongThreadLim
SubMIPNodeLimMDefault Para Font> 1, 2
sum
surplus argument
symbolic constants 1, 2
T
tail
terminating
because of singularities
because of stalling
because of time limit
MIP optimization
network optimizer iterations
threads
clones
parallel optimizers
performance and
Threads global parameter
thread-safe
TiLim
time limit
concurrent optimizer and
effects all algorithms invoked by concurrent optimizer
Interactive Optimizer command (example)
possible reason for Unknown return status (C++)
possible reason for Unknown return status (Java)
setting for infeasibility finder (example)
TiLim parameter (MIP)
tolerance
absolute objective difference and
absolute optimality
advice about
complementarity convergence, default of
complementary solution and
consistency in model and
convergence and barrier algorithm
convergence and numeric inconsistencies
convergence and performance
cut callbacks and
cut callbacks and (example)
cuts in goals and
default numerical (example LP)
feaibility range
feasibility (Network)
feasibility and largest bound violation
feasibility default
feasibility, reducing
integrality (Java example)
Markowitz
Markowitz and numerical difficulty
Markowitz, increasing to stay feasible
optimality
optimality (Network)
optimality, reducing
relative objective difference and
relative optimality
relative optimality default
role of (C++)
role of (Java)
simplex feasibility in cut callback
simplex optimality (example C++)
singularities and scaling
termination and
violated constraints in goals and
warning about absolute and relative objective difference
when reducing does not help
TRE file format 1, 2
TreLim 1, 2
type
changing variable (Concert)
conversion (Java)
U
unbounded optimal face 1, 2
Unbounded return status
Unbounded return status (C++)
Unknown return status (C++)
Unknown return status (Java)
user cut
definition
pool 1, 2
user cuts
in pools
utility routines in Callable Library
V
variable
accessing dual
cannot be added to a model
changing type 1, 2
changing type of
constructing an array
deleting
external
global
in expressions
modeling
numerical
order 1, 2
removing from basis
representing with IloNumVar
semi-continuous 1, 2, 3
semi-integer
static
type
variable selection strategy
strong branching 1, 2
variable type change
variables
create modeling
semi-continuous
VarSel
VEC file format
vectors, rim
violation
bound
constraint
W
WorkDir 1, 2
working memory
WorkMem 1, 2, 3
writeBasis method
IloCplex class
X
XML
Concert Technology and
serializing model, solution
Copyright © 1987-2003 ILOG, S.A. All rights reserved. Legal terms.