Which one of the options given represents the feasible region of the linear programming model: Maximize $45X_1 + 60X_2$ $X_1 \le 45$ $X_2 \le 50$ $10X_1 + 10X_2 \ge 600$ $25X_1 + 5X_2 \le 750$
The constraint $10X_1 + 10X_2 \ge 600$ means $X_1 + X_2 \ge 60$, so the feasible points are on or above the flatter line. The constraint $25X_1 + 5X_2 \le 750$ keeps points below or on the steeper line. Together with $X_2 \le 50$ (below the horizontal line) and $X_1 \le 45$, the points that are above the flatter line, below the steeper line and below the horizontal line form the small triangle Q. Region P is below the flatter line, and regions R and S are on the wrong side of one of the lines.
More Linear programming and the simplex method questions
GATE 2022 ME (ME1) Q21– In a linear programming problem, if a resource is not fully utilized, the shadow price of…
GATE 2022 ME (ME2) Q42– A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the…
GATE 2020 ME (ME1) Q57– Shveta and Ashok independently produce A and B in two states, selling at ₹2000/kg and…
GATE 2018 ME (ME1) Q61– Minimize 3x+5y subject to 3x+5y15, 4x+9y8, 13x+2y2 and x,y0. The minimum is .
GATE 2018 ME (ME2) Q45– Maximize z=x 1-x 2 subject to x 1+x 210, x 10, x 20, x 25. The problem has .
GATE 2017 ME (ME2) Q61– Maximize Z=5x 1+3x 2 subject to x 1+2x 210, x 1-x 28, x 1,x 20. Initially both variables…