Math Problem Statement
Constraints Component Manufacturing Time (seconds per unit) Forecasted demand Manufacturing time Base 1.5 2500 Financial Manager calculators 300 hours Financial cartridge 3 2000 Technician calculators Technician cartridge 2.5 Financial top 1 Technician top 1.2
Cost information for the objective Component Manufacture Cost per Unit Purchase Price per Unit Base 0.4 0.5 Financial cartridge 3.85 4.5 Technician cartridge 3.2 4.3 Financial top 0.65 0.7 Technician top 0.72 0.85
Follow the Make-or-Buy example, update information for constraints and the objective in Excel, and Run Solver to solve this optimization problem.
How many units of financial tops must be manufactured by the Janders Company? Round the answer to the nearest integer.
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
Cost Minimization
Formulas
Total cost = 0.65 * x_1 + 0.7 * x_2
x_1 + x_2 = 2000
1 * x_1 ≤ 1,062,850 (manufacturing time constraint)
Theorems
Linear optimization methods (Simplex method)
Solver algorithm for optimization problems
Suitable Grade Level
Grades 10-12
Related Recommendation
Linear Programming: Minimizing Shipping Costs for Engine Distribution
Maximize Revenue Using Linear Programming and Simplex Algorithm
Solving Linear Programming Problems Using Graphical Method and Excel Solver
Maximizing Income from Biscuits Using Linear Programming
Maximization of Profit in a Linear Programming Problem with Three Products