Back to search

Clemson University

Polynomial Algorithms for the Lot-Sizing Problem

Abstract

dc:description.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.

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

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Copeland, Mark A.. Polynomial Algorithms for the Lot-Sizing Problem. Thesis thesis, https://open.clemson.edu/arv_theses/229