Polynomial Algorithms for the Lot-Sizing Problem

Author

Mark A. Copeland, Clemson University

Date of Award

12-1989

Document Type

Thesis

Degree Name

Master of Science (MS)

Legacy Department

Mathematical Science

Abstract

The simple inventory model or lot-sizing problem may be formulated as a special case of the simple plant location problem. This paper examines two dual based algorithms that have been developed for the simple plant location problem and applies these procedures to the lot-sizing problem. Each algorithm yields an integer optimal solution in a polynomial number of computations.

Recommended Citation

Copeland, Mark A., "Polynomial Algorithms for the Lot-Sizing Problem" (1989). Archived Theses. 229.
https://open.clemson.edu/arv_theses/229