Timeline for Finding lower bound (maximization problem) in Lagrangian Relaxation with subgradient method
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 15, 2023 at 11:30 | comment | added | ABDE | Thank you for your explanation and the book reference you provided, I think the book highlighted at the end of section 10.4 the confusion that I found in the literature, basically for problem-related to SCND with MILP problems, usually the upper bound is found by using information solution of the relaxed problem, i.e fixing some optimal decision variable and solve the original problem which may provide an upper bound with less CPU time for large scale problem, if the problem is small then solving the original problem directly would not be cumbersome. | |
| Aug 14, 2023 at 16:00 | history | answered | RobPratt | CC BY-SA 4.0 |