A vanilla cake requires 200g of flour and 25g of fat, and a strawberry cake requires 100g of flour and 50g of fat. From 5kg of flour and 1kg of fat, the maximum number of cakes that can be made is
Open in App
Solution
Let x number of vanilla cakes and y number of strawberry cakes be made.
Then objective function is
Maximize Z=x+y
subject to constraints : maximum 5kg flour is available. ⇒2001000x+1001000y≤5 ⇒2x+y≤50⋯(i)
and maximum 1kg of fat is available. ⇒251000x+501000≤1 ⇒x+2y≤40⋯(ii)
and x,y≥0⋯(iii)
Now, plotting the graph of given constraints to get feasible region :
Now, tabulating the value of Z=x+y at corner points :