Variants of multi-index caterer problem

ABSTRACT

This paper addresses the caterer problem, which deals with finding the optimal policy for caterers who choose between purchasing new napkins or laundry using either express or regular laundry service. Multi-index caterer problem deals with the need for laundry or the purchase of different types of napkins daily. This paper presents a formulation of a multi-index caterer problem into a multi-index transportation problem with axial constraints by adding a source, a destination, and a commodity to the original problem and providing its solution method. The solution method for the cases, when the total number of required napkins are impaired or enhanced to a known flow, for a given caterer problem are also studied by formulating the given problems into three-dimensional transportation problem with axial constraints as introduced by Haley (1963). The formulation of various problems and their solution procedures are explained with the help of numerical examples and the equivalency of corresponding formulations is also proved. Various test problems are solved with the help of GAMS software.

KEYWORDS:

• Caterer problem
• multi-index
• transportation problem
• impaired flow
• enhanced flow

Disclosure statement

No potential conflict of interest was reported by the author(s).