Informational Callbacks

ILOG CPLEX 11.0 User's Manual > Advanced Programming Techniques > Using Optimization Callbacks > Informational Callbacks

Informational Callbacks

INDEX

PREVIOUS NEXT

An informational callback is a user-written routine that enables your application to access information about the current mixed integer programming (MIP) optimization without sacrificing performance and without interfering in the search of the solution space. The algorithms call an informational callback when the algorithm finds it appropriate; for some algorithms, an informational callback is called at every node; for other algorithms, an informational callback is called at convenient points in the progress of the algorithm. Table 30.1 summarizes the information that an informational callback can return.

An informational callback can also enable your application to abort (that is, to terminate) optimization.

Informational callbacks are compatible with MIP dynamic search. For many models, MIP dynamic search finds feasible and optimal solutions more quickly than conventional MIP branch & cut.

Informational callbacks are also compatible with all modes of parallel optimization (if your application is licensed for parallel optimization). For more information about deterministic and opportunistic modes of parallel optimization, see Determinism of Results and Parallel MIP Optimizer.

The following sections direct you to more detail about informational callbacks.

PREVIOUS NEXT