Index

basis information (C++ API)

gap

accessing

current parameter value (C API)

current parameter value (C++ API)

default parameter value (C API)

dual values (C++ API)

maximum parameter value (C API)

maximum parameter value (Java API)

minimum parameter value (C API)

minimum parameter value (Java API)

objective function value (C++ API)

reduced costs (C++ API)

solution quality (C++ API)

solution values (C++ API)

active model

as instance of IloCplex (Java API)

MIP (Java API)

active node

add method

IloModel C++ class

extensible arrays

modifying a model

addMinimize method (Java API)

advanced basis

starting from (callbacks)

ignored by tuning tool

in networks

parallel threads and

primal feasibility and

reading from file (LP)

saving to file (LP)

starting from (goals)

starting from (LP)

advanced start

callbacks

example (LP)

goals

AdvInd parameter

MIP start

AggCutLim

AggCutLim parameter

AggInd parameter

creating with Concert Technology (C++ API)

aggregate goal

aggregator

barrier preprocessing

MIP and

simplex and

algorithm

choosing in LP (C++ API)

controlling in IloCplex (C++ API)

pricing

type (Java API)

using multiple

Algorithm.Barrier (Java API)

application

development steps (C++ API)

arc

architecture

C++ API

Callable Library (C API)

creating multi-dimensional (C++ API)

arguments

null pointers (C API)

optional (C API)

array

constructing (Java API)

creating variables in (Java API)

extensible (C++ API)

using for I/O (C++ API)

BarAlg

large objective values and

log file and

settings

barrier optimizer

algorithm

algorithms and infeasibility

barrier display parameter

centering corrections

column nonzeros parameter and density

column nonzeros parameter and instability

corrections limit

determinism and

growth parameter

infeasibility analysis

inhibiting dual formulation

linear 1, 2

quadratic constraints and

numeric difficulties and

numerical emphasis and

parallel

parallel implementation

quadratic 1, 2

row-ordering algorithms

second-order cone program (SOCP) and

simplex optimizer and

solution quality

solving LP problems

starting-point heuristics

threads and

unbounded optimal face and

unbounded problems

uses

BarStartAlg parameter

barrier starting algorithm

BAS file format

basis

accessing information (C++ API)

advanced, primal feasible

advanced, role in network

advanced, starting from (example)

column generation and

condition number 1, 2

crash parameter and

crossover algorithms

current (C API)

differences between LP and network optimizers

from basis file

maximum row residuals and

no factoring in network optimizer

objective in Phase I and

optimal, condition number and

optimal, numeric stability and

parallel threads and advanced basis

preprocessing versus starting (MIP)

previous optimal (C API)

refactoring rate

removing objects from (C++ API)

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

sensitivity analysis and (Java API)

singularities and

starting from advanced

unexplored nodes in tree (MIP)

unstable optimal

BBInterval parameter

Big M

BndStrenInd parameter

controlling process with presolve

bound violation (LP)

Bounded return status (Java API)

branch & cut algorithm

heuristic callback in

MIP performance tuning and

memory problems and

parameters

priority order

solves MIP models

special ordered sets (SOS)

storing tree nodes 1, 2

tree

tree and presolvenode

solving linear problem at

branch variable selection callback

branching direction (Java API)

branching goal

BrDir parameter

discontinuous piecewise linear and

breakpoint

piecewise linear function and

BtTol parameter

backtrack parameter purpose

branch variable selection

call by value (C API)

Callable Library

categories of routines

core

using 1, 2

callback

control (definition)

control in parallel

cut

diagnostic (definition)

graphic user interface and

heuristic

incumbent

incumbent as filter in solution pool

informational (definition)

node selection

opportunistic parallel mode and

query (definition)

resetting to null (C API)

resetting to null (C++ API)

solve

using status variables

changing

bounds setLB (Java API)

bounds setUB (Java API)

limit on barrier corrections

maximization to minimization

model setLinearCoef (Java API)

pricing algorithm

problem type

network to LP

zeroed_qp

quadratic coefficients

type of variable

variable type (C++ API)

channel example

character string length requirements (C API)

clique cuts

Cliques parameter

ClockType parameter

cloneK.log

closing

application (network)

environment (C API)

environment (network)

log files

CoeRedInd parameter

nonzeros parameter and density

column

dense

density

index number (C API)

name (C API)

nonzeros parameter and instability

referencing (C API)

column generation

basis and

cutting plane method and

reduced cost and (example)

reduced cost to select next variable

columnwise modeling (C API)

columnwise modeling (C++ API)

columnwise modeling (Java API)

Component Libraries (definition)

convergence tolerance

unbounded models and

Concert Technology

accessing parameter values (C++ API)

application development steps (C++ API)

creating application (C++ API)

description

design (C++ API)

error handling (C++ API)

solving problem with (C++ API)

using (C++ API) 1, 2

writing programs with (C++ API)

concurrent optimizer

determinism and

licensing issues

non-default parameters and

option for (C++ API)

parallel implementation

Interactive Optimizer example

conflict

possible status

proved status

constraint

adding with user-written callback

convex quadratic

creating ranged (Java API)

cuts as

indicator

lazy 1, 2

logical

modeling linear (C++ API)

quadratic

ranged (Java API)

removing from basis (C++ API)

representing with IloRange (C++ API)

violation

constructing arrays of variables (Java API)

continuous piecewise linear

continuous relaxation (Java API)

continuous relaxation (MIP)

continuous relaxation subproblem

control callback

character strings (C API)

determinism and

opportunistic search and

types of

conventions

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 1, 2

convex

quadratic constraints and

convex quadratic constraint

cover cuts

counting

defined

Covers parameter

controlling cover cuts

CPLEX

cplex.h header file

CPX_ALG_CONCURRENT symbolic constant

extern statements in

in an application

macros for pointers in

cplex.log file

changing name

clone logs

default name 1, 2

CPX_ALG_AUTO 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_A

CPX_PARAM_ADVIND

MIP start

presolve and advanced start

CPX_PARAM_AGGIND

barrier starting algorithm

CPX_PARAM_B

CPX_PARAM_BARSTARTALG

CPX_PARAM_BBINTERVAL

CPX_PARAM_BNDSTRENIND

CPX_PARAM_BRDIR

CPX_PARAM_BTTOL

CPX_PARAM_C

CPX_PARAM_CLIQUES

example of parameter checking

CPX_PARAM_CLOCKTYPE

CPX_PARAM_COEREDIND

CPX_PARAM_COVERS

entering problem data and

CPX_PARAM_CUTLO

conflict refiner and

FeasOpt and

CPX_PARAM_CUTUP

conflict refiner and

FeasOpt and

CPX_PARAM_D

CPX_PARAM_DATACHECK

CPX_PARAM_DEPIND

LPs and

CPX_PARAM_DISJCUTS

CPX_PARAM_E

CPX_PARAM_EPAGAP

CPX_PARAM_EPGAP

CPX_PARAM_EPOPT

CPX_PARAM_EPRHS

CPX_PARAM_F

CPX_PARAM_FLOWCOVERS

CPX_PARAM_FLOWPATHS

CPX_PARAM_FRACCUTS

CPX_PARAM_G

CPX_PARAM_GUBCOVERS

CPX_PARAM_I

CPX_PARAM_IMPLBD

CPX_PARAM_INTSOLLIM

CPX_PARAM_L

CPX_PARAM_LPMETHOD

choosing LP optimizer

network flow

CPX_PARAM_M

CPX_PARAM_MEMORYEMPHASIS

final factor after preprocessing

conserving memory

presolve and

CPX_PARAM_MIPCBREDLP

branch callbacks and

callback arguments and

heuristic callbacks and

incumbent callback and

presolved and original problem

user defined cuts and

CPX_PARAM_MIRCUTS

CPX_PARAM_N

CPX_PARAM_NODEFILEIND

CPX_PARAM_NODELIM

CPX_PARAM_NODESEL

CPX_PARAM_NUMERICALEMPHASIS

CPX_PARAM_P

CPX_PARAM_POLISHTIME

solution polishing

CPX_PARAM_PREIND

CPX_PARAM_PRELINEAR

advanced MIP control and

user cut pools

user defined cuts

CPX_PARAM_PREPASS

CPX_PARAM_PROBE

network flow and quadratic objective

CPX_PARAM_QPMETHOD

CPX_PARAM_R

CPX_PARAM_REDUCE

lazy constraints and advanced MIP control

infeasible problems and

lazy constraints and

presolve and problem modifications

optimal basis and

problem modifications and

unbounded problems and

CPX_PARAM_RELAXPREIND

managing input and output

CPX_PARAM_REPAIRTRIES

MIP starts and

CPX_PARAM_REPEATPRESOLVE

CPX_PARAM_SCRIND

error checking and

example lpex6.c

example with callbacks

network flow

programming practices and

repeated singularities and

CPX_PARAM_SCRIND parameter

data checking and

reporting repeated singularities

CPX_PARAM_STARTALG

controlling algorithm in initial relaxation (MIP)

initial subproblem and

parallel processing and barrier

CPX_PARAM_SUBALG

controlling algorithm at nodes

node relaxations and

CPX_PARAM_SUBMIPNODELIM

CPX_PARAM_T

CPX_PARAM_TILIM

CPX_PARAM_TRELIM

CPX_PARAM_V

CPX_PARAM_VARSEL

CPX_PARAM_W

CPX_PARAM_WORKDIR

node file subdirectory

CPX_PARAM_WORKMEM

controlling zero-half cuts

CPX_PARAM_ZEROHALFCUTS

CPX_PREREDUCE_DUALONLY

CPX_PREREDUCE_NO_PRIMALORDUAL

CPX_PREREDUCE_PRIMALANDDUAL

CPX_PREREDUCE_PRIMALONLY

CPX_SEMICONT

CPX_SEMIINT

CPXa

CPXaddchannel routine

data types in Callable Library and

message handling and

CPXaddcols routine

maintainable code and

memory management and

modifying problems

CPXaddfpdest routine

example lpex5.c

file pointers and

message channels and

CPXaddfuncdest routine

function pointers and (C API)

message channels and

CPXaddindcontr

CPXaddrows routine

memory allocation and (C API)

modularity and

CPXaddusercuts

CPXALG_BARRIER symbolic constant

CPXb

CPXbaropt

CPXbasicpresolve

CPXc

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

CPXchgqpcoef routine

changing quadratic terms

advanced preprocessing and

CPXchgrhs

CPXcloneprob routine

copying node LPs

CPXcloseCPLEX routine

managing input and output

network flow problems

purpose

CPXCLPptr

CPXCNETptr

CPXcopybase

CPXcopybase routine

CPXcopycttype routine

CPXcopyctype routine

checking types of variables

example mipex1.c

specifying types of variables

CPXcopylp routine 1, 2

CPXcopynettolp routine

CPXcopyorder routine

CPXcopyprotected 1, 2

CPXcopyquad routine

CPXcopysos routine

example mipex3.c

CPXcopystart 1, 2

CPXcopystart routine

advanced presolved solution and

crushing primal or dual solutions

CPXcreateprob

CPXcreateprob routine

CPXERR_NEGATIVE_SURPLUS symbolic constant

role in application

CPXcutcallbackadd 1, 2

CPXd

CPXdelchannel routine 1, 2

CPXdelfpdest routine 1, 2, 3

CPXdelfuncdest routine 1, 2

CPXdelindconstr

CPXdisconnectchannel routine

CPXdualopt 1, 2

CPXe

CPXENVptr data type

CPXERR_PRESLV_INF

CPXERR_PRESLV_UNBD

CPXERR_PRESOLVE_BAD_PARAM

cpxerror message channel 1, 2

CPXf

CPXfclose routine

CPXFILEptr data type

CPXflushchannel routine

CPXfopen routine 1, 2

CPXfputs routine

CPXfreepresolve

CPXfreeprob

CPXfreeprob routine 1, 2, 3, 4, 5

CPXg

CPXgetcallbackgloballb 1, 2

CPXgetcallbackglobalub

CPXgetcallbackincumbent

CPXgetcallbackinfo routine 1, 2, 3

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

CPXgetctype routine

CPXgetdblparam routine 1, 2

CPXgetdblquality routine 1, 2, 3

CPXgeterrorstring routine 1, 2

CPXgetintparam routine 1, 2

CPXgetintquality routine

CPXgetnumcols routine

CPXgetobjval routine

CPXgetredlp

CPXgetrowindex routine

CPXgetrowname routine

CPXgetslack routine

CPXgetsos routine

CPXgetstat routine 1, 2

CPXgetstrparam routine 1, 2

CPXgetx routine 1, 2

CPXh

CPXhybnetopt

CPXinfodblparam routine 1, 2

CPXinfointparam routine 1, 2

CPXinfostrparam routine 1, 2

CPXl

cpxlog message channel

CPXlpopt 1, 2

CPXlpopt routine 1, 2

CPXLPptr data type

CPXm

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

CPXn

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

CPXo

CPXopenCPLEX routine

initializing environment

managing input and output

parameters and

role in application

CPXordwrite routine

CPXp

CPXpreaddrows

CPXpresolve 1, 2

CPXprimopt

CPXprimopt routine 1, 2

CPXPROB_FIXEDMILP symbolic constant

CPXPUBLIC symbolic constant

CPXPUBVARARGS symbolic constant

CPXqpopt routine 1, 2

CPXr

CPXreadcopyprob routine 1, 2

cpxresults message channel

CPXs

CPXsetbranchcallbackfunc

CPXsetcutcallbackfunc

CPXsetdblparam routine 1, 2

CPXsetdefaults routine

CPXsetheuristiccallbackfunc

CPXsetintparam routine

redirecting output to screen

selecting root algorithm

setting clock type

CPXsetlogfile routine 1, 2

CPXsetlpcallbackfunc routine 1, 2, 3

CPXsetmipcallbackfunc routine 1, 2

CPXsetnodecallbackfunc

CPXsetsolvecallbackfunc

CPXsetstrparam routine 1, 2

CPXsolution routine 1, 2, 3

CPXstrcpy routine

CPXstrlen routine

CPXv

CPXVOIDptr data type

CPXw

cpxwarning message channel

CPXwriteprob routine 1, 2, 3, 4, 5

C (continued)

creating

application with Concert Technology (C++ API)

array of variables (Java API)

arrays of variables (Java API)

Boolean variables (Java API)

CPLEX environment

network flow problem object

modeling variables (Java API) 1, 2

new rows (Java API)

objective function (Java API)

ranged constraints (Java API)

crossover

verifying barrier solutions

CSV file format

cut

GUB cover

implied bound

mixed integer rounging (MIR)

CutLo parameter

cuts 1, 2

cover

MIR

recorded in MIP node log file

re-optimizing

what are

CutsFactor parameter

CutUp parameter

data types

debugging

diagnostic routines and (C API)

heap

return values and

degeneracy

CPLEX environment (C API)

stalling and

delete goal stacks

deleting

model objects (C++ API)

dense matrix

DepInd parameter

destroying

nodes

deterministic search

control callbacks and

mixed integer programming (MIP) and

incumbent callbacks and

parallel optimization and

query callbacks in dynamic search

query callbacks in parallel

time limits and

devex pricing

diagnosing

infeasibility (barrier)

infeasibility (LP)

infeasibility (preprocessor)

infeasibility (QP)

infeasiblity as conflict

performance problems (LP)

unboundedness 1, 2

diagnostic callback

types of

diagnostic routine

message channels and (C API)

log file and (C API)

redirecting output from (C API)

diet model (Java API)

diff method (Java API)

dimensions, checking

discontinuous piecewise linear

DisjCuts parameter

displaying

barrier solution quality

basis condition

bound infeasibilities

column-nonzeros parameter

infeasibilities on screen

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

diversity filter

dual simplex optimizer

perturbing objective function

selecting

stalling

dual variable

solution data (C++ API)

duality gap

dynamic search

incumbent callbacks and

informational callbacks and

query callbacks and

dynamic search algorithm

enter Interactive Optimizer command

empty goal 1, 2

end method

IloEnv C++ class

entering

LPs for barrier optimizer

mixed integer programs (MIPs)

network arcs

network data

network data from file

network nodes

enumeration

Algorithm (C++ API)

BasisStatus (C++ API)

BoolParam (C++ API)

String Param (C++ API)

environment

constructing (C++ API)

initializing (C API)

multithreaded (C API)

releasing (C API)

EpAGap parameter

objective near zero and

EpGap parameter

diagnostic routines for (C API)

when to change

EpOpt parameter

EpRHS parameter

eq method (Java API)

error checking

MPS file format

problem dimensions

error handling

in Concert Technology (C++ API)

querying exceptions

Error return status (C++)

Error return status (Java API)

example

Column Generation

columnwise modeling (C API)

columnwise modeling (C++ API)

conflict refiner (Interactive Optimizer)

creating multi-dimensional arrays (C++ API)

MIP problem from file

MIP with SOS and priority orders

reading QP from file 1, 2

resource allocation

rowwise modeling (C API)

rowwise modeling (C++ API)

using arrays for I/O (C++ API)

executing a goal

expression

building (C++ API)

editable (Java API)

in ranged constraints (Java API)

linear (C++ API)

logical (C++ API)

piecewise linear (C++ API)

square method (Java API)

sum method (Java API)

using modeling variables to construct (Java API)

external variables (C API)

extra rim vectors

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 API)

feasOpt method

file format

BAS

converting

CSV comma separated values

described

example QP problem data (C API)

FLT

lazy constraints in LP format

lazy constraints in MPS format

lazy constraints in SAV format

MPS

NET

solution pool filters

user cuts in LP format

user cuts in SAV format

file reading routines in Callable Library

file writing routines in Callable Library

filter

diversity, example

diversity, purpose

incumbent callback and solution pool

flow cover cuts

flow path cuts

FlowCovers parameter

FlowPaths parameter

generalized upper bound (GUB) cover cut

FLT file format

FORTRAN 1, 2

FracCand parameter

FracCuts parameter

FracPass parameter

fractional cuts

free variable

reformulating QPs and

ge method (Java API)

generalized upper bound (GUB) cover cuts

getBasisStatus method

IloCplex Java class

getBasisStatuses method

getBoundSA method

getBoundSA method (Java API)

getCplexStatus method

IloCplex C++ class 1, 2

getDefault method

getDual method

getDual method (Java API)

getDuals method

getDuals method (Java API)

getMax method

getMax method (Java API)

getMessage method

IloException class

getMin method

getMin method (Java API)

getNumVar method

IloCplex class (Java API)

getObjSA method

getObjSA method (Java API)

getObjValue method

getParam method

getParam method (Java API)

getQuality method

IloCplex class 1, 2

getRange method

IloCplex class (Java API)

getRangeSA method (Java API)

getReducedCost method

getReducedCost method (Java API)

getReducedCosts method

getReducedCosts method (Java API)

getRHSSA method

getSlack method

getSlacks method

getStatus method

IloCplex::Exception class

getStatuses method

IloCplex class

getValue method

getValues method

graphic user interface (GUI)

global variables (C API)

goal

empty

solution injection by

goal stack

Gomory fractional cuts

defined

group

GUB

GUBCovers parameter

head

heuristic

node

relaxation induced neighborhood search (RINS)

RINSHeur parameter

solutions

starting point

SubMIPNodeLim and RINS

histogram

column counts

detecting dense columns

ill-conditioned

basis

factors in

maximum dual residual and

problem

IloAdd template class (C++ API)

IloAddable class (Java API)

active model

modeling objects and

IloAlgorithm::Exception class (C++ API)

IloAlgorithm::Status enumeration (C++ API)

IloArray template class (C++ API)

IloColumn class

and example (Java API)

IloColumnArray class (Java API)

IloConstraint class (C++ API)

IloConversion class (C++ API) 1, 2, 3

IloConversion class (Java API)

IloCplex class

getBasisStatus method (Java API)

getBasisStatuses method (C++ API)

getBoundSA method (C++ API)

getCplexStatus method (C++ API) 1, 2

getDefault method (C++ API)

getDual method (C++ API)

getDuals method (C++ API)

getMax method (C++ API)

getMin method (C++ API)

getObjSA method (C++ API)

getObjValue method (C++ API)

getParam method (C++ API)

getQuality method 1, 2

getQuality method (C++ API)

getReducedCost method (C++ API)

getReducedCosts method (C++ API)

getRHSSA method (C++ API)

getSlack method (C++ API)

getSlacks method (C++ API)

getStatus method (C++ API)

getStatuses method

getValue method (C++ API)

getValues method (C++ API)

IloMPModeler and (Java API)

isDualFeasible method (C++ API)

isPrimalFeasible method (C++ API)

modeling objects and (Java API)

notifying about changes to (C++ API)

objects in user application (C++ API)

PrimalPricing (Java API)

setDefaults method (C++ API)

setParam method (C++ API)

solve method (C++ API) 1, 2, 3, 4, 5, 6, 7, 8

writeBasis method

IloCplex::Algorithm enumeration

IloCplex::BarStartAlg

IloCplex::BasisStatus enumeration (C++ API)

IloCplex::BoolParam enumeration (C++ API)

IloCplex::Exception class

getStatus method

IloCplex::Exception class (C++ API)

IloCplex::IntParam enumeration (C++ API)

IloCplex::Kappa

IloCplex::NumParam enumeration (C++ API)

IloCplex::Quality enumeration (C++ API)

IloCplex::Reduce

IloCplex::StringParam enumeration (C++ API)

IloCplexModeler interface

modeling objects (Java API)

IloCPModeler class (Java API)

IloEnv class

end method (C++ API)

IloException class

ILOG License Manager

ILOG License Manager (ILM)

CPLEX (C++ API) and

types of

IloLPMatrix class (Java API)

IloMaximize C++ function

IloMinimize C++ function 1, 2

IloModel C++ class

IloModel class

add method (C++ API) 1, 2

add method (Java API)

remove method (C++ API) 1, 2

remove method (Java API)

IloModeler class

basic modeling (Java API)

creating modeling objects (Java API)

creating variables (Java API)

IloMPModeler class

creating variables (Java API)

IloMPModeler class (Java API)

delete method

IloNumArray C++ class

IloNumExpr class

objective and (Java API)

ranged constraints and (Java API)

variables and (Java API)

IloNumVar C++ class 1, 2

IloNumVar class

modeling objects and (Java API)

IloNumVarArray C++ class

IloNumVarclass

extension of IloNumExpr (Java API)

IloObjective C++ class

IloObjective class

addable objects (Java API)

as modeling object (C++ API)

declaring (C++ API)

modeling by column (Java API)

setExpr method in QP term

IloObjectiveSense class

example (Java API)

maximizing (Java API)

minimizing (Java API)

objective function and (Java API)

iloqpex1.cpp example

example

iloqpex1.cpp

IloRange class

adding constraints (C++ API)

linear constraints and (C++ API)

modeling by column (Java API)

modeling objects and (Java API)

IloSemiContVar class

IloSolver as factory (Java API)

ImplBd parameter

implied bound cuts

incumbent

node

solution

solution pool and

incumbent callback

deterministic search and

dynamic search and

filtering solution pool

infeasibility

diagnosing in network flows

conflicts and

dual 1, 2

network optimizer and

norms

primal 1, 2, 3

ratio in barrier log file

repairing

reports

scaling and

unboundedness and (LP)

unscaled

Infeasible return status (C++ API)

Infeasible return status (Java API)

infeasible solution

accessing information (Java API)

analyzing (C++ API)

InfeasibleOrUnbounded

return status (C++ API)

return status (Java API)

informational callback

dynamic search and

initializing

CPLEX environment

problem object

input operator (C++ API)

instantiating

CPLEX environment

problem object

integrality constraints

integrality tolerance

changing problem type (MIP)

parameter

Interactive Optimizer

debugging and

description

determinism

experimenting with optimizers

improving application performance

tuning tool time limit

IntSolLim parameter

isDualFeasible method

knapsack problem with reduced cost in objective

isolated point

isPrimalFeasible method

lazy constraint

in expressions (Java API)

LP file format and

MPS file format and

pool 1, 2

SAV file format and

le method

license

CPLEX (C++ API)

runtime

limiting

network iterations

strong branching candidate list

strong branching iterations

linear expression (C++ API)

linear objective function (C++ API)

linear relaxation

as initial subproblem in MIP

MIP and coefficients at nodes

MIP and preprocessing

MIP and progress reports

log file

contents 1, 2

diagnostic routines and (C API)

iteration

naming

network

parallel MIP optimizer and

parameter

records infeasibilities

records singularities

relocating

renaming

logical constraint 1, 2

example in early tardy scheduling

logical expression (C++ API)

barrier optimizer

choosing algorithm (C++ API)

network optimizer

problem formulation 1, 2

solving 1, 2

LP file format

special considerations

Markowitz tolerance 1, 2

default

increasing to stay feasible

maximum value

numeric stability and

pivots and

slow progress in Phase I and

maximal cliques

recorded in MIP node log file

maximization

concave QPs

lower cutoff parameter

maximize method

objective functions and (Java API)

maximum bound infeasibility

maximum reduced-cost infeasibility

memory emphasis

memory leaks (C++ API)

memory management

MIPs and

performance in LP

refactoring frequency and

MemoryEmphasis parameter

final factor after preprocessing

conserving memory and

presolve and

message channel

diagnostic routines and (C API)

message handler (example)

minimal covers

recorded in MIP node log file

minimization

convex QPs

upper cutoff parameter

minimize method

objective functions and (Java API)

MIP 1, 2

active model (Java API)

branch & cut (Java API)

changing variable type

supplying first integer solution

terminating optimization

MIP start

MIPEmphasis

MIRCuts parameter

Mixed Integer Linear Program (MILP)

definition (Java API)

Mixed Integer Programming (MIP)

mixed integer programming (MIP)

Mixed Integer Quadratic Program (MIQP)

Mixed Integer Quadratically Constrained Program (MIQCP)

definition (Java API)

mixed integer rounting (MIR) cut

model

active (Java API)

adding columns to

adding objects (C++ API)

adding submodels (C++ API)

changing variable type

consistency and tolerance

deleting objects (C++ API)

extracting (C++ API)

IloMPModeler and (Java API)

modifying (Java API)

notifying changes to IloCplex object (C++ API)

portfolio optimization

reformulating dense QP

reformulating large QP

removing objects (C++ API)

serializing

solving (C++ API) 1, 2

solving with IloCplex (C++ API)

XML representation of

modeling

modeling by column (Java API)

modeling variable

IloNumVar (Java API)

modifying

MPS file format

quadratically constrained program (QCP) in

saving modifications

saving QP

user cuts in

multithreaded application

needs multiple environments (C API)

namespace conflicts (C API)

naming

nodes in network flow

negative method

expressions and (Java API)

negative semi-definite objective

NET file format

NetItLim

network

converting to LP model

embedded

infeasibility in

modeling variables

problem formulation 1, 2

network extractor

network object

network optimizer 1, 2, 3

controlling algorithm at subproblems (MIP)

problem formulation

turn off preprocessing

node

demand

from

head

sink

tail

cpx name convention

when to use 1, 2

node selection callback

node selection strategy

best estimate

depth-first search

NodeAlg

NodeAlg parameter

node relaxations and

NodeFileInd parameter

NodeLim parameter

NodeSel parameter

nonlinear expression

changes to IloCplex object (C++ API)

nonseparable

notation in this manual

notifying

null goal

when to use

numbering conventions

Fortran

row, column order

numeric difficulties

barrier growth parameter

basis condition number and

complementarity

convergence tolerance

definition (LP)

dense columns removed

numeric variable (C++ API)

sensitivity

unbounded optimal face

numerical emphasis

continuous (LP)

NumericalEmphasis parameter

accessing value of (C++ API)

ObjDif tolerance parameter

objective coefficients

objective difference

absolute 1, 2

relative 1, 2

objective function

changing sense

constructor (Java API)

optimality tolerance and

representing with IloObjective (C++ API)

primal reductions and

sign reversal in

objective value

accessing slack in (C++ API)

in log file

network flows and

object range parameter

unbounded

operator << (C++ API)

operator >> (C++ API)

opportunist mode

MIP in parallel and

MIP parallel optimizer and

parallel mode parameter

opportunistic search

component libraries and

control callbacks in parallel

deployment and

development and

diagnostic callbacks and

informational callbacks and

mixed integer programming (MIP) and

query callbacks and

query callbacks in parallel

synchronization and

thread safety and

threads parameter and

wait time and

Optimal return status (C++ API)

Optimal return status (Java API)

optimality

basis condition number and

tolerance 1, 2

optimality tolerance

changing relative or absolute

gap

maximum reduced-cost infeasibility and

optimization

stopping 1, 2

optimization problem

defining with modeling objects (C++ API)

representing with IloModel (C++ API)

optimization routines in Callable Library

optimizer

barrier (linear) 1, 2

barrier (quadratic) 1, 2

choosing (Java API) 1, 2

concurrent

differences between Barrier, simplex

dual simplex

output operator (C++ API)

network 1, 2, 3

parallel 1, 2

primal simplex

primal-dual barrier

optimizing

cuts

output

parallel

license

optimizers 1, 2

threads

Parallel Barrier Optimizer

Parallel MIP Optimizer

memory considerations

output log file

parallel optimization

control callbacks and

query callbacks and 1, 2

parallel processing

root relaxation

selected starting algorithm

parallel processor

barrier optimization and

concurrent optimization and

parameter

accessing

current value (C API)

current value (C++ API)

current value (Java API)

default value (C API)

default value (C++ API)

default value (Java API)

maximum value (C API)

maximum value (C++ API)

maximum value (Java API)

minimum value (C API)

minimum value (C++ API)

minimum value (Java API)

algorithmic

barrier corrections

Callable Library and

classes of (Java API)

controlling branch & cut strategy

gradient

routines in Callable Library

NetFind network extractor

object range

optimality cutoff

output channel

preprocessing dependency

screen indicator

setting

all defaults (C API)

all defaults (C++ API)

all defaults (Java API)

branching direction (Java API)

example algorithm (Java API)

C++ API

example steepest edge pricing (Java API)

example turn off presolve (Java API)

priority in MIP (Java API)

RootAlg (Java API)

symbolic constants as (C API)

tree memory

types of

centering corrections and

C++ API

Java API string

Java API StringParam

performance

Barrier

characteristics

dense columns and

memory management and

numeric difficulties and

convergence tolerance and

row order and

tuning

advanced basis and

automatic selection of optimizer

increasing available memory

network as model

numeric difficulties and

parameters for

negative impact of Reduce parameter

preprocessing and memory

refactoring and

troubleshooting

tuning

MIP

default optimizer and

Network optimizer

SOS

branching strategies and

perturbation constant (LP)

perturbing

example in early tardy scheduling

expression (C++ API)

IloMPModeler and (Java API)

isolated point ignored

steps

polishing a solution

PolishTime parameter

pool

populating a solution pool

populating problem object (C API)

populating problem object (network optimizer)

portability (C API)

portfolio optimization model

positive semi-definite

objective

quadratic constraint

second-order cone program (SOCP) and

possible status in conflict refiner

preference

FeasOpt

PreInd parameter

PreLinear parameter

user cut pools

user defined cuts

PrePass parameter

second-order cone program (SOCP) and

preprocessing

advanced basis and (LP)

barrier and

barrier optimizer

definition of

dense columns removed

dependency parameter

dual reductions in

lazy constraints and

MIPs

network optimizer and

primal reductions in

simplex and

starting-point heuristics and

turning off

presolve

barrier preprocessing

dependency checking in

final factorization after uncrush in

gathering information about

protecting variables during

restricting dual reductions

restricting primal reductions

simplex and

simplex preprocessing

turning off (Java API)

presolved problem

adding constraints to

and branch & cut process

primal simplex optimizer

perturbing variable bounds

stalling

primal variables

primal-degenerate problem

priority

binary variables and

integer variables and

order

parameter to control

reading from file

semi-continuous variables and

semi-integer variables and

special ordered set (SOS) and

priority order (Java API)

Probe parameter

analyzing infeasible (C++ API)

probing parameter

problem

solving with Concert Technology (C++ API)

problem description

example: Rates

example: semi-continuous variables

example:Column Generation

example:Cutting Stock

problem formulation

problem modification routines in Callable Library

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 object

instantiating (C API)

network

populating

populating (C API)

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 1, 2

changing to qp

changing to zeroed_qp

quadratic programming and

prod method in expressions (Java API)

proved status in conflict refiner

pruned node

PSD

positive semi-definite in objective function

quadratic constraints and

second-order cone program (SOCP) as exception to

QCP

reformulating large, dense models

convexity and

detecting problem type

examples

file types and

modifying constraints in

PSD and

example 1, 2, 3

portfolio optimization

problem formulation

solution example 1, 2

solving 1, 2

QP relaxation

quadratic

constraints

convex constraints

quadratic coefficient

changing

quadratic objective function (C++ API)

quadratically constrained programming (QCP) 1, 2

queried

query callback

parallel optimization and

deterministic search and

dynamic search and

query routine (C API)

ranged constraint

definition (Java API)

name of (Java API)

ranged row

reading

MIP problem data

MIP problem data from file

network data from file

QP problem data from file 1, 2

start values from MST file

redirecting

diagnostic routines (C API)

Reduce parameter

reduced cost

choosing variables in column generation

column generation and

pricing (LP)

reduction

dual simplex algorithm and

reduction, primal

refactoring frequency

primal simplex algorithm and

reference counting

reference row values

reference set

refineConflict

relaxation induced neighborhood search (RINS)

reflection scaling

relative objective difference 1, 2

relative optimality tolerance

relaxation

solving MIPs (Java API)

RelaxPreInd parameter

RelObjDif tolerance parameter

relocating log file

remove method

IloModel C++ class 1, 2

renaming

repairing

infeasibility

RepairTries parameter

MIP starts and

RepeatPresolve parameter

purpose

residual

maximum dual

maximum row

row

return status

Bounded (Java API)

Error (C++)

Error (Java API)

Feasible (C++)

Feasible (Java API)

Infeasible (C++)

Infeasible (Java API)

InfeasibleOrUnbounded (C++ API)

InfeasibleOrUnbounded (Java API)

Optimal (C++ API)

Optimal (Java API)

Unbounded (C++ API)

Unbounded (Java API)

Unknown (C++ API)

Unknown (Java API)

return value

routines to access parameters (C API)

debugging with

righthand side (RHS)

root relaxation

RootAlg parameter

controlling initial relaxation algorithm

initial subproblem and

network flow

network flow and quadratic objective

parallel processing and barrier

row

row-ordering algorithms

approximate minimum degree (AMD)

approximate minimum fill (AMF)

automatic

nested dissection (ND)

rowwise modeling

scaled problem statistics

saving

best factorable basis

ScaInd parameter

scaling

alternative methods of

feasibility and

in network extraction

numeric difficulties and QP

maximum row residual and

objective function in QP

second order cone programming (SOCP)

second-order cone program (SOCP)

formulation

semi-continuous variable

semi-definite

negative and objective

positive and constraints

positive and objective

semi-integer variable

priority and

sensitivity analysis (C++ API)

sensitivity analysis (Java API)

setDefaults method

setExpr method

setOut method

setParam method

algorithm in LP (C++ API)

setting

all default parameters (C API)

all default parameters (C++ API)

callbacks to null (C API)

callbacks to null (C++ API)

parameters (C API)

parameters in C++ API

sifting

simplex

column generation and

feasibility tolerance in MIP

slack

accessing bound violations in (C++ API)

accessing in constraints in active model (Java API)

accessing slack variables in constraints (C++ API)

accessing slack variables in objective (C++ API)

as indicator of ill-conditioning

as reduced cost in infeasibility analysis

example CPXgetslack

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 API)

meaning in infeasible primal or dual LP

pivoted in when constraint is removed (C++ API)

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)

SOCP second-order cone program

solution

accessing quality information (C++ API)

accessing values of (C++ API)

alternative (MIP)

basic infeasible primal

basis

complementary

differences between barrier, simplex

example QP 1, 2

quality 1, 2

supplying first integer in MIPs

using advanced presolved

verifying

XML representation of

solution goal

solution polishing

solution pool

changing fixed problem and

subsequent LPs or QPs in a MIP (Java API)

diversity filters and

writing MIP start file

solve callback

solve method

IloCplex C++ class 1, 2, 3, 4, 5, 6, 7, 8

solving

diet problem (Java API)

model (C++ API)

single LP (Java API)

sparse matrix

IloLPMatrix and (Java API)

special ordered set (SOS)

role in model (Java API)

using

starting algorithm

static variables (C API)

status variables, using

steepest-edge pricing 1, 2

step in piecewise linear function

stopping criterion

SubMIPNodeLim parameter

RINS and

suppressing output to the screen

subproblem

definition (MIP)

summary statistics

surplus argument (C API)

symbolic constants (C API) 1, 2

tail

terminating

because of singularities

MIP optimization

network optimizer iterations

The

TiLim parameter

effects all algorithms invoked by concurrent optimizer

time limit

concurrent optimizer and

deterministic search and

possible reason for Unknown return status (C++ API)

possible reason for Unknown return status (Java API)

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 numeric (example LP)

feaibility range

feasibility (Network)

feasibility and largest bound violation

feasibility default

feasibility, reducing

integrality

example (Java API)

Markowitz

Markowitz and numeric difficulty

Markowitz, increasing to stay feasible

optimality

optimality (Network)

optimality, reducing

relative objective difference and

relative optimality

relative optimality default

role of (C++ API)

role of (Java API)

simplex feasibility in cut callback

simplex optimality (example C++ API)

singularities and scaling

termination and

violated constraints in goals and

warning about absolute and relative objective difference

when reducing does not help

TreLim parameter

changing for variable (Java API)

tuning tool

Callable Library (C API)

type

conversion (Java API)

unbounded optimal face

barrier optimizer

detecting

Unbounded return status (C++ API)

Unbounded return status (Java API)

unboundedness

dual infeasibility and

unscaled problem statistics

infeasibility and (LP)

optimal objective and

unbounded ray and

Unknown return status (C++ API)

Unknown return status (Java API)

user cut

utility routines in Callable Library

LP file format and

MPS file format and

pool 1, 2

SAV file format and

variable

accessing dual (C++ API)

changing type (C++ API) 1, 2

changing type of

constructing arrays of (Java API)

creating modeling (Java API)

deleting (Java API)

external (C API)

global (C API)

in expressions (C++ API)

modeling (Java API)

not addable (Java API)

numeric (C++ API)

order 1, 2

removing from basis (C++ API)

representing with IloNumVar (C++ API)

semi-continuous (C++ API)

semi-continuous (example)

semi-continuous (Java API)

semi-integer

static (C API)

type

variable selection strategy

parameter for

strong branching and best node progress

strong branching and conservation of memory

variable type change (Java API)

VarSel parameter

vectors, rim

violation

bound

constraint

WorkDir parameter

node file subdirectory

working directory

working memory