Solving Bilevel Linear Multiobjective Programming Problems
Open Access
- 1 January 2011
- journal article
- Published by Scientific Research Publishing, Inc. in American Journal of Operations Research
- Vol. 01 (04), 214-219
- https://doi.org/10.4236/ajor.2011.14024
Abstract
This study addresses bilevel linear multi-objective problem issues i.e the special case of bilevel linear programming problems where each decision maker has several objective functions conflicting with each other. We introduce an artificial multi-objective linear programming problem of which resolution can permit to generate the whole feasible set of the upper level decisions. Based on this result and depending if the leader can evaluate or not his preferences for his different objective functions, two approaches for obtaining Pareto- optimal solutions are presentedKeywords
This publication has 10 references indexed in Scilit:
- Multiobjective bilevel optimizationMathematical Programming, 2008
- An approach for finding efficient points in multiobjective linear programmingJournal of Information and Optimization Sciences, 2008
- An overview of bilevel optimizationAnnals of Operations Research, 2007
- Smart Pareto filter: obtaining a minimal representation of multiobjective design spaceEngineering Optimization, 2004
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage ErrorsOperations Research, 2003
- Multiobjective bilevel optimization for transportation planning and management problemsJournal of Advanced Transportation, 2002
- Optimization over the efficient set: overviewJournal of Global Optimization, 2002
- Generating Well-Distributed Sets of Pareto Points for Engineering Design Using Physical ProgrammingOptimization and Engineering, 2002
- Stackelberg Solutions to Multiobjective Two-Level Linear Programming ProblemsJournal of Optimization Theory and Applications, 1999
- An all-linear programming relaxation algorithm for optimizing over the efficient setJournal of Global Optimization, 1991