The Caterer Problem

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²).