USING MS-EXCEL TO SOLVE THIS ALSO

33. Answer the questions related to the model below: max. 3x1 + 2x2 st 2x1 + 2x2 5 2x1 + x2 4 x1 + 2x2 4 x1, x2 0 a. Use the graphical solution technique to find the optimal solution to the model. b. Use the simplex algorithm to find the optimal solution to the model. c. For which objective function coefficient value ranges of x1 and x2 does the solution remain optimal? 34. A manufacturer produces two types of screws, A and B, Each type of screw requires the use of two machines; an automatic and a hand operated one. It takes 4 minutes on the automatic machines and 6 minutes on the hand operated machine to manufacture a package of screws of type A, while it takes 6 minutes on an automatic machine and 3 minutes on a hand operated machine to manufacture a package of screws of type B. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of type A screws at a profit of K70 and a profit of K100 on a package of type B screws. (a) Write down the Linear Programming Model. Assuming that she can sell all the screws she manufactures, determine the number of packages that she must manufacture if she has to maximise her profit. (b) What is the maximum profit? (c) What are the slack resources at the optimum point?