Originally posted by: SifengLin
I developed some effective user cuts to improve the upper bound ( for my maximization problem) considerably. But it is disappointing that the feasible solutions found by the strengthened formulation are not as good as the original formulation. Do anyone have any leads on this?
My problem is a multi-commodity network flow problem, with some type of shared constraints between commodities. Almost all of the constraints and cuts are in the form of
x1+x2+...+xn<=1.
My suspicion is that the strengthened formulation makes the x variables more "fractional". For example, in one instance number of infeasible( fractional) variables raises from around 2000 to more than 4000. Is this because more "fractional" solutions somehow make CPELX heuristics ( e.g., rounding heuristics and local improvement heuristics) less effective?
Is there any systematic study on this topic?
Thanks.
#CPLEXOptimizers#DecisionOptimization