Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm

DOI10.1080/02331934.2010.511674zbMath1233.91061OpenAlexW2023979472WikidataQ57664302 ScholiaQ57664302MaRDI QIDQ3225088

Stephan Dempe, Maria João Alves, Joaquim Joao Júdice

Publication date: 15 March 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2010.511674

zbMATH Keywords

mixed-integer programmingbi-level programmingmultiobjective

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Hierarchical games (including Stackelberg games) (91A65)

Related Items (9)

An algorithm based on particle swarm optimization for multiobjective bilevel linear problems ⋮ A new exact method for linear bilevel problems with multiple objective functions at the lower level ⋮ Military system of systems architecting with individual system contracts ⋮ Connections between single-level and bilevel multiobjective optimization ⋮ Solving discrete linear fractional bilevel programs with multiple objectives at the upper level ⋮ Global efficiency for multiobjective bilevel programming problems under generalized invexity ⋮ محاسبه مرز کارای مدل دوسطحی خطی چندهدفه ⋮ An efficient solution strategy for bilevel multiobjective optimization problems using multiobjective evolutionary algorithm ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Linear bilevel programming with upper level constraints depending on the lower level solution
• A note on the definition of a linear bilevel programming solution
• Solving bilevel linear programs using multiple objective linear programming
• A sequential LCP method for bilevel linear programming
• Connectedness of the efficient set of strictly quasiconcave sets
• Links between linear bilevel and mixed 0-1 programming problems
• A note on a decision support system for multiobjective integer and mixed-integer programming problems.
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
• A partial cooperation model for non-unique linear two-level decision problems
• Gap-free computation of Pareto-points by quadratic scalarizations
• Stackelberg solutions to multiobjective two-level linear programming problems
• Interactive balance space approach for solving multi-level multi-objective programming problems
• Solving the hazmat transport network design problem
• Model and interactive algorithm of bi-level multi-objective decision-making with multiple interconnected decision makers
• Adaptive Scalarization Methods in Multiobjective Optimization
• Interactive bilevel multi-objective decision making
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• An interactive weighted Tchebycheff procedure for multiple objective programming

This page was built for publication: Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm