IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v28y2020i1d10.1007_s10100-018-0593-0.html
   My bibliography  Save this article

Lagrangian relaxation of the generic materials and operations planning model

Author

Listed:
  • G. Rius-Sorolla

    (Universitat Politècnica de València)

  • J. Maheut

    (Universitat Politècnica de València)

  • Jairo R. Coronado-Hernandez

    (Universidad de la Costa)

  • J. P. Garcia-Sabater

    (Universitat Politècnica de València)

Abstract

The supply chain management requires increasingly proposals for the production programming planning that brings together its special singularities. Solving coexisting products and alternative processes or by-products must be allowed by the mathematical programming models. The generic materials and operations planning (GMOP) formulation allows operating with different materials and process lists. The paper presents a procedure to solve the versatile GMOP model by the Lagrange Relaxation. The subgradient update method of the lagrangian multiplier is compared with a linear update method. Obtaining lower bound faster compared to the linear method is allowed by the subgradient method, but the linear method provides better solutions after certain iterations.

Suggested Citation

  • G. Rius-Sorolla & J. Maheut & Jairo R. Coronado-Hernandez & J. P. Garcia-Sabater, 2020. "Lagrangian relaxation of the generic materials and operations planning model," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 105-123, March.
    • Handle: RePEc:spr:cejnor:v:28:y:2020:i:1:d:10.1007_s10100-018-0593-0
    DOI: 10.1007/s10100-018-0593-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-018-0593-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-018-0593-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
    2. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    3. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    4. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    5. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    6. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
    7. Walther, Grit & Schmid, Eberhard & Spengler, Thomas S., 2008. "Negotiation-based coordination in product recovery networks," International Journal of Production Economics, Elsevier, vol. 111(2), pages 334-350, February.
    8. James H. Lorie & Leonard J. Savage, 1955. "Three Problems in Rationing Capital," The Journal of Business, University of Chicago Press, vol. 28, pages 229-229.
    9. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    10. Zhang, Zhi-Hai & Jiang, Hai & Pan, Xunzhang, 2012. "A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain," International Journal of Production Economics, Elsevier, vol. 140(1), pages 249-255.
    11. C. Beltran & F. J. Heredia, 2002. "Unit Commitment by Augmented Lagrangian Relaxation: Testing Two Decomposition Approaches," Journal of Optimization Theory and Applications, Springer, vol. 112(2), pages 295-314, February.
    12. Jose P. Garcia-Sabater & Julien Maheut & Juan A. Marin-Garcia, 2013. "A new formulation technique to model materials and operations planning: the generic materials and operations planning (GMOP) problem," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(2), pages 119-147.
    13. Mao, Kun & Pan, Quan-ke & Pang, Xinfu & Chai, Tianyou, 2014. "A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process," European Journal of Operational Research, Elsevier, vol. 236(1), pages 51-60.
    14. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2009. "On solving the Lagrangian dual of integer programs via an incremental approach," Computational Optimization and Applications, Springer, vol. 44(1), pages 117-138, October.
    15. Roberto D. Galvão & Vladimir Marianov, 2011. "Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems," International Series in Operations Research & Management Science, in: H. A. Eiselt & Vladimir Marianov (ed.), Foundations of Location Analysis, chapter 0, pages 391-420, Springer.
    16. Marshall L. Fisher, 1985. "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, INFORMS, vol. 15(2), pages 10-21, April.
    17. Vidal-Carreras, Pilar I. & Garcia-Sabater, Jose P. & Coronado-Hernandez, Jairo R., 2012. "Economic lot scheduling with deliberated and controlled coproduction," European Journal of Operational Research, Elsevier, vol. 219(2), pages 396-404.
    18. X. Zhao & P. B. Luh & J. Wang, 1999. "Surrogate Gradient Algorithm for Lagrangian Relaxation," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 699-712, March.
    19. T. S. Chang, 2008. "Comments on “Surrogate Gradient Algorithm for Lagrangian Relaxation”," Journal of Optimization Theory and Applications, Springer, vol. 137(3), pages 691-697, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Singa Wang Chiu & Liang-Wei You & Tsu-Ming Yeh & Tiffany Chiu, 2020. "The Collective Influence of Component Commonality, Adjustable-Rate, Postponement, and Rework on Multi-Item Manufacturing Decision," Mathematics, MDPI, vol. 8(9), pages 1-18, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Igor Litvinchev & Socorro Rangel & Jania Saucedo, 2010. "A Lagrangian bound for many-to-many assignment problems," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 241-257, April.
    2. G. Rius-Sorolla & J. Maheut & S. Estellés-Miguel & J. P. Garcia-Sabater, 2020. "Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 61-104, March.
    3. Gregorio Rius-Sorolla & Julien Maheut & Sofia Estelles-Miguel & Jose P. Garcia-Sabater, 2021. "Collaborative Distributed Planning with Asymmetric Information. A Technological Driver for Sustainable Development," Sustainability, MDPI, vol. 13(12), pages 1-23, June.
    4. Steeger, Gregory & Rebennack, Steffen, 2017. "Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem," European Journal of Operational Research, Elsevier, vol. 257(2), pages 669-686.
    5. Ahmadi-Javid, Amir & Hoseinpour, Pooya, 2015. "A location-inventory-pricing model in a supply chain distribution network with price-sensitive demands and inventory-capacity constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 238-255.
    6. Fatemeh Keshavarz-Ghorbani & Seyed Hamid Reza Pasandideh, 2022. "A Lagrangian relaxation algorithm for optimizing a bi-objective agro-supply chain model considering CO2 emissions," Annals of Operations Research, Springer, vol. 314(2), pages 497-527, July.
    7. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    8. Yanling Chu & Xiaoju Zhang & Zhongzhen Yang, 2017. "Multiple quay cranes scheduling for double cycling in container terminals," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-19, July.
    9. Kelley, Morgan T. & Pattison, Richard C. & Baldick, Ross & Baldea, Michael, 2018. "An MILP framework for optimizing demand response operation of air separation units," Applied Energy, Elsevier, vol. 222(C), pages 951-966.
    10. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    11. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    12. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Ekşioğlu, Sandra D. & Castillo-Villar, Krystel K., 2021. "Designing a reliable electric vehicle charging station expansion under uncertainty," International Journal of Production Economics, Elsevier, vol. 236(C).
    13. S S Chauhan & J-M Proth & A M Sarmiento & R Nagi, 2006. "Opportunistic supply chain formation from qualified partners for a new market demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1089-1099, September.
    14. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    15. Letchford, Adam N. & Salazar-González, Juan-José, 2019. "The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time," European Journal of Operational Research, Elsevier, vol. 272(1), pages 24-31.
    16. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    17. Miguel A. Lejeune & John Turner, 2019. "Planning Online Advertising Using Gini Indices," Operations Research, INFORMS, vol. 67(5), pages 1222-1245, September.
    18. Albrecht, Martin & Stadtler, Hartmut, 2015. "Coordinating decentralized linear programs by exchange of primal information," European Journal of Operational Research, Elsevier, vol. 247(3), pages 788-796.
    19. Zhang, Zhi-Hai & Jiang, Hai & Pan, Xunzhang, 2012. "A Lagrangian relaxation based approach for the capacitated lot sizing problem in closed-loop supply chain," International Journal of Production Economics, Elsevier, vol. 140(1), pages 249-255.
    20. Barbarosoglu, Gulay & Ozgur, Demet, 1999. "Hierarchical design of an integrated production and 2-echelon distribution system," European Journal of Operational Research, Elsevier, vol. 118(3), pages 464-484, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:28:y:2020:i:1:d:10.1007_s10100-018-0593-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.