1992
DOI: 10.1016/0377-2217(92)90345-a
|View full text |Cite
|
Sign up to set email alerts
|

The history of the application of mathematical programming to menu planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0
1

Year Published

2001
2001
2023
2023

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(22 citation statements)
references
References 18 publications
0
19
0
1
Order By: Relevance
“…More recent *This work was supported by the Hellman Fellows Program. Pedro Hespanhol and Anil Aswani are with the Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720, USA pedrohespanhol@berkeley.edu, aaswani@berkeley.edu formulations (including those used for governmental policy decision-making) focus on minimizing convex functions of continuous quantities of ingredients [11] or selecting discrete (i.e., integer-valued) quantities of menu items [12].…”
Section: A Dietary Planningmentioning
confidence: 99%
“…More recent *This work was supported by the Hellman Fellows Program. Pedro Hespanhol and Anil Aswani are with the Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720, USA pedrohespanhol@berkeley.edu, aaswani@berkeley.edu formulations (including those used for governmental policy decision-making) focus on minimizing convex functions of continuous quantities of ingredients [11] or selecting discrete (i.e., integer-valued) quantities of menu items [12].…”
Section: A Dietary Planningmentioning
confidence: 99%
“…The main objective was to find the least cost of meals for the American army. His mathematical model of diet problem is shown as follow (Lancaster, 1992).…”
Section: Trial-and-error Based Approachmentioning
confidence: 99%
“…Some authors have applied Operational Research techniques to tackle the problem of planning a diet (see the survey in [18] or the more recent paper [5]). These techniques are based on the simplex method for solving linear programming problems.…”
Section: Conclusion and Related Workmentioning
confidence: 99%