Dev A. Kakkad, Ignacio E. Grossmann, Bianca Springub, Christos Galanopoulos, Leonardo Salsano de Assis, Nga Tran, John M. Wassick
{"title":"Iterative MILP algorithm to find alternate solutions in linear programming models","authors":"Dev A. Kakkad, Ignacio E. Grossmann, Bianca Springub, Christos Galanopoulos, Leonardo Salsano de Assis, Nga Tran, John M. Wassick","doi":"10.1007/s11081-024-09887-3","DOIUrl":null,"url":null,"abstract":"<p>We address in this paper linear programming (LP) models in which it is desired to find a finite set of alternate optima. An LP may have multiple alternate solutions with the same objective value or with increasing objective values. For many real life applications, it can be interesting to have a pool of solutions to compare what operations should be executed and what is the cost/benefit of doing it. To obtain a specified number of these alternate solutions in the increasing order of objective values, we propose an iterative MILP algorithm in which we successively add integer cuts on inactive constraints. We demonstrate the application and effectiveness of this algorithm on a 2 dimensional LP and on small and large supply chain problems. The proposed iterative MILP algorithm provides an effective approach for finding a specified number of alternate optima in LP models, which provides a useful tool in a variety of applications as for instance in supply chain optimization problems.</p>","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"56 1","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization and Engineering","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s11081-024-09887-3","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
We address in this paper linear programming (LP) models in which it is desired to find a finite set of alternate optima. An LP may have multiple alternate solutions with the same objective value or with increasing objective values. For many real life applications, it can be interesting to have a pool of solutions to compare what operations should be executed and what is the cost/benefit of doing it. To obtain a specified number of these alternate solutions in the increasing order of objective values, we propose an iterative MILP algorithm in which we successively add integer cuts on inactive constraints. We demonstrate the application and effectiveness of this algorithm on a 2 dimensional LP and on small and large supply chain problems. The proposed iterative MILP algorithm provides an effective approach for finding a specified number of alternate optima in LP models, which provides a useful tool in a variety of applications as for instance in supply chain optimization problems.
期刊介绍：
Optimization and Engineering is a multidisciplinary journal; its primary goal is to promote the application of optimization methods in the general area of engineering sciences. We expect submissions to OPTE not only to make a significant optimization contribution but also to impact a specific engineering application.
Topics of Interest:
-Optimization: All methods and algorithms of mathematical optimization, including blackbox and derivative-free optimization, continuous optimization, discrete optimization, global optimization, linear and conic optimization, multiobjective optimization, PDE-constrained optimization & control, and stochastic optimization. Numerical and implementation issues, optimization software, benchmarking, and case studies.
-Engineering Sciences: Aerospace engineering, biomedical engineering, chemical & process engineering, civil, environmental, & architectural engineering, electrical engineering, financial engineering, geosciences, healthcare engineering, industrial & systems engineering, mechanical engineering & MDO, and robotics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
