Skip to main content
SpringerLink
Log in

A mathematical programming system for preference and compatibility maximized menu planning and scheduling

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.D. Armstrong and P. Sinha, “The cyclic separation scheduling problem”,Naval Research Logistics Quarterly 24 (1977) 609–618.

    Google Scholar 

  2. J.L. Balintfy, “Large scale programming properties of menu planning and scheduling”, in: R.W. Cottle and J. Karp, eds.,Optimization methods for resource allocations (English Universities Press, 1976) pp. 81–97.

  3. J.L. Balintfy, “Menu planning by computer”,The Communications of ACM 7 (1964) 255–259.

    Google Scholar 

  4. J.L. Balintfy, System/360 Computer Assisted Menu Planning, IBM Contributed Program Library, 360D-15.2.013, IBM Corporation PID, Hawthorne, New York, 1969.

    Google Scholar 

  5. J.L. Balintfy, “Applications of mathematical programming to optimize human diets”, in:Symposia Mathematica XIX, ed. INDAM (Rome) (Academic Press, 1976) pp. 313–340.

  6. J.L. Balintfy, W.J. Duffy and P. Sinha, “Modeling food preferences over time”,Operations Research 22 (1974) 711–727.

    Google Scholar 

  7. J.L. Balintfy, J. Neter and W. Wasserman, “An experimental comparison between fixed weight and linear programming food price indexes”,Journal of American Statistical Association 65 (1970) 49–60.

    Google Scholar 

  8. J.L. Balintfy and P. Sinha, “A nonlinear programming approach to preference maximized menu plans”, in: W.W. White, ed.,Computers and mathematical programming, N.B.S. Special Publication 502 (1978) pp. 97–105.

  9. R.S. Barr and G.T. Ross, “A linked list data structure for a binary knapsack algorithm”, Research Rept. CC5232, Center for Cybernetic Studies, University of Texas (1975).

  10. P.H. Benson, “A psychometric approach to predicting consumer behavior”,Personnel Psychology 13 (1960) 71–80.

    Google Scholar 

  11. J.D. Bowman and E.M. Brennan, “Computer assisted menu planning provides control of food service”,Hospitals 43 (1969) 107–113.

    Google Scholar 

  12. G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, 1963).

    Google Scholar 

  13. M.J. Gelpi, J.L. Balintfy, L.C. Dennis and I.K. Findorff, “Integrated nutrition and food cost control by computér”,Journal of the American Dietetic Association 61 (1972) 637–646.

    Google Scholar 

  14. A.M. Geoffrion, “Lagrangian relaxation for integer programming”Mathematical Programming Study 2 (1974) 82–114.

    Google Scholar 

  15. H.R. Moskowitz, “A system for evaluation of military menus (U)”,Proceedings of 1974 Army Science Conference, West Point, New York, June 1974, U.S. Army Tech. Rept.

  16. R.M. Nauss, “The 0–1 knapsack problem with multiple choice constraints”, Research Rept., School of Business Administration, University of Missouri-St. Louis (1975).

  17. P. Sinha, “Preference-maximizing models for menu planning”, Doctoral Dissertation, University of Massachusetts (1974).

  18. P. Sinha and A.A. Zoltners, “The multiple choice knapsack problem” forthcoming inOperations Research.

  19. V.E. Smith,Electronic computation of human diets, Michigan State University Business Studies, East Lansing, 1963.

    Google Scholar 

  20. G.J. Stigler, “The cost of subsistence”,Journal of Farm Economy 27 (1945) 303–314.

    Google Scholar 

  21. P. Wolfe, “Foundations of nonlinear programming”, in: J. Abadie, ed.,Nonlinear programming (Wiley, New York, 1967).

    Google Scholar 

  22. A.A. Zoltners, “A direct descent binary knapsack algorithm”,Communications of the ACM 25 (1978) 304–311.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Massachusetts, Amherst, MA, USA

    Joseph L. Balintfy

  2. University of Georgia, Athens, GA., USA

    G. Terry Ross & Prabhakant Sinha

  3. Northwestern University, Evanston, IL., USA

    Andris A. Zoltners

Authors
  1. Joseph L. Balintfy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Terry Ross
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prabhakant Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andris A. Zoltners
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balintfy, J.L., Ross, G.T., Sinha, P. et al. A mathematical programming system for preference and compatibility maximized menu planning and scheduling. Mathematical Programming 15, 63–76 (1978). https://doi.org/10.1007/BF01609000

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01609000

Key words

Search

Navigation