Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-14T12:02:22.807Z Has data issue: false hasContentIssue false

Linear programming and pediatric dietetics

Published online by Cambridge University Press:  09 March 2007

Ciro Colavita
Affiliation:
Pediatric Division, S. Paolo Hospital, Naples 80122, Italy
Renato D'orsi
Affiliation:
Potytecnic, University of Naples, Naples 80122, Italy
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.

The composition of 500 foods has been stored in a computer in order to analyse a child's diet. The methodology of operations research is applied to a very simple problem: a diet with only two foods. The geometrical representation of the ‘feasible region’ and of the ‘objective function’ is illustrated. One of the analytical methods employable with many variables (foods) is considered. This method was used in trying to find diets allowing for the preferential use of selected foods while respecting recommended dietary allowances, the tastes of the child and other constraints. The theoretical difficulty of transferring this methodology to pediatric dietetics was examined. We solved a simple case utilizing this procedure.

Information

Type
Nutritient Intakes: Models and Surveys
Copyright
Copyright © The Nutrition Society 1990