Technical Note—Improved Bounds for Aggregated Linear Programs

Roy Mendelssohn
Additional contact information
Roy Mendelssohn: University of California, Santa Cruz, California

Operations Research, 1980, vol. 28, issue 6, 1450-1453

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.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.6.1450 (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:oropre:v:28:y:1980:i:6:p:1450-1453

Access Statistics for this article

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