Professional Documents
Culture Documents
Engineering Science Laboratory, PFT Taza University Sidi Mohamed Ben Abdellah
1 Introduction
Outline
1 Introduction
Introduction
The first diet problem was proposed by Stigler and solved by Danzig
as the first test problem for the simplex algorithm .
The first researcher to introduce a linear programme with glycaemic
load as an objective function was Esra Bas (2014).
In this work, we determine diets based on constrained multi-objective
linear programming where the first objective function is the glycemic
load of the diet while the second objective function is the cost of the
diet.
Outline
1 Introduction
Data :
In this work, we consider fifteen favorable nutrients and four unfavorable
nutrients.
Favorable: Calories(c), Protein(p), Carbohydrate(car),
Potassium(po), Magnesium(mg), Dietary fibre (tdf), Calcium(ca),
Iron (ir), Phosphorus(ph), Zinc(z), Vitamin b6(vb6), b12(vb12),
C(vc), A(va), and E(ve).
Unfavorble nutrients: saturated fatty acids (sf), Sodium,
Cholesterol, and Fat (tf).
Requirements:
1 The daily positive nutrient requirements:
bc = 2.000kcal, bp = 91g, bcar = 271g, bpo = 4044mg, bmg =
380mg, btdf = 31g, bca = 1316mg, bir = 18mg, bph = 1740mg, bz =
14mg, bvb6 = 2.4mg, bvb12 = 8.3µg, bvc = 155mg, bva =
1052µg, bve = 9.5mg,
2 the minimum tolerable negative nutrient requirement:
fsf = 17g, fs = 1.779mg, fch = 230mg, andftf = 65g.
Unknown:
Optimal quantities of each food that meets all requirements and with
minimal total glycemic load and cost.
Symbols:
From now on, we adopt the following symbols:
A: matrix of the values of foods, positive nutrients; in our case,
(number of positive nutrients, number of foods)= (4, 177);
E : matrix of the values of foods negative nutrients; in our case,
(number of negative nutrients, number of foods)= (4, 177);
b: minimum required positive nutrients (number of positive nutrients,
1);
f : maximum tolerable negative nutrients (number of negative
nutrients,1);
Ac : line vector corresponding to the calories coming from the
positive nutrient;
Constraints:
Constraints on favorable nutrients:
1 If we adopt the decision x = (xj )1≤j≤177 , Ax are the vector of 15 rows
each of which represents the total amount of each positive nutrient
offere by our diet, then we have the following family of constraints
Ax ≥ b.
2 The total calories from carbohydrate must make up at least 55% off
the calories from all positive diet,nutrients;and hence we have the
T x ≥ 0.55 AT x .
constraint ccar c
3 The total calories from Protein must be at least 18% of the calories
from all positive diet
nutrients; hence we have the constraint
cpT x ≥ 0.18 AT c x .
The least expensive mathematical model that minimizes the total glycemic
load and ensures the minimum necessary positive nutrients and limits the
consumption of negative nutrients is given by :
Outline
1 Introduction
For each 100g of each of the 177 foods, we estimate the content of
each of the nutrients, thus considered.
For example, the table shows the content in 100g of apricot of the
different nutrients (on the left the positive nutrients and on the right
the negative nutrients).
The table gives the glycemic load contents in 100g of apricot, apricot
Dry, Garlic, pineapple, bananas conserve, Artichaut, Asparagus,
Eggplant, Veal brain, Chestnut, Shrimp chips, Cabbage white, and
Sauerkraut.
Figure: Pareto front of model glycemic minimum and minimum cost regime
Consider different values of the glycemic load and the cost of different
foods, the estimated diets are almost equivalent.
Indeed, some foods are always present (eggplant, soya milk, lentils,
chickpeas and tea) and rare are the foods that are absent, such as
cooked zucchini.
Outline
1 Introduction