MIP optimization automatically adds incumbents to the solution pool as they are discovered when you call it in one of these conventional ways:
-
In Concert Technology, you invoke MIP optimization by means of one of these methods:
-
IloCplex::solve in the C++ API.
-
IloCplex.solve in the Java API.
-
Cplex.Solve in the .NET API.
-
In the Callable Library (C API), you invoke the MIP optimizer by means of the routine
CPXmipopt.
-
In the Interactive Optimizer, you invoke the command
mipopt.
For example, if you read the model of Example: Simple Facility Location Problem into the Interactive Optimizer and invoke the usual command mipopt, MIP optimization finds solutions that it stores in the solution pool, and the log looks something like this (allowing for variation in the MIP path):
Solution pool: 4 solutions saved.
MIP - Integer optimal solution: Objective = 4.9900000000e+02
Solution time = 0.12 sec. Iterations = 197 Nodes = 33
|
PREVIOUS
NEXT