Question 1 PKG Electric makes two types of electric fans, ceiling fan and wall fans. Each ceiling fan requires two circuit boards and four hours assembly time. Each wall fan requires two circuit boards and one-hour assembly time. The profit of each ceiling fan and wall fan are RM25 and RM15 respectively. The company produces its own circuit boards and its capacity is 54 per week. Currently, the company has 48 hours of assembly time per week. The company wishes to maximize the profit. Let x = ceiling fan, y = wall fan Solve: 1. Formulate the problem as a linear programming model. 2. What is the maximum profit? 3. Later, the company was informed by its retailers that the demand for the wall fans is at most 12 units per week. What is the new maximum profit?
Question 1
PKG Electric makes two types of electric fans, ceiling fan and wall fans. Each ceiling fan requires two circuit boards and four hours assembly time. Each wall fan requires two circuit boards and one-hour assembly time. The profit of each ceiling fan and wall fan are RM25 and RM15 respectively. The company produces its own circuit boards and its capacity is 54 per week. Currently, the company has 48 hours of assembly time per week. The company wishes to maximize the profit.
Let x = ceiling fan, y = wall fan
Solve:
1. Formulate the problem as a linear programming model.
2. What is the maximum profit?
3. Later, the company was informed by its retailers that the demand for the wall fans is at most 12 units per week. What is the new maximum profit?
Question 2
Lee Chong Wei has two photocopy machines P and Q. Machine P can make at most 16 copies per minute, while machine Q can make at most 20 copies per minute. Lee Chong Wei wants to make at least 150 copies in 5 minutes. If each copy from machine P and Q costs 3 cents and 4 cents respectively, how can Lee Chong Wei make 150 copies and minimize his cost?
Solve:
1. List the linear programming formulas.
2. What is the solution?
3. What is the cost from the solution?
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 5 images
