OPERATIONS MANAGEMENT

Question 4 [16] Consider the following LP model: Minimise z=2.0 + 8y subject to 5.0 + 2y > 16 .+ 4y > 14 4.0 - 3y = 18 and 2, y > 0. (a) Represent all the constraints of the LP model on a graph. Represent r on the horizontal axis and y on the vertical axis. Label all relevant lines on the graph and indicate the feasible region clearly. (5) Important note: Use the necessary tools to draw a reasonably accurate graph. A rough sketch is not acceptable. (b) Find all the corner points of the feasible region and evaluate the objective function at each of them. (3) Important note: Half a mark will be deducted for each incorrect corner point given (c) Deduce the optimal solution. If the LP problem is infeasible or unbounded, give the reason for this. If the LP problem has multiple optimal solutions, find the general optimal solution. (3) (d) State clearly all redundant, binding and nonbinding constraints in this linear programming problem. (3) (e) If the functional constraint x + 4y