QI. A company makes three types of chocolates and packages them in three types of packs. Pack I contains 4 white, 4 coco, and 12 milk chocolates, and sells for $9.40. Pack II contains 12 white, 4 cocoa, and 4 milk candies, and sells for $7.60. Pack III contains 8 white, 8 cocoa, and 8 milk chocolates, and sells for $ 11.00. Manufacturing costs per piece of chocolate are $0.20 for white, $0.25 for cocoa, and S 0.30 for milk. They can make 5,200 white, 3,800 cocoa, and 6,000 milk chocolates weekly. How many packs of cach type should the company produce each week in order to maximize its profit? What is the maximum profit? 1. Compute the profit for each type of packs. 2. Formulate the problem into a linear programming problem (LPP). 3. Solve the LPP for an optimal solution. 4. Determine the solution of the dual problem from the primal solution. 5. Write the dual of the problem in part 2. 6. Use dual simplex method to solve the problem in part 5 and verify your solution with that of part 4.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter6: Optimization Models With Integer Variables
Section6.4: Fixed-cost Models
Problem 12P
icon
Related questions
Question
QI. A company makes three types of chocolates and packages them in three types of packs. Pack I contains 4
white, 4 coco, and 12 milk chocolates, and sells for $9.40. Pack II contains 12 white, 4 cocoa, and 4 milk candies,
and sells for $7.60. Pack III contains 8 white, 8 cocoa, and 8 milk chocolates, and sells for $ 11.00. Manufacturing
costs per piece of chocolate are $0.20 for white, $0.25 for cocoa, and S 0.30 for milk. They can make 5,200 white,
3,800 cocoa, and 6,000 milk chocolates weekly. How many packs of cach type should the company produce each
week in order to maximize its profit? What is the maximum profit?
1. Compute the profit for each type of packs.
2. Formulate the problem into a linear programming problem (LPP).
3. Solve the LPP for an optimal solution.
4. Determine the solution of the dual problem from the primal solution.
5. Write the dual of the problem in part 2.
6. Use dual simplex method to solve the problem in part 5 and verify your solution with that of part 4.
Transcribed Image Text:QI. A company makes three types of chocolates and packages them in three types of packs. Pack I contains 4 white, 4 coco, and 12 milk chocolates, and sells for $9.40. Pack II contains 12 white, 4 cocoa, and 4 milk candies, and sells for $7.60. Pack III contains 8 white, 8 cocoa, and 8 milk chocolates, and sells for $ 11.00. Manufacturing costs per piece of chocolate are $0.20 for white, $0.25 for cocoa, and S 0.30 for milk. They can make 5,200 white, 3,800 cocoa, and 6,000 milk chocolates weekly. How many packs of cach type should the company produce each week in order to maximize its profit? What is the maximum profit? 1. Compute the profit for each type of packs. 2. Formulate the problem into a linear programming problem (LPP). 3. Solve the LPP for an optimal solution. 4. Determine the solution of the dual problem from the primal solution. 5. Write the dual of the problem in part 2. 6. Use dual simplex method to solve the problem in part 5 and verify your solution with that of part 4.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Optimization models
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,