INTRODUCTION TO OPERATIONS RESEARCH Consider the following graph that represents a 2-variable maximisation Linear Program (LP). Thefeasible region of the LP is represented by the green shaded area and its boundary, while the isoprofitline is in red and the direction of optimality is indicated by the attached arrow. Several feasible pointshave been labelled F to N. Each constraint i is labelled as Ci.X2MHx1doda2C1C2C3,LFC4ZGKINC5 (a) State the optimal point.(b) State the binding constraints and/or variable bounds at the optimal point.(c) Identify all points that are also Corner Point Feasible (CPF) solutions.(d) Give a point other than F to N that is not a CPF solution. Explain why your chosen point isnot a CPF solution.(e) Suppose we solve the LP using the Simplex Method, and we start at F.i. Identify all possible Simplex paths from F to the optimal point.ii. Report and explain why the following paths cannot be Simplex paths for any objectivefunction.F→I→G.F→N→K→ H.F→L→ M.●

We will use graphical method to find solutions of all questions . Note : maximum 3 sub parts are…

Consider the following graph that represents a 2-variable maximisation Linear Program (LP). The feasible region of the LP is represented by the green shaded area and its boundary, while the isoprofit line is in red and the direction of optimality is indicated by the attached arrow. Several feasible points have been labelled F to N. Each constraint i is labelled as Ci. 12 x1 3 2 0 C1 C2 C3 L F C4 G H K J M H C5