Manually solve the following linear program (which could result from a production problem) using the graphical approach. Report all the corner-point feasible (CPF) solutions and their corresponding objective values. Report the optimal solution and the optimal objective value. Maximize: 40 X1 + 30 X2 Subject to: X1+2X2 <= 24. X1 <= 16. X2 <= 8. X1, X2 >= 0. Convert the above LP formulation to the standard form where all functional constraints are equations. Make sure you define your slack variables.

Manually solve the following linear program (which could result from a production problem) using the graphical approach. Report all the corner-point feasible (CPF) solutions and their corresponding objective values. Report the optimal solution and the optimal objective value. Maximize: 40 X1 + 30 X2 Subject to: X1+2X2 <= 24. X1 <= 16. X2 <= 8. X1, X2 >= 0. Convert the above LP formulation to the standard form where all functional constraints are equations. Make sure you define your slack variables.