Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T19:34:01.503Z Has data issue: false hasContentIssue false

Diet planning for humans using mixed-integer linear programming

Published online by Cambridge University Press:  09 March 2007

David Sklan
Affiliation:
Faculty of Agriculture, Hebrew University, Rehovot, Israel
Ilana Dariel
Affiliation:
Faculty of Agriculture, Hebrew University, Rehovot, Israel
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Human diet planning is generally carried out by selecting the food items or groups of food items to be used in the diet and then calculating the composition. If nutrient quantities do not reach the desired nutritional requirements, foods are exchanged or quantities altered and the composition recalculated. Iterations are repeated until a suitable diet is obtained. This procedure is cumbersome and slow and often leads to compromises in composition of the final diets. A computerized model, planning diets for humans at minimum cost while supplying all nutritional requirements, maintaining nutrient relationships and preserving eating practices is presented. This is based on a mixed-integer linear-programming algorithm. Linear equations were prepared for each nutritional requirement. To produce linear equations for relationships between nutrients, linear transformations were performed. Logical definitions for interactions such as the frequency of use of foods, relationships between exchange groups and the energy content of different meals were defined, and linear equations for these associations were written. Food items generally eaten in whole units were defined as integers. The use of this program is demonstrated for planning diets using a large selection of basic foods and for clinical situations where nutritional intervention is desirable. The system presented begins from a definition of the nutritional requirements and then plans the foods accordingly, and at minimum cost. This provides an accurate, efficient and versatile method of diet formulation.

Type
Planning of Diets using Linear Programming
Copyright
Copyright © The Nutrition Society 1993

References

REFERENCES

Colavita, C. & D'Orsi, R. (1990).Linear programming and pediatric dietetics. British Journal of Nutrition 64, 307317.Google Scholar
Ferguson, R. O. & Sargent, L. F. (1958). Linear Programming: Fundamentuls and Applications, pp. 34, 243. New York: McGrdw-Hill.Google Scholar
Food and Nutrition Board (1989). Recommended Dietary Allowances, 10th revised ed. Washington, DC: National Academy of Sciences.Google Scholar
Gale, D. (1960). The Theory ofLinear Economic Models. pp. 330 356. New York: McGraw-Hill.Google Scholar
Gass, S. I. (1969). Linear Programming Methods and Applications. pp. 137241. New York: McGraw-Hill.Google Scholar
Gomory, R. E. (1958). Outline for an algorithm for integer solutions to linear programs. Bulletin of American Mathematical Society 64, 275278.CrossRefGoogle Scholar
Land, A. H. & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Eeonometrica 28, 497520.Google Scholar
Sklan, D. & Bondi, A. (1987). Ration formulation and production optimisation. Animal Nutrition, pp. 515520. New York: Wiley.Google Scholar
United States Department of Agriculture (1987). Composition of Foods Handbook, viii. Washington, DC: National Academy of Sciences.Google Scholar