What is a subMIP?
Defines subMIP and documents conditions in which CPLEX solves a subMIP.
In CPLEX, a subMIP is an auxiliary mixed integer program (MIP). A subMIP is not a subproblem. (A subproblem is the LP relaxation of a node other than the root.)
CPLEX solves subMIPs in these situations:
- when it builds a solution from a partial MIP start;
- when it repairs an infeasible MIP start;
- when it executes the relaxation induced neighborhood search (RINS) heuristic;
- when it branches locally;
- when it polishes a solution.
A subMIP is usually smaller in size than
the MIP that CPLEX is currently solving. CPLEX conventionally solves
a subMIP with stricter limits on resources than in the original problem, but
CPLEX offers parameters that enable you to specify other choices.
For documentation of parameters that instruct CPLEX how you want to solve a subMIP,
see these topics in the CPLEX Parameters reference manual: