A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems

A. A. Farley
Additional contact information
A. A. Farley: Monash University, Melbourne, Victoria, Australia

Operations Research, 1990, vol. 38, issue 5, 922-923

Abstract: In LP problems with an extremely large number of possible structural variables, solution to optimality is not always required. A bound can be used to terminate such LPs. Such a bound is presented for a class of problem that includes most cutting stock formulations.

Keywords: production/scheduling; cutting stock: cutting stock problems; programming; linear theory: bounding linear programming solutions (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.5.922 (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:38:y:1990:i:5:p:922-923

Access Statistics for this article

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