Accession Number : AD0764629

Title :   A Multistage Scheduling Algorithm for Preference Maximized Selective and Nonselective Menus.

Descriptive Note : Technical rept.,

Corporate Author : MASSACHUSETTS UNIV AMHERST

Personal Author(s) : Armstrong,Ronald D. ; Balintfy,Joseph L. ; Sinha,Prabhakant

Report Date : JUL 1973

Pagination or Media Count : 44

Abstract : The paper presents an algorithm for the constrained scheduling of selective and non-selective menus over a finite time horizon for an individual or a population. A preference-maximizing approach is employed to generate choicegroups. This permits the formulation of the menu planning problem for each stage as an integer program for the non-selective case, and as a stochastic integer program for the selective case. The solution of the matematical program yields the set of menu items to be offered on the particular day. This solution is used to update the preferences of the population in order to formulate the objective function for the next day. The stochastic integer programming formulation permits control over the marginal probability of satisfying each constraint or a joint probability of satisfying all the constraints. Sales estimates of menu items on the schedule for a selective menu are obtained as a byproduct. Sample problems covering the range of options of the algorithm are presented. (Author)

Descriptors :   (*DECISION THEORY, FOOD), (*DIET, *SCHEDULING), MATHEMATICAL PROGRAMMING, MATRICES(MATHEMATICS), STOCHASTIC PROCESSES, SELECTION, OPTIMIZATION, ALGORITHMS

Subject Categories : Food, Food Service and Nutrition
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE