Question: A small fabrication firm makes three basic types of components for use by other companies. Each component is processed on three machines. Total capacities (in hours) are 1,600 for machines 1; 1,400 for machine 2; and 1,500 for machine 3. The processing times are as follows: Processing Time (hr) Machine 1 Machine 2 Machine 3 Component A 0.25 0.10 0.05 B 0.20Show transcribed image text 100% (1 rating)Transcribed image text: A small fabrication firm makes three basic types of components for use by other companies. Each component is processed on three machines. Total capacities (in hours) are 1,600 for machines 1; 1,400 for machine 2; and 1,500 for machine 3. The processing times are as follows: Processing Time (hr) Machine 1 Machine 2 Machine 3 Component A 0.25 0.10 0.05 B 0.20 0.15 0.10 с 0.10 0.05 0.15 Each component contains a different amount of two basic raw materials. Raw material 1 costs $0.20 per ounce, and raw material 2 costs $0.25 per ounce. At present, 206,000 ounces of raw material 1 and 90,000 ounces of raw material 2 are available. Requirements (oz/unit) Raw Material 1 Raw Material 2 12 Component A Selling Price ($/unit) 32 39.00 26.65 B 27 16 с 20 9 23.40 a. Assume that the company must make at least 1,200 units of component B, that labor costs are negligible, and that the objective is to maximize profits. Specify the objective function nd constraints for the problem. Objective function: Maximize Z= 29.6 A 17.258 17.15 C. (Enter your responses rounded to two decimal places.) Constraints (enter your responses rounded to two decimal places): 0.25 A 0.20 B 0.10 C s 1600 Machine 1 (C₁) Machine 2 (C₂) 0.10 A 0.15 B 0.05 C = 1400 Machine 3 (C₁) 1500 0.05 A 0.10 B 0.15 C s 32 A 27 B 20 C < Material 1 (C₂): Material 2 (C) 12 A 16'B 9C s 90000 Minimum for product (C₂) B2 1,200 Nonnegativity: A 20, B20, C20 b. A linear programming software shows the optimal solution as: B=1,200 and C= 0. What is the optimal value for A? A=(Enter your response rounded to the nearest whole number) 206000

*Related*