Graphical Method of Solving Linear Programming Problems
One kind of c...
Question
One kind of cake required 200 g flour and 25 g of fat, and another kind of cake required 100 g of flour and 50 g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and 1 kg of fat assuming that there is no shortage of the other ingredients used in making the cakes?
Open in App
Solution
Let there be x cakes of first kind and y cakes of second kind. Therefore, x≥0 and y≥0 The given information can be complied in a table as follows.
Flour (g)
Fat (g)
cakes of first kind, x
200
25
cakes of second kind, y
100
50
Availability
5000
1000
∴200x+100y≤5000 ⇒2x+y≤50 25x+50y≤1000 ⇒x+2y≤40 Total numbers of cakes, Z, that can be made are, Z=x+y The mathematical formulation of the given problem is Maximise Z=x+y.......(1) subject to the constraints, 2x+y≤50........(2) x+2y≤40........(3) x,y≥0............(4) The feasible region determined by the system of constraints is as shown. The corner points are A(25,0),B(20,10),O(0,0) and C(0,20) The values of Z at these corner points are as follows.
Corner point
Z=x+y
A(25,0)
25
B(20,10)
30
→ Maximum
C(0,20)
20
O(0,0)
0
Thus, the maximum numbers of cakes that can be made are 20 of one kind and 10 of the other kind.