A Mathematical Programming System for Preference and Compatibility Maximized Menu Planning and Scheduling, Mathematical Programming
In this paper, the analytical representation of food preference is used in a separable non-linear program to yield the serving frequencies of menu items for a finite time horizon. The frequencies obtained in this way insure cost and nutritional control. Subsequently, the scheduling problem dealing with item assignments to meals and days is formulated as an integer program consisting of several transportation problems linked by weekly nutritional constraints. This problem is solved using a branch and bound algorithm which employs Lagrangian relaxation to obtain bounds and to decide on branching strategy.
Prabhakant Sinha, Andris Zoltners
Sinha, Prabhakant, and Andris Zoltners. 1978. A Mathematical Programming System for Preference and Compatibility Maximized Menu Planning and Scheduling. Mathematical Programming. 15(1): 63-76.