Logo Logo

A Mathematical Programming System for Preference and Compatibility Maximized Menu Planning and Scheduling, Mathematical Programming

Abstract

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.

Type

Article

Author(s)

Prabhakant Sinha, Andris Zoltners

Date Published

1978

Citations

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.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more