The Caterer Problem

Wlodzimierz Szwarc and Marc E. Posner
Additional contact information
Wlodzimierz Szwarc: University of Wisconsin, Milwaukee, Wisconsin
Marc E. Posner: New York University, New York, New York

Operations Research, 1985, vol. 33, issue 6, 1215-1224

Abstract: This paper develops a one-pass transportation solution that solves the Caterer Problem with a fixed number of new napkins. It provides conditions for determining when this solution can be improved by changing the number of purchased napkins. This approach leads to a simple method of solving the Caterer Problem by treating the fixed case as a parametric programming problem. The procedure is 0( n 2 ).

Keywords: 355 equipment maintenance; 637 transportation algorithm; 639 parametric analysis (search for similar items in EconPapers)
Date: 1985
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.33.6.1215 (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:33:y:1985:i:6:p:1215-1224

Access Statistics for this article

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