(2)
x + 5
4  y ≥ 5 (constraint on Machine III) (3)
x  ≥ 0,  y ≥ 0 (4)
© NCERT
not to be republished
LINEAR PROGRAMMING         523
Let us draw the graph of constraints (1) to (4) ABCDE is the feasible region
(shaded) as shown in Fig 12