Linear Bi-level Programming Problems - A Review

Multi-level programming is characterized as mathematical programming to solve decentralized planning problems. The decision variables are partitioned among ordered levels. A decision-maker at one level of the hierarchy may have his own objective function and decision space, but may be influenced by...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society Vol. 42; no. 2; pp. 125 - 133
Main Authors: Wen, Ue-Pyng, Hsu, Shuh-Tzy
Format: Journal Article
Language:English
Published: London Taylor & Francis 01.02.1991
Palgrave Macmillan UK
Subjects:
bi-level programming
Business and Management
decentralized planning
decision-making
Management
Operations Research/Decision Theory
Review Paper
bi-level programming
decision-making
decentralized planning
ISSN:0160-5682, 1476-9360
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multi-level programming is characterized as mathematical programming to solve decentralized planning problems. The decision variables are partitioned among ordered levels. A decision-maker at one level of the hierarchy may have his own objective function and decision space, but may be influenced by other levels. During the last 10 years, a special case of the multi-level programming problem, the linear bi-level programming (BLP) problem, has been studied with increasing interest in the area of mathematical programming problems. This paper attempts to review the literature on the linear BLP problems. It presents the basic models and the characterizations of the problem, the areas for application, the existing solution approaches, and the related models and areas for further research.
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.1991.23