Question: Kindly assist with question 1 a b and c please show all workings and formulae. There is no given graph. You need to make the


Kindly assist with question 1 a b and c please show all workings and formulae. There is no given graph. You need to make the graph
Question 1 Katherine Mofokeng is the owner of a recycling company that specialises in collecting and recycling paper products. Katherine's company uses two different recycling processes to convert newspaper, mixed paper, white office paper and cardboard into paper pulp. The amount of paper pulp extracted from the recyclable materials and the cost of extracting the pulp differs depending on which recycling process is used. The following table summarises the recycling process: For example, every ton of newspaper subjected to recycling process 1 costs $13 and yields 0.9 tons of paper pulp. The paper pulp goes through other operations to be transformed into pulp for newsprint, packaging paper or print stock quality paper. The yields associated with transforming the recycled pulp into pulp for the final products is given in the following table: For example, a ton of pulp exiting recycling process 2 can be transformed into 0.95 tons of packaging paper pulp at a cost of $8. Katherine currently has 70 tons of newspaper. 50 tons of mixed paper. 30 tons of white office paper and 40 tons of cardboard. She would like to determine the most efficient way of converting these materials into 60 tons of newsprint pulp, 40 tons of packaging paper pulp and 50 tons of print stock pulp. a. Graphical representation of Recycling project as a generalized network flow problem (10 Marks) b. Formulate the problem as a linear programming problem. (See hint) (10 Marks) c. Use solver to determine the optimal allocation (10 Marks) Hint: Use the table of constraint coefficients for linear programming: A=a11a21am1a12a22am2a1na2namnStep by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
