Operations Research I

Homework 5
Due 11:59 PM Sunday, May 8, 2022

1. Consider the following problem.

(1) (15%) use the Big M method to solve the problem.

(2) (15%) use the two-phase method to solve the problem.

2. (20%) Consider the following linear programming problem.

(1) (5%) Reformulate this problem so that all variables have nonnegativity
constraints.
(2) (15%) Use the simplex method step by step to solve the problem.

3. (20%) Consider the following linear programming problem.

(1) (15%) Use simplex method to solve the problem.

(2) (5%) Identify the shadow prices for the three resources.

4. (10%) Consider the following problem.

1/2
 Work through the simplex method step by step to demonstrate that this problem
does not possess any feasible solutions.

5. (20%) You are given the tableau below for a standard maximization problem. Give
conditions on the unknowns a 1 , a2 , a3 , b , and c that make the following statements
true:

(1) The current solution is optimal.

(2) The current solution is optimal, and there are alternative optimal solutions.
(3) The LP is unbounded if b ≥ 0.

Z x1 x2 x3 x4 x5 RHS
1 −c 2 0 0 0 10
0 -1 a1 1 0 0 4
0 a2 -4 0 1 0 1
0 a3 3 0 0 1 b

2/2