operation reaserch

#1. Consider the following linear programming model Maximize 2-3X1.5X2 S. XI-4 2x2 ec 12 3x12x2 X1, X20 a. Solve the LP using graphical method b. Use graphical analysis to identify all the corner solutions for this model Labelach as either feasible or infeasible M Feast Comer-point solutions Cakulate the value of the chileunction for each of the CPF solution. Use this Information to identify an optimal solution Comer OVE feasible solutions 2 d. Write the model problem in need form of the model Selve the problem using the form of the simplex method 1. Vully the optimal solution you and by using Excel