Math Problem Statement
Problem 4-75 (Algo) Optimum Product Mix (LO 4-4) Talbot Industries manufactures two models of wireless headset: TI-12 and TI-28. Each product requires time on a single machine. The machine has a monthly capacity of 624 hours. Total market demand for the two products is limited to 2,140 units of TI-12 and 1,070 units of TI-28 monthly. Talbot is currently producing and selling 1,570 TI-12 models and 794 TI-28 models each month. Cost and machine-usage data for the two products are shown in the following spreadsheet, which analysts at Talbot use for production planning purposes:
TI-12 TI-28 Total Price $ 94 $ 332 Less variable costs per unit Material 30 97 Labor 36 71 Overhead 8 41 Contribution margin per unit $ 20 $ 123 Fixed costs Manufacturing $ 34,700 Marketing and administrative $ 31,700 $ 66,400 Machine hours per unit 0.1 0.5 Machine hours used 554 Machine hours available 624 Quantity produced 1,570 794 Maximum demand 2,140 1,070 Profit $ 62,662
Required:
a. What is the optimal production schedule for Talbot Industries? In other words, how many TI-12s and TI-28s should the company produce each month to maximize monthly profit?
b. If Talbot Industries produces at the level found in requirement (a), how much will monthly profit increase over the current production schedule?
Solution
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Linear Programming
Optimization
Profit Maximization
Formulas
Profit = 20 * TI-12 + 123 * TI-28
Machine hours constraint: 0.1 * TI-12 + 0.5 * TI-28 ≤ 624
Demand constraints: TI-12 ≤ 2,140, TI-28 ≤ 1,070
Theorems
Linear Programming
Maximization under Constraints
Suitable Grade Level
College-level Economics/Operations Research
Related Recommendation
Maximizing Profit for TV Production: Linear Programming Problem
Setting Up a Linear Programming Model: Maximizing Profit with Machine Constraints
Maximize Profit with Linear Programming: A and B Product Production
Linear Programming Problem: Maximize Profit for Two Products A and B
Linear Programming Problem: Maximizing Profit for Two Products with Time Constraints