caterer problem

caterer problem

[′kād·ə·rər ‚präb·ləm]
(mathematics)
A linear programming problem in which it is required to find the optimal policy for a caterer who must choose between buying new napkins and sending them to either a fast or a slow laundry service.