IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v28y1980i6p1450-1453.html
   My bibliography  Save this article

Technical Note—Improved Bounds for Aggregated Linear Programs

Author

Listed:
  • Roy Mendelssohn

    (University of California, Santa Cruz, California)

Abstract

A method of Kallio for improving bounds on the optimal value of a linear program calculated from an intermediate iteration is used to improve Zipkin's bounds for an aggregated linear program. Both theoretical and computational results are given, demonstrating the improvement due to these new bounds.

Suggested Citation

  • Roy Mendelssohn, 1980. "Technical Note—Improved Bounds for Aggregated Linear Programs," Operations Research, INFORMS, vol. 28(6), pages 1450-1453, December.
    • Handle: RePEc:inm:oropre:v:28:y:1980:i:6:p:1450-1453
    DOI: 10.1287/opre.28.6.1450
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.28.6.1450
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.28.6.1450?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Thomas W.M. Vossen & Fan You & Dan Zhang, 2022. "Finite‐horizon approximate linear programs for capacity allocation over a rolling horizon," Production and Operations Management, Production and Operations Management Society, vol. 31(5), pages 2127-2142, May.
    2. Young Woong Park, 2021. "Optimization for L 1 -Norm Error Fitting via Data Aggregation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 120-142, January.

    More about this item

    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:oropre:v:28:y:1980:i:6:p:1450-1453. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.