Solving bilevel linear programs using multiple objective linear programming
From MaRDI portal
Publication:1016404
DOI10.1007/s10957-008-9467-2zbMath1163.90020OpenAlexW2136118765MaRDI QIDQ1016404
J. Glackin, J. G. Ecker, Michael Kupferschmid
Publication date: 5 May 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9467-2
efficient setbilevel linear programmingmultiple objective linear programmingrational reaction setsimplex algorithm pivot
Related Items
Multilevel decision-making: a survey, A multiple objective programming approach to linear bilevel multi-follower programming, A projection and contraction method with adaptive step sizes for solving bilevel pseudo-monotone variational inequality problems, Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm, An inertial projection and contraction method for solving bilevel quasimonotone variational inequality problems, Connections between single-level and bilevel multiobjective optimization, A strong convergence of modified subgradient extragradient method for solving bilevel pseudomonotone variational inequality problems, Relaxed single projection methods for solving bilevel variational inequality problems in Hilbert spaces, An evolutionary algorithm for solving bilevel programming problems using duality conditions, A projection method for bilevel variational inequalities, Strong convergence theorem for the lexicographic Ky Fan inequality, A Cutting Plane Approach for Solving Linear Bilevel Programming Problems, Strong convergence of extragradient methods for solving bilevel pseudo-monotone variational inequality problems, Solving bilevel linear programs using multiple objective linear programming, Algorithms for Linear Bilevel Optimization, Global Search for Bilevel Optimization with Quadratic Data, BOLIB: Bilevel Optimization LIBrary of Test Problems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- Multicriteria approach to bilevel optimization
- Solving bilevel linear programs using multiple objective linear programming
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Existence of optimal solutions to mathematical programs with equilibrium constraints
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- A sequential LCP method for bilevel linear programming
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimizing a linear function over an efficient set
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- A note on the Pareto optimality of solutions to the linear bilevel programming problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On Computing an Initial Efficient Extreme Point
- Finding all efficient extreme points for multiple objective linear programs
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Algorithms for the vector maximization problem
- Classification model selection via bilevel programming
- A solution method for the linear static Stackelberg problem using penalty functions
- Benchmarking optimization software with performance profiles.
