Linear Programming question
1. a. Show that this model has an unbounded solution by Big M Method. (25P)
b. What can be changed to have a bounded solution for this model? Explain by solving it. (25P)
Max Z= 3×1 + 6×2
s.to
3×1 + 4×2 ≥ 12
-2×1+ x2 ≤ 4
x1, x2 ≥ 0
