Question 2 (10 points): Reiser Sports Products wants to determine the number of All-Pro

Question: Question 2 (10 points): Reiser Sports Products wants to determine the number of All-Pro (A) and College (C) footballs to produce in order to maximize profit over the next four-week planning horizon. Constraints affecting the production quantities are the production capacities in three departments: cutting and dyeing; sewing, and inspection and packaging. ForShow transcribed image texta) Feasible region is shaded in the graph b) Coordinates of extreme points and the corresponding profit are listed A…View the full answerTranscribed image text: Question 2 (10 points): Reiser Sports Products wants to determine the number of All-Pro (A) and College (C) footballs to produce in order to maximize profit over the next four-week planning horizon. Constraints affecting the production quantities are the production capacities in three departments: cutting and dyeing; sewing, and inspection and packaging. For the four-week planning period, 340 hours of cutting and dyeing time, 420 hours of sewing time, and 200 hours of inspection and packaging time are available. All-Pro footballs provide a profit of $5 per unit, and College footballs provide a profit of $4 per unit. The linear programming model with production times expressed in minutes is as follows: Max 5A 4C s.t. 12A 6C ≤ 20,400 9A 15C 25,200 Cutting and Dyeing Sewing Inspection and Packaging 6A 6C ≤ 12,000 A, C20 A portion of the graphical solution to the Reiser problem is shown in Figure. a Shade the feasible region for this problem. b. Draw the profit line (objective line) corresponding to a profit of $4000. Move the profit line as far from the origin as you can in order to determine which extreme point will provide the optimal solution. Which constraints are binding? Determine the coordinates of extreme point generates the highest profit? Calculate the highest profit? C 1000 1500 2000 2500 3000 Number of All-Pro Football Number of College Footballs 3500 3000- 2500 2000 1500 1000 500 0 500