|
Relaxed mixed integer programming (RMIP) |
Top Previous Next |
|
The relaxed mixed integer programming (RMIP) problem is the same as the mixed integer programming (MIP) problem in all respects except all the integer, SOS and semi restrictions are relaxed:
This problem type is sometimes helpful when one is having trouble attaining a feasible integer solution. For information on the names of the solvers that can be used on the RMIP problem class see the section on Solver Model type Capabilities. |