wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

One kind of cake requires 200g flour and 25g of fat, and another kind of cake requires 100g of flour and 50g 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

Assume that the cake of one kind be x and another kind be y. As the quantities are always positive, so,

x0 y0

Tabulate the given data as,

Flour(g)Fat(g)
Cakes of first kind, x20025
Cakes of second kind, y10050
Availability50001000

The required constraints are,

200x+100y5000 2x+y50

And,

25x+50y1000 x+2y40

The objective function which needs to maximize is,

Z=x+y

The line 2x+y50 gives the intersection point as,

x025
y500

Also, when x=0,y=0 for the line 2x+y50, then,

0+050 050

This is true, so the graph have the shaded region towards the origin.

The line x+2y40 gives the intersection point as,

x040
y200

Also, when x=0,y=0 for the line x+2y40, then,

0+040 040

This is true, so the graph have the shaded region towards the origin.

By the substitution method, the intersection points of the lines 2x+y50 and x+2y40 is ( 30,10 ).

Plot the points of all the constraint lines,



It can be observed that the corner points are O( 0,0 ),A( 25,0 ),B( 20,10 ),C( 0,20 ).

Substitute these points in the given objective function to find the minimum value of Z.

Corner Points Z=x+y
O( 0,0 )0
A( 25,0 )25
B( 20,10 )30 (maximum)
C( 0,20 )20

The maximum value of Z is 30 at the point ( 20,10 ).

Therefore, the maximum numbers of cakes that can be made are 30.


flag
Suggest Corrections
thumbs-up
7
similar_icon
Similar questions
View More
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Graphical Method of Solving LPP
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon