EconPapers    
Economics at your fingertips  
 

An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems

Abolfazl Gharaei (), Alireza Amjadian (), Ali Shavandi () and Amir Amjadian ()
Additional contact information
Abolfazl Gharaei: University of Toronto
Alireza Amjadian: Kharazmi University
Ali Shavandi: Sharif University of Technology
Amir Amjadian: Yazd University

Journal of Combinatorial Optimization, 2023, vol. 45, issue 2, No 24, 37 pages

Abstract: Abstract The Augmented Lagrangian method (ALM) is one of the algorithms in a class of methods for constrained optimization of nonlinear problems (NLP) that seeks a solution by replacing the original constrained problem using a sequence of unconstrained subproblems. Also known as the method of multipliers, the ALM approach introduces explicit Lagrangian multiplier estimates at each step. In this paper, an ALM is developed to solve the nonlinear models of the large-scale inventory systems. The proposed ALM is based on successive minimization of the augmented Lagrangian with respect to the possibly occurring between iterations. Our suggested approach is relatively easy to implement because the main computational operation at each iteration of NLP models is minimization of the smooth function to solve the bound-constrained subproblem. Accordingly, a large-scale NLP inventory system is designed and optimized using the ALM. The objectives are to simultaneously minimize the total inventory cost and maximize the total reliability in large-scale NLP inventory systems, while the constraints are satisfied. The results of numerical analyses, and performance comparison show that the proposed approach has satisfactory performance in terms of optimality criteria such as quality of solutions, complementarity, infeasibility, and optimality error.

Keywords: Lagrangian method; Nonlinear programming (NLP); Reliability; Economic order quantity (EOQ); Inventory management; Supply chain (SC) (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01002-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-01002-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01002-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:45:y:2023:i:2:d:10.1007_s10878-023-01002-z