Question 1 (a) The shaded area in the figure below is the feasible region of an LP problem. Solve the following LP problem graphically. State the set of constraints (other than the non-negativity constraints) that form the feasible region of the LP problem. (b) -1 2 1 2 X (6 marks) Production of one-unit Product A requires 2 units of raw material C and 3 units of raw material D. Product A can be sold to clients at $10 per unit. However, Product A can be further processed to be a more refined product, Product B. Production of one-unit Product B requires 2 units of Product A, 1 unit of raw material C and 2 units of raw material D. The current market price for Product B is $30 per unit. 600 units of raw material C and 800 units of raw material D are available for production. The decision maker wants to maximise the total revenue from Products A and B. Apply the linear programming model to formulate this revenue maximisation problem. State your assumptions clearly. (Note: It might be obvious for you what the optimal product mix should be. Your task is NOT to find the optimal product mix to maximise the revenue. Your task here is to formulate the decision problem into a Linear Programming Model.) (10 marks)