Answer Happy

Problem 6) (4 points) Solve the linear programming problem using the geometric approach by finding the set of feasible solutions and examining the extreme points. Maximize z = - 5x1 + 3x2 subject to 2x1 + x2 < 6 2x1 – x2 > 0 X1 – X2 < 0 X1, X2 > 0.