Question

Consider the following linear programming formulation:

Min      Z = X ₁ + X ₂
Subject to
X ₁ + X ₂ ≥ 3
X ₁ + X ₂ ≥ 5
X ₁, X ₂ ≥ 0

Identify the feasible region in the graph below. Only one constraint will be shifted at a time.

Which shift will produce an increase of the current feasible area?

	YOUR ANSWER	CORRECT ANSWER
X 1 + X 2 ≥ 3 shifts to X 1 + X 2 ≥ 4
X 1 + X 2 ≥ 3 shifts to X 1 + X 2 ≥ 2
X 1 + X 2 ≥ 3 shifts to X 1 + X 2 ≥ 5
X 1 + X 2 ≥ 5 shifts to X 1 + X 2 ≥ 6
X 1 + X 2 ≥ 5 shifts to X 1 + X 2 ≥ 4 CAN YOU PLEASE EXPLAIN THIS ANSWER TO ME. THANKS!

Answer 1