SUPPLEMENTARY LAB SHEET NO 7.

NAME OF STUDENT:
GROUP:
DATE:

LEVEL OF OPENNES: 2 (66%)

Learning Outcomes:

At the end of the laboratory activities, students would be able to:

a) to use the MATLAB built-in command to solve the optimization problem based on linear
programming technique (CO2:PO4)
b) to write MATLAB script and function on solving the optimization problem based on linear
programming technique (CO2:PO4)
c) to use Microsoft Excel to solve the optimization problem based on linear programming
technique (CO2:PO4)

PROBLEM

Problem Statement

Tasek Cement Sdn. Bhd. Cement manufactured two cement products: Cement Chap Bunga and
Cement Chap Buaya. The assembly process for each product is similar on that both requires separation
and packaging phase. Each Cement Chap Bunga takes 3 hours of separation and 2 hours of packaging
phase. Each Cement Chap Buaya must go through 2 hours of separation and 1 hour of packaging.
During the next production period, 240 hours of separation phase time are available and up to 140
hours of packaging time may be used. Each Cement Chap Bunga sold yields a profit of RM25, and RM
15 profit for each unit sold for Cement Chap Buaya.

a) Formulate and solve the given problem to find the best combination of Cement Chap Bunga
and Cement Chap Buaya that yields the highest profit. Use MATLAB and Microsoft Excel solver
as the tool to help you.

b) The company realise that it forgot to include another two critical constraints. In particular, the
management decides that to ensure an adequate supply of Cement Chap Bunga for a contract,
at least 20 unit of this cement type should be manufactured. Because Tasek Cement Sdn. Bhd.
Incurred oversupply of Cement Chap Buaya in the preceding period, the management also
insists that no more than 80 units of Tasek Chap Buaya be produced during this production
period. Investigate and solve on this new product mix problem to find the new optimal
solution using MATLAB and Microsoft Excel solver. Comment on the new solution as
compared to solution provided previously in a).