Solve the following linear programming problem graphically:

Solve the following linear programming problem graphically: (using the Solver add-in excel)maximize(pie)= 2X(sub 1)+3X(sub 2)subject to X(sub1)<(or equal to) 8X(sub 1) <(or equal to)6X(sub 1)+2X(sub 1))(or equal to)02. In problem 1, how would the optimal solution change if the restrictions imposed (i.e.,the ri’s) were all cut in half?3. Solve the following linear programming problem using the general solution method:3X(sub1) 4X(sub2)subject to X(sub 1)+X(sub 2)>(or equal to) 22X(sub 1)+4X(sub 2)>(or equal to) 5X1, X2 >(or equal to) 04. Form the dual to the linear programming problem presented in problem 3; then solveit to obtain the optimal value of C. Does the minimum value of C for the primal in Problem 3 equal the maximum value of C in the dual for this problem?

Place this order or similar order and get an amazing discount. USE Discount code “GET20” for 20% discount