Two-Level Linear Programming

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.

• 저널Management Science · 30(8) · 1004–1020
• 토픽Optimization and Variational Analysis · Computational Theory and Mathematics
• DOI10.1287/mnsc.30.8.1004
• 저자Wayne F. Bialas, Mark H. Karwan