Application of Quasi-Integer Programming to the Solution of Menu Planning Problems with Variable Portion Size

Ronald D. Armstrong and Prabhakant Sinha
Additional contact information
Ronald D. Armstrong: University of Massachusetts
Prabhakant Sinha: University of Massachusetts

Management Science, 1974, vol. 21, issue 4, 474-482

Abstract: This paper presents the application of a modified mixed-integer programming algorithm to plan menus in which the portion size of the menu items can vary over a specified positive range. Previous mathematical programming formulations of menu planning problems have either required the variables representing menu items to be bivalent, or have formulated the problem with food groups as decision variables and no integer requirements at all. The former gives rise to a zero-one programming problem and the latter to a "feed-mix" problem. In many instances, a more realistic formulation would require that if a menu item is offered, its portion size must be between a specified upper and lower bound. Although this paper addresses itself chiefly to menu planning, it is readily seen that problems in capital budgeting may be tractable with a similar formulation. It is shown how a branch-and-bound algorithm for mixed-integer programming of the type proposed by Beale and Tomlin can be modified to solve the quasi-integer programming problem resulting from a variable portion size formulation of menu planning problems.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.4.474 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:21:y:1974:i:4:p:474-482

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().