1.

Solve linear programming problem max ( z ) : X + 2yx-y =3​

Answer»

Given OBJECTIVE function is Z=x+2yWe have to minimize Z on constraints2x+y≥3x+2y≥6x≥0,y≥0After plotting the inequalities we got the feasible region as shown in the imageNow there are TWO corner points (0,3) and (6,0) LYING on same line x+2y=6Value at corner points are : Corner Points Value of Z=x+2y (0,3) 6 (minimum) (6,0) 6 (minimum)Since, feasible region is unbounded. So, 6 may or may not be minimum value.Now to CHECK if 6 is minimum or not, we have to draw Z<6⇒x+2y<6Since this region doesn't have any common region with feasible region. So, 6 is the minimum value of Z.



Discussion

No Comment Found

Related InterviewSolutions