A Lower Bounding Structure for Lot-Size Scheduling Problems

P. R. Kleindorfer and E. F. P. Newson
Additional contact information
P. R. Kleindorfer: University of Pennsylvania, Philadelphia, Pennsylvania
E. F. P. Newson: University of Western Ontario, London, Ontario

Operations Research, 1975, vol. 23, issue 2, 299-311

Abstract: This paper discusses efficient methods for determining optimal lower bounds (and concomitant dual variables) for lot-size problems of both fixed and variable capacity. The approach unifies lower bounding procedures for several common forms of the problem on the basis of generalized duality theory. Through the optimal (lower bounding) dual solution, a production plan can be generated that when “rounded” to feasibility may be optimal or near optimal for problems of appropriate configuration.

Date: 1975
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.2.299 (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:23:y:1975:i:2:p:299-311

Access Statistics for this article

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