Originally posted by: maiklb2005
Thank you. I have found the appropriate library to do so: it is in the admipex1.c. What it does is it outputs the formulation along with the cuts into an .lp file, thus it extracts and saves the cuts.
The difficulty with the resulting output .lp file is the following: sometimes original constraints are overwritten by stronger cuts. What is leads to, for example, is that a c1 constraint in the original formulation and a c1 constraint in the output .lp file are different. Also, alpha-numeric indicators that correspond to cuts are not necessarily of the formal c1, c2, ...etc. Rather, cuts have indicators that involve other letters, such as, "v," "m," "i" ... etc.
To illustrate the issue, allow me to provide an example that I have been considering (for the sake of brevity, I will show only constraints):
c1: 35 x1 + 51 x2 + 67 x3 + 100 x4 <= 150
then the constraints/cuts in the output .lp file are:
c1: 35 x1 + 51 x2 + 67 x3 + 83 x4 <= 118
c2: 3 x2 + 4 x4 - x5 = 0
v0: x2 + x3 <= 1
i1: x3 + 0.25 x5 <= 1
The formulation with resulting constraints is no longer recognized as a MIP problem (CPLEX Error 3003: Not a mixed-integer problem.) Therefore, if one wants to make use of the resulting cuts, it is not directly achievable.
#CPLEXOptimizers#DecisionOptimization