M

managing
log file
Markowitz tolerance ,
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 ,
refactoring frequency and
message channel
diagnostic routines and
message handler (example)
MILP
definition
MIN file format
minimal covers
recorded in MIP node log file
minimization
convex QPs
see also optimization
upper cutoff parameter
minimize
MIP to
active model
branch & cut
changing variable type
memory problems and
optimizer
problem formulation
progress reports
relaxation algorithm
solution information
subproblem algorithm
subproblems
supplying first integer solution
terminating optimization
MIP optimizer
solution information
MIPEmphasis
MipThreads
MIQP
definition
MIR
cuts
Mixed Integer Programming (MIP) problem
see MIP
model
active
adding objects
adding submodels
deleting objects
extracting
manipulations
modifying
notifying changes to cplex object
removing objects
solving , ,
solving with IloCplex
modeling
columnwise ,
objects
rowwise ,
modeling by column ,
modeling variable
IloNumVar
modelling variables
create
modifying a model
MPS file format
BAS files and
CPLEX extensions
defined
DUA format
proprietary information in
reference row values
REW
saving basis
saving dual
saving embedded network
saving modifications
saving QP
weights
MST file format
multithreaded application
needs multiple environments

Previous Page: L  Return to Top Next Page: N