A note on efficient solutions for the linear bilevel programming problem

Soismaa M (1999). A note on efficient solutions for the linear bilevel programming problem. European Journal of Operational Research 112 (2): 427-431. DOI:10.1016/S0377-2217(97)00405-0.

Full text not available from this repository.

Abstract

The solutions of linear bilevel programming problems frequently are non-Pareto-optimal. The potential increase in payoffs generated by Pareto improvements makes it worthwhile to consider methods with which to move the solution to the efficient frontier. Bargaining models offer one class of solutions, which, contrary to the original non-cooperative, sequential decision-making situation, however, assume cooperation. We make an attempt to maintain the original power structure by introducing the asymmetric Nash bargaining solution.

Item Type: Article
Uncontrolled Keywords: Bilevel programming; Decision theory; Efficient solution; Bargaining
Research Programs: Decision Analysis and Support (DAS)
Bibliographic Reference: European Journal of Operational Research; 112(2):427-431 [1999]
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 02:10
Last Modified: 29 Sep 2016 10:03
URI: http://pure.iiasa.ac.at/5690

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313