IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v30y1984i8p1004-1020.html
   My bibliography  Save this article

Two-Level Linear Programming

Author

Listed:
  • 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)

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.

Suggested Citation

  • Wayne F. Bialas & Mark H. Karwan, 1984. "Two-Level Linear Programming," Management Science, INFORMS, vol. 30(8), pages 1004-1020, August.
  • Handle: RePEc:inm:ormnsc:v:30:y:1984:i:8:p:1004-1020
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.30.8.1004
    Download Restriction: no

    References listed on IDEAS

    as
    1. Ian I. Mitroff, 1972. "The Myth of Objectivity OR Why Science Needs a New Psychology of Science," Management Science, INFORMS, vol. 18(10), pages 613-618, June.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    programming: linear; algorithms;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:8:p:1004-1020. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.