Solving Quasiconcave Bilevel Programming Problem
Open Access
- 1 January 2017
- journal article
- Published by Scientific Research Publishing, Inc. in American Journal of Operations Research
- Vol. 07 (02), 121-132
- https://doi.org/10.4236/ajor.2017.72009
Abstract
In this paper, we find the solution of a quasiconcave bilevel programming problem (QCBPP). After formulating a Bilevel Multiobjective Programming Problem (BMPP), we characterize its leader objective function and its feasible set. We show some necessary and sufficient conditions to establish a convex union of set of efficient point, an efficient set at the QCBPP. Based on this result, we formulate and solve a new QCBPP. Finally, we illustrate our approach with a numerical example.Keywords
This publication has 1 reference indexed in Scilit:
- Proper efficiency and the theory of vector maximizationJournal of Mathematical Analysis and Applications, 1968