IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v21y1974i4p474-482.html
   My bibliography  Save this article

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

Author

Listed:
  • Ronald D. Armstrong

    (University of Massachusetts)

  • Prabhakant Sinha

    (University of Massachusetts)

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.

Suggested Citation

  • Ronald D. Armstrong & Prabhakant Sinha, 1974. "Application of Quasi-Integer Programming to the Solution of Menu Planning Problems with Variable Portion Size," Management Science, INFORMS, vol. 21(4), pages 474-482, December.
    • Handle: RePEc:inm:ormnsc:v:21:y:1974:i:4:p:474-482
    DOI: 10.1287/mnsc.21.4.474
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.21.4.474
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.21.4.474?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:21:y:1974:i:4:p:474-482. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.