Q.39 Consider the Linear Programming Problem (LPP): Maximize

Last updated: 7/24/2022

Q.39 Consider the Linear Programming Problem (LPP): Maximize αx₁ + x2 Subject to 2x1 + x₂ ≤ 6, - X1 + x₂ ≤ 1, x1 + x₂ < 4, x1 ≥ 0, x2 > 0, where a is a constant. If (3, 0) is the only optimal solution, then (A) α < -2 (B) -2 < α < 1 (C) 1 < α < 2 (D) α > 2