Iterative MILP algorithm to find alternate solutions in linear programming models

DOI10.1007/S11081-024-09887-3MaRDI QIDQ7031012zbMATH OpenFDO

Authors Dev A. Kakkad, Ignacio E. Grossmann, Bianca Springub, Christos Galanopoulos, Leonardo Salsano de Assis, Nga Tran, John M. Wassick

Publication date 7 February 2025

Published in Optimization and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11081-024-09887-3

zbMATH Keywords

linear programmingmixed integer linear programmingalternate optimasupply chain network

Mathematics Subject Classification ID

Linear programming (90C05) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites work

• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3856810 (Why is no real title available?)
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• A new polynomial-time algorithm for linear programming
• Finding the convex hull facet by facet
• Linear and nonlinear programming.
• Management models and industrial applications of linear programming
• Pyomo -- optimization modeling in Python

This page was built for publication: Iterative MILP algorithm to find alternate solutions in linear programming models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031012)