The GATE Grind

GATE 2019 PI – Question 43

Operations Research and Operations Management · Operations Research · 2 marks · Multiple choice

A linear programming problem (LPP) is defined as: Minimize $z=15x_1+12x_2$, subject to $x_1+2x_2\leq 3$, $2x_1-4x_2\leq 5$, and $x_1,x_2\geq0$. The objective function of the dual of this LPP is

  1. Maximize $w=y_1+y_2$
  2. Maximize $w=y_1+2y_2$
  3. Maximize $w=2y_1-4y_2$
  4. Maximize $w=3y_1+5y_2$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) Maximize $w=3y_1+5y_2$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Operations Research questions

All Operations Research questions →