Benders decomposition for bi-objective linear programs

DOI10.1016/J.EJOR.2024.09.004MaRDI QIDQ6982084zbMATH OpenFDO

Authors Andrea Raith, Richard M. Lusby, Ali Akbar Sohrabi Yousefkhan

Publication date 19 May 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.09.004

zbMATH Keywords

Benders decompositionbi-objective optimisationbi-objective parametric simplex algorithmlinear programmingmultiple objective programming

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Extreme-point and pivoting methods (90C49)

Cites work

• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling
• A parametric simplex algorithm for linear vector optimization problems
• A revised simplex method for linear multiple objective programs
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
• An exact column generation-based algorithm for bi-objective vehicle routing problems
• Benders decomposition for production routing under demand uncertainty
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• Bicriteria Transportation Problem
• Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
• Column generation for bi-objective vehicle routing problems with a MIN-MAX objective
• Covering linear programming with violations
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
• Fixed-charge transportation problem: facets of the projection polyhedron
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• Improving the integer L-shaped method
• Multicriteria Optimization
• Partitioning procedures for solving mixed-variables programming problems
• Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem

Cited in

(1)

• Decision space decomposition for multiobjective optimization

This page was built for publication: Benders decomposition for bi-objective linear programs

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