Answer:
30 or younger
Step-by-step explanation:
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:
Possible number combinations are 1,1 2,1 3,1 4,1 5,1 6,1 1,2 2,2 3,2 4,2 5,2 6,2 1,3 2,3 3,3 4,3 5,3 6,3 1,4 2,4 3,4 4,4 5,4 6,4 1,5 2,5 3,5 4,5 5,5 6,5 1,6 2,6 3,6 4,6 5,6 and 6,6. of those 36 number combinations the ones that add up to more than 10 include: 4,6 5,5 5,6 6,4 6,5 6,6. thats 6 number combinations. 6/36 of the possible sums of the top faces equal out to 10 or more. 6/36=1/6=0.166666666666666666666666(repeating) and to put that in a percentage, 16.7%
the probability is 16.7%
Hope this helps.
This is a linear equation in x.
So you need to group like terms

Let us group the x terms on the Right Hand Side of the equation and the constant terms on the Left Hand Side.

We can now simplify

Now let us divide both sides by 3.

This implies that

or

Let us our answer



Good we are right