In a Linear Programming Problem, the objective function Z=5x+4y needs to be maximised under constraints 3x+y≤6, x≤1, x,y≥0. Express the LPP on the graph and shade the feasible region and mark the corner points.
Show answer & solution
Answer: Feasible region is the quadrilateral with corner points (0, 0), (1, 0), (1, 3) and (0, 6); (maximum Z = 24 at (0, 6)).
Draw the lines 3x+y=6 (through (2, 0) and (0, 6)) and x=1.
The feasible region lies on the origin side of both lines in the first quadrant.
In a Linear Programming Program (LPP) for objective function Z=14x−10y subject to constraints x+y≤8 3x−2y≥−6 x,y≥0 shade the feasible region and mark the corner points in a neatly drawn graph.
Show answer & solution
Answer: Feasible region is the quadrilateral with corner points (0, 0), (8, 0), (2, 6) and (0, 3).
Draw x+y=8 through (8, 0) and (0, 8); draw 3x−2y=−6 through (−2, 0) and (0, 3).
(0, 0) satisfies both inequalities, so the feasible region is on the origin side of both lines, in the first quadrant.
The lines meet where 3x−2(8−x)=−6, i.e. x=2, y=6.
Corner points: (0, 0), (8, 0), (2, 6), (0, 3); shade the quadrilateral formed by them.
For a Linear Programming Problem, find min Z=5x+3y (where Z is the objective function) for the feasible region shaded in the given figure. (Note : The figure is not to scale)
Show answer & solution
Answer: Minimum Z = 9 at C(0, 3)
B is where x+y=5 meets the y-axis: B(0, 5); C is where x+3y=9 meets the y-axis: C(0, 3).
A: solving x+y=5 and x+3y=9 gives 2y=4, so A(3, 2).