Building a discrete model

These routines support building a model for discrete optimization, such as mixed integer programming (MIP).

CPXXaddindconstr and CPXaddindconstr
The routine CPXXaddindconstr/CPXaddindconstr adds an indicator constraint to the specified problem object.
CPXXaddindconstraints and CPXaddindconstraints
Adds a set of indicator constraints to the specified problem object.
CPXXaddlazyconstraints and CPXaddlazyconstraints
The routine CPXXaddlazyconstraints/CPXaddlazyconstraints adds constraints to the list of constraints that should be added to the LP subproblem of a MIP optimization if they are violated.
CPXXaddmipstarts and CPXaddmipstarts
The routine CPXXaddmipstarts/CPXaddmipstarts adds multiple MIP starts to a CPLEX problem object of type CPXPROB_MILP, CPXPROB_MIQP, or CPXPROB_MIQCP.
CPXXaddsos and CPXaddsos
The routine CPXXaddsos/CPXaddsos adds information about a special ordered set (SOS) to a problem object of type CPXPROB_MILP, CPXPROB_MIQP, or CPXPROB_MIQCP.
CPXXaddusercuts and CPXaddusercuts
The routine CPXXaddusercuts/CPXaddusercuts adds constraints to the list of constraints that CPLEX can add to the LP subproblem of a MIP optimization if they are violated by the LP relaxation solution.

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