Abstract
dc:description.abstractThe 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematical Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Copeland, Mark A.
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/arv_theses/229