Two-Level Linear Programming

Wayne F. Bialas and Mark H. Karwan
Additional contact information
Wayne F. Bialas: Department of Civil Engineering, MIT, Cambridge, Massachusetts 02139
Mark H. Karwan: Department of Industrial Engineering, State University of New York, Buffalo, New York 14260

Management Science, 1984, vol. 30, issue 8, 1004-1020

Abstract: Decentralized planning has long been recognized as an important decision making problem. Many approaches based on the concepts of large-scale system decomposition have generally lacked the ability to model the type of truly independent subsystems which often exist in practice. Multilevel programming models partition control over decision variables among ordered levels within a hierarchical planning structure. A planner at one level of the hierarchy may have his objective function and set of feasible decisions determined, in part, by other levels. However, his control instruments may allow him to influence the policies at other levels and thereby improve his own objective function. This paper examines the special case of the two-level linear programming problem. Geometric characterizations and algorithms are presented with some examples. The goal is to demonstrate the tractability of such problems and motivate a wider interest in their study.

Keywords: programming: linear; algorithms (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (57)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.30.8.1004 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:30:y:1984:i:8:p:1004-1020

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().