Solving a discrete model

These routines solve a discrete model, such as a mixed integer program (MIP).

CPXXmipopt and CPXmipopt
At any time after a mixed integer program has been created by a call to CPXXcreateprob/CPXcreateprob, the routine CPXXmipopt/CPXmipopt may be used to find a solution to that problem.
CPXXbendersopt and CPXbendersopt
At any time after a mixed integer program has been created by a call to CPXXcreateprob/CPXcreateprob, the routine CPXXbendersopt/CPXbendersopt may be used to find a solution to that problem using a Benders decomposition algorithm.

Parent topic: Discrete Optimization in the CPLEX Callable Library (C API) Reference Manual