Answer:
Let x and y be the pieces of toast and sausage required.
Then the objective function is
Min Z=0.04x+0.08y
Constraints:
Vitamin A, 2x+4y≥20
Vitamin B, 3x+1.5y≥15
Iron, 2x+2y≥16
Sausage, y≤4
The non-negative constraints are x≥0, y≥0
Thus, the linear programming model is
Min Z=0.04x+0.08y
Subject to,
2x+4y≥20
3x+1.5y≥15
2x+2y≥16
y≤4
x≥0, y≥0
1) There are two variables in the LP model. So, option (B) is correct.
2) The LP model contains four constraints (excluding the non negative constraints). So, option (D) is correct.
3) Solving the LP model using a software, we get the solution as
z=0.4, at x=6 and y=2
So, The cost of the breakfast is $ 0.4. Option (B) is correct.
4) The breakfast should contains 6 toasts.
5) The amount of Vitamin B in the breakfast = 3(6)+1.5(2)=18+3=21 milligrams. So, option (C) is correct.
6) The amount of Iron in the breakfast= 2(6)+2(2)=12+4=16 milligrams. So, option (B) is correct.
Step-by-step explanation:
