Confirming your payment

Skip to content

Previous Year Questions · Question 37 of 37

Read the following text and answer the following questions on the basis of the same: Let R be the feasible region…

Question 375 marksAsked 2020Medium

Read the following text and answer the following questions on the basis of the same: Let R be the feasible region (convex polygon) for a linear programming problem and let Z=ax+byZ=a x+b y be the objective function. When ZZ has an optimal value (maximum or minimum), where the variables xx and yy are subject to constraints described by linear inequalities, this optimal value must occur at a corner points (vertex) of the feasible region.

  1. The corner points of the feasible region determined by the system of linear constraints are (0,0),(0,40)(0,0),(0,40), (20,40),(60,20),(60,0)(20,40),(60,20),(60,0). The objective function is
Z=4x+3y.Z=4 x+3 y .

Compare the quantity in Column AA and Column BB.

Column AAColumn BB
Maximum of ZZ325
  1. What do you understand by optimal solution?

  2. Solve the following LPP graphically:

Max.

Z=2x+3yZ=2 x+3 y

subject to

x+y≤4x≥0,y≥0\begin{aligned} x+y & \leq 4 \\ x & \geq 0, y \geq 0 \end{aligned}

OR

Draw the graph of given LPP and find the corner points of feasible region.

Minimize

Z=200x+500yZ=200 x+500 y

Subject to constraints:

x+2y≥103x+4y≤24x≥0,y≥0\begin{aligned} x+2 y & \geq 10 \\ 3 x+4 y & \leq 24 \\ x & \geq 0, y \geq 0 \end{aligned}