Answer:
14:2
Step-by-step explanation:
1 coin is one part, one bill is one part
14:2
Answer:
Maximize C =


and x ≥ 0, y ≥ 0
Plot the lines on graph




So, boundary points of feasible region are (0,1.7) , (2.125,0) and (0,0)
Substitute the points in Maximize C
At (0,1.7)
Maximize C =
Maximize C =
At (2.125,0)
Maximize C =
Maximize C =
At (0,0)
Maximize C =
Maximize C =
So, Maximum value is attained at (2.125,0)
So, the optimal value of x is 2.125
The optimal value of y is 0
The maximum value of the objective function is 19.125
The expression for the number of segments drawn out of the n number of points in the circle is,
n² / 2 - n / 2
Substituting directly to the expression the number of points, n, which is equal to 8,
8² / 2 - 8 / 2 = 28
Thus, there are 28 segments that can be drawn from the points.
When two lines meet or cross that is call intersecting