MHT CET202015 Oct 2020Evening ShiftMathematicsLinear ProgrammingActual
The optimal solution of the L.P.P. Maximize : Z =8 x+3 y subject to the constraints x+y 3,4 x+y 6, x 0, y 0 is
Options
- Ax=0, y=3
- Bx=0, y=0
- Cx= 3 2 , y=0
- Dx=1, y=2
Correct answer
D. x=1, y=2
Step-by-step solution
Here O (0,0), A ( 3 2 , 0 ), C =(0,3) Point of intersection of given lines is B (1,2)Z=8 x+3 y and feasible region is shaded. Z_ (0) =0Z_ (A) =8 ( 3 2 )=12Z_ (C) =3(3)=9Z_ (B) =8(1)+3(2)=14