TORA Experiment. Consider the following LP model: Maximize z = 5x1 + 4x2
subject to
6x1 + 4x2 … 24
6x1 + 3x2 … 22.5
x1 + x2 … 5
x1 + 2x2 … 6
-x1 + x2 … 1
x2 … 2
x1, x2 Ú 0
In LP, a constraint is said to be redundant if its removal from the model leaves the
feasible solution space unchanged. Use the graphical facility of TORA to identify the
redundant constraints, and then show that their removal (simply by not graphing them)
does not affect the solution space or the optimal solution.