Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Survey on Lagrangian Relaxation for MILP: Importance, Challenges, Historical Review, Recent Advancements, and Opportunities (2301.00573v4)

Published 2 Jan 2023 in math.OC, cs.DC, cs.DM, cs.SY, eess.SY, and math.CO

Abstract: Operations in areas of importance to society are frequently modeled as Mixed-Integer Linear Programming (MILP) problems. While MILP problems suffer from combinatorial complexity, Lagrangian Relaxation has been a beacon of hope to resolve the associated difficulties through decomposition. Due to the non-smooth nature of Lagrangian dual functions, the coordination aspect of the method has posed serious challenges. This paper presents several significant historical milestones (beginning with Polyak's pioneering work in 1967) toward improving Lagrangian Relaxation coordination through improved optimization of non-smooth functionals. Finally, this paper presents the most recent developments in Lagrangian Relaxation for fast resolution of MILP problems. The paper also briefly discusses the opportunities that Lagrangian Relaxation can provide at this point in time.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (69)
  1. Optimization in multimodal freight transportation problems: A survey. European Journal of Operational Research 299(1), 1–20.
  2. The vehicle sharing and task allocation problem: Milp formulation and a heuristic solution approach. Computers & Operations Research 147, 105929.
  3. Milp-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem. Computers & Operations Research 146, 105862.
  4. Distributionally robust facility location problem under decision-dependent stochastic demand. European Journal of Operational Research 292(2), 548–561.
  5. A scalable solution methodology for mixed-integer linear programming problems arising in automation. IEEE Transactions on Automation Science and Engineering 16(2), 531–541.
  6. Convergence of the surrogate lagrangian relaxation method. Journal of Optimization Theory and Applications 164(1), 173–201.
  7. Bragin, M. A. and E. L. Tucker (2022). Surrogate “level-based” lagrangian relaxation for mixed-integer linear programming. Scientific Reports 22(1), 1–12.
  8. Distributed and asynchronous coordination of a mixed-integer linear system via surrogate lagrangian relaxation. IEEE Transactions on Automation Science and Engineering 18(3), 1191–1205.
  9. Stochastic programming for qualification management of parallel machines in semiconductor manufacturing. Computers & Operations Research 79, 49–59.
  10. A superlinearly convergent subgradient method for sharp semismooth problems. arXiv preprint arXiv:2201.04611.
  11. A high performance computing based market economics driven neighborhood search and polishing algorithm for security constrained unit commitment. IEEE Transactions on Power Systems 36(1), 292–302.
  12. A distributed framework for solving and benchmarking security constrained unit commitment with warm start. IEEE Transactions on Power Systems 35(1), 711–720.
  13. Exceptional paper—location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management science 23(8), 789–810.
  14. Czerwinski, C. S. and P. B. Luh (1994). Scheduling products with bills of materials using an improved lagrangian relaxation technique. IEEE Transactions on Robotics and Automation 10(2), 99–111.
  15. The lagrangian relaxation approach for home health care problems. In International Conference on Soft Computing and Pattern Recognition, pp.  333–344. Springer.
  16. Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems. European Journal of Operational Research 303(1), 337–353.
  17. Erlenkotter, D. (1978). A dual-based procedure for uncapacitated facility location. Operations Research 26(6), 992–1009.
  18. Fisher, M. L. (1973). Optimal solution of scheduling problems using lagrange multipliers: Part i. Operations Research 21(5), 1114–1127.
  19. Fisher, M. L. (1976). A dual algorithm for the one-machine scheduling problem. Mathematical programming 11(1), 229–251.
  20. Fisher, M. L. (1981). The lagrangian relaxation method for solving integer programming problems. Management science 27(1), 1–18.
  21. Fisher, M. L. (1985). An applications oriented guide to lagrangian relaxation. Interfaces 15(2), 10–21.
  22. Fisher, M. L. and J. F. Shapiro (1974). Constructive duality in integer programming. SIAM Journal on Applied Mathematics 27(1), 31–52.
  23. The machine learning for combinatorial optimization competition (ml4co): Results and insights. In NeurIPS 2021 Competitions and Demonstrations Track, pp. 220–231. PMLR.
  24. Event-based milp models for ridepooling applications. European Journal of Operational Research 301(3), 1048–1063.
  25. Geoffrion, A. (1974). Lagrangian relaxation for integer programming. Mathematical Programming Study 2, 82–114.
  26. An exact approach for the multi-depot electric bus scheduling problem with time windows. European Journal of Operational Research 306(1), 189–206.
  27. Goffin, J.-L. (1977). On convergence rates of subgradient optimization methods. Mathematical programming 13(1), 329–347.
  28. Goffin, J.-L. and K. C. Kiwiel (1999). Convergence of a simple subgradient level method. Mathematical Programming 85(1), 207–211.
  29. Nonlinear approximation method in lagrangian relaxation-based algorithms for hydrothermal scheduling. IEEE Transactions on Power Systems 10(2), 772–778.
  30. Robust design of blood supply chains under risk of disruptions using lagrangian relaxation. Transportation Research Part E: Logistics and Transportation Review 134, 101764.
  31. Held, M. and R. M. Karp (1970). The traveling-salesman problem and minimum spanning trees. Operations Research 18(6), 1138–1162.
  32. Held, M. and R. M. Karp (1971). The traveling-salesman problem and minimum spanning trees: Part ii. Mathematical programming 1(1), 6–25.
  33. Admission control in queue-time loop production-mixed integer programming with lagrangian relaxation (miplar). Computers & Industrial Engineering 129, 417–425.
  34. Cost-sharing mechanism design for ride-sharing. Transportation Research Part B: Methodological 150, 410–434.
  35. Plant factory crop scheduling considering volume, yield changes and multi-period harvests using lagrangian relaxation. Biosystems Engineering 200, 328–337.
  36. Learning to resolve conflicts for multi-agent path finding with conflict-based search. Proceedings of the AAAI Conference on Artificial Intelligence 35(13), 11246–11253.
  37. A robust integrated logistics model for age-based multi-group platelets in disaster relief operations. Transportation Research Part E: Logistics and Transportation Review 152, 102371.
  38. Kaskavelis, C. A. and M. C. Caramanis (1998). Efficient lagrangian relaxation algorithms for industry size job-shop scheduling problems. IIE transactions 30(11), 1085–1097.
  39. Improving access to housing and supportive services for runaway and homeless youth: Reducing vulnerability to human trafficking in new york city. IISE Transactions, 1–15.
  40. A new model for operating room scheduling with elective patient strategy. INFOR: Information Systems and Operational Research 59(2), 309–332.
  41. Temporal decomposition for improved unit commitment in power system production cost modeling. IEEE Transactions on Power Systems 33(5), 5276–5287.
  42. Lagrangian dual decomposition for the ambulance relocation and routing considering stochastic demand with the truncated poisson. Transportation research part B: methodological 157, 1–23.
  43. Multi-stage robust transmission constrained unit commitment: A decomposition framework with implicit decision rules. International Journal of Electrical Power & Energy Systems 108, 372–381.
  44. Robust transmission constrained unit commitment: a column merging method. IET Generation, Transmission & Distribution 14(15), 2968–2975.
  45. A novel integer linear programming formulation for job-shop scheduling problems. IEEE Robotics and Automation Letters 6(3), 5937–5944.
  46. Ant colony optimization for path planning in search and rescue operations. European Journal of Operational Research 305(1), 53–63.
  47. A heuristic approach to an interdependent restoration planning and crew routing problem. Computers & Industrial Engineering 161, 107626.
  48. Muckstadt, J. A. and S. A. Koenig (1977). An application of lagrangian relaxation to scheduling in power-generation systems. Operations research 25(3), 387–403.
  49. Nedic, A. and D. P. Bertsekas (2001). Incremental subgradient methods for nondifferentiable optimization. SIAM Journal on Optimization 12(1), 109–138.
  50. Balancing and scheduling assembly lines with human-robot collaboration tasks. Computers & Operations Research 140, 105674.
  51. Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. Computers & Operations Research 138, 105616.
  52. Polyak, B. T. (1967). A general method for solving extremal problems. Doklady Akademii Nauk 174(1), 33–36.
  53. Polyak, B. T. (1969). Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics 9(3), 14–29.
  54. Physician shift scheduling to improve patient safety and patient flow in the emergency department. In 2021 Winter Simulation Conference (WSC), pp.  1–12. IEEE.
  55. Multi-period green reverse logistics network design: An improved benders-decomposition-based heuristic approach. European Journal of Operational Research 303(2), 735–752.
  56. Schmidt, A. and L. A. Albert (2023). The drop box location problem. IISE Transactions (just-accepted), 1–24.
  57. Shapiro, J. F. (1971). Generalized lagrange multipliers in integer programming. Operations Research 19(1), 68–76.
  58. A distributionally robust optimization approach for outpatient colonoscopy scheduling. European Journal of Operational Research 283(2), 549–561.
  59. Shehadeh, K. S. and E. L. Tucker (2022). Stochastic optimization models for location and inventory prepositioning of disaster relief supplies. Transportation Research Part C: Emerging Technologies 144, 103871.
  60. Shepardson, F. and R. E. Marsten (1980). A lagrangean relaxation algorithm for the two duty period scheduling problem. Management Science 26(3), 274–281.
  61. Optimized oral cholera vaccine distribution strategies to minimize disease incidence: A mixed integer programming model and analysis of a bangladesh scenario. Vaccine 33(46), 6218–6223.
  62. Mixed-integer linear programming for scheduling unconventional oil field development. Optimization and Engineering 22(3), 1459–1489.
  63. Tsang, M. Y. and K. S. Shehadeh (2023). Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times. European Journal of Operational Research 307(1), 48–63.
  64. Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley. European Journal of Operational Research 291(3), 935–943.
  65. An exact and scalable problem decomposition for security-constrained optimal power flow. Electric Power Systems Research 195, 106677.
  66. Yalaoui, F. and N. Q. Nguyen (2021). Identical machine scheduling problem with sequence-dependent setup times: Milp formulations computational study. American Journal of Operations Research 11(1), 15–34.
  67. New bundle methods for solving lagrangian relaxation dual problems. Journal of Optimization Theory and Applications 113(2), 373–397.
  68. Surrogate gradient algorithm for lagrangian relaxation. Journal of optimization Theory and Applications 100(3), 699–712.
  69. Design and analysis of a satellite network with direct delivery in the pharmaceutical industry. Transportation Research Part E: Logistics and Transportation Review 116, 190–207.
Citations (9)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now