1994
DOI: 10.1038/sj/jors/0450501
|View full text |Cite
|
Sign up to set email alerts
|

Linear Programming Techniques for the Construction of Palatable Human Diets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…Their maximum capacity was a problem with 100 foods and 30 constraints. Based on this analysis, Fletcher et al developed a computational method able to construct individually acceptable diets by means of LP ( 28 ).…”
Section: Methodsmentioning
confidence: 99%
“…Their maximum capacity was a problem with 100 foods and 30 constraints. Based on this analysis, Fletcher et al developed a computational method able to construct individually acceptable diets by means of LP ( 28 ).…”
Section: Methodsmentioning
confidence: 99%
“…The least‐cost approach based on the linear programming technique in setting food poverty lines has been applied in many studies (Ogwumike, ; Soden and Fletcher, ; Fletcher et al . ; World Bank, ; and Bellu, ). The advantages of using linear programming technique in setting food poverty lines, as observed by Ogwumike (), include: (i) the nutritional constraints in terms of calories and even other measures of nutritional contents in food can easily be built into the model; (ii) the consumption patterns and customs of the zones/regions of interest can also be built into the model; and (iii) the technique ensures that the cost of the diet arrived at is at the minimum given the various constraints in (i) and (ii) above.…”
Section: Theoretical Framework and Methodologymentioning
confidence: 99%
“…This formulation of the Diet Problem is examined in three scenarios, with each scenario adding additional constraints. Following Fletcher and colleagues [27], in the case in which not all constraints can be met, shadow costs are utilized to determine the best suboptimal solution.…”
Section: Problem Statementmentioning
confidence: 99%