The GATE Grind

GATE 2018 ME (ME1) – Question 61

Operations Research · Linear programming and the simplex method · 2 marks · Numerical answer

Minimize $3x+5y$ subject to $3x+5y\le15$, $4x+9y\le8$, $13x+2y\le2$ and $x,y\ge0$. The minimum is ______.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: 0 to 0

Explanation

With x,y nonnegative, $3x+5y\ge0$. The origin satisfies every upper-bound constraint and achieves zero, proving that the minimum is 0.