consider the linear programming problem
maximize z = x1 +x2
subjected tp
x1 + 3x2 >= 15
2x1 + x2 >= 10
x1 + 2x2 <=40
3x1 + x2 <= 60
x1 >= 0, x2>= 0
solve using the revised simplex method and comment on anyspecial charateristics of the optimal soultion. sketch the feasibleregion for the problem as stated above and show on the figure thesolutions at the various iterations
