Problem 1: For the following linear programming problem: = 401 + 502

s.t:

31 62 30

1 15 32

2 1 + 3 2 = 24

1, 2 0

1- Find the optimal solution using simplex big-M method manually. (show the iterations)

2- Determine the value for basic solution and non-basic solution, binding constraints and nonbinding constrains, and if there are any redundant constraints

3- Identify if there is any special case solution and state it