Consider a linear programming problem with two variables and two constraints. The objective function is: Maximize x1 + x2. The corner points of the feasible region are (0, 0) (0, 2) (2, 0) and (4/3, 4/3). If an additional constraint x1 + x2 ≤ 5 is added, the optimal solution occurs at
the point
1
(5/3, 5/3)
2
(4/3, 4/3)
3
(5/2, 5/2)
4
(5,0)