ILOG CPLEX 11.0 Interactive Optimizer > Index

A B C D E F H I K L M N O P Q R S T V W X
A
accessing parameters in Interactive Optimizer
aggregator
B
barrier optimizer 1, 2
convergence tolerance
corrections limit
crossover
dense columns and
display levels in
dual
growth limit
iteration limit
objective range limit
ordering
primal
QCP convergence tolerance
starting algorithm
thread limit
basis
displaying
setting advanced
binary variable, displaying
bound
changing
displaying
displaying best
bound strength
C
changing
bounds
coefficients
names
objective
problem type
QP term
righthand side (RHS)
sense
variable type
channel, output
clock type
coefficient, changing
conflict
constraint
displaying
reading
conventions in parameter specification file
cplex.par parameter specification file
CPLEXPARFILE environment variable
creating parameter specification file
D
dense column
barrier and
histogram of
diagnosing infeasibility
directory, setting
displaying
basis
best bounds
binary variables
dual solution
general variables
histogram
integer variables
kappa
lower bound sensitivity
names
network optimizer
objective
objective sensitivity
parameter settings 1, 2
problem
problem bounds
problem constraints
problem statistics
problem variables
QP variables
RHS sensitivity
semi-continuous variables
settings
sifting
simplex
slack
slacks in QCP
solution variables
special ordered set (SOS)
upper bound sensitivity
E
environment
parameter specification file
variable
example parameter specification file
F
feasopt
feasopt tolerance
H
help
histogram
I
integer variable, displaying
Interactive Optimizer
accessing parameters in
commands 1, 2
customized parameter settings
setting parameters
K
kappa
L
log file
parameter specifications and
M
memory, setting
MIP
aggregation limit
backtracking strategy
branch and bound interval
branch and cut strategy
cliques and
covers and
cut factor limit
cut passes limit
cuts and
disjunctive cuts
dive strategy
emphasis
file strategy
flow cuts
Gomory cut candidate limit
Gomory cut pass limit
Gomory cuts
GUB covers
heuristic frequency
implied cuts
interval
lb heuristic strategy
memory limit for tree
MIR cuts
node algorithm
node limit
node selection strategy
order strategy
path cuts
polishing time limit
presolve at nodes
probe strategy
probe time limit
repair try limit
RINS strategy
solution limit
solution pool limit
starting algorithm
strong candidate limit
strong iteration limit
strong thread limit
subalgorithm
subnode limit
thread limit
tolerance
absolute gap
gap
integrality
lower cut off
objective difference
relative objective difference
upper cut off
variable selection strategy
MPS controlling precision of output
N
name
changing
displaying
network optimizer
displaying
iterations
pricing
tolerance
feasibility
optimality
O
objective
changing
displaying
displaying sensitivity
optimality tolerance
optimize command
output
controlling precision in MPS, REW files
directing to log file
setting channel for
output channel
P
parallel mode
parameter
customized
setting
specification file
parameter specification file 1, 2
creating
example
syntax in
parameter tuning
performance tuning
displaying results
perturbation
populate command
preprocessing
aggregator
bound strength
coefficient reduction
dependency
dual
fill
linearity
positive semi-definite
presolve and
QP and PSD
re-apply presolve after root
reductions
relaxation
symmetry breaking
problem
changing type
displaying
Q
QCP
barrier convergence tolerance and
QP
changing term in
displaying variables
reading non zeroes
quality, displaying solution
quit command
R
read command
reading
constraints
data
non zeroes
non zeroes in QP
scaling and
variables
relaxation induced neighborhood search (RINS)
righthand side (RHS), changing
S
saving parameter specification file
semi-continuous variable
displaying
sense, changing
sensitivity
displaying lower bound
displaying objective
displaying RHS
displaying upper bound
set Interactive Optimizer command
setting
customized parameters
output channel
parameter specification file
parameters
sifting
algorithm for
displaying
iterations and
simplex
crash indicator
displaying
dual gradient
iteration limit
lower objective limit
perturbation limit
perturbing
pricing
primal gradient
refactoring frequency
singularity limit
tolerance
feasibility
Markowitz
optimality
upper objective limit
slack
displaying
displaying in Interactive Optimizer
displaying in QCP
solution pool
absolute gap and
capacity of
intensity
relative gap and
replacement strategy
solution, displaying quality of
special ordered set (SOS)
displaying
statistics, displaying for problem
T
threads
time limit
tolerance
MIP
absolute gap
gap
integrality
lower cut off
objective difference
relative objective difference
upper cut off
network optimizer
feasibility
optimality
simplex
feasibility
optimality
tuning
displaying results
V
variable
binary, displaying
changing type of
displaying
displaying general
displaying in solution
displaying QP
displaying semi-continuous
W
working directory
working memory
writing files
X
xecute command

Copyright © 1987-2007 ILOG S.A. All rights reserved. Legal terms.