Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Management Science and Engineering Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
