The LP problem whose output follows determines how many necklaces, bracelets, rings, and earrings a jewelry store should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Constraints 3 and 4 are marketing restrictions. LINEAR PROGRAMMING PROBLEM MAX 100X1+120X2+150X3+125X4 S.T. 1) X1+2x2+2x3+2X450 OPTIMAL SOLUTION Objective Function Value = 7475.000 Variable X1 Value 8.000 0.000 X2 X3 X4 Reduced Cost 0.000 5.000 0.000 0.000 17.000 33.000 Constraint 1 2 Slack/Surplus 0.000 63.000 0.000 0.000 Dual Price 75.000 0.000 25.000 -25.000 3 4 OBJECTIVE COEFFICIENT RANGES Variable X1 X2 X3 X4 Lower Limit 87.500 No Lower Limit 125.000 120.000 Current Value 100.000 120.000 150.000 125.000 Urrer Limit No Upper Limit 125.000 162.500 150.000 RIGHT HAND SIDE RANGES Constraint 1 2 Lower Limit 100.000 57.000 8.000 41.500 Current Value 108.000 120.000 25.000 50.000 Upper Limit 123.750 No Upper Limit 58.000 54.000 3 4 Use the output to answer the questions. e. f. 8 h. i. j. k. 1. How much space will be left unused? How much time will be used? By how much will the second marketing restriction be exceeded? What is the profit? To what value can the profit on necklaces drop before the solution would change? By how much can the profit on rings increase before the solution would change? By how much can the amount of space decrease before there is a change in the profit? You are offered the chance to obtain more space. The offer is for 15 units and the total price is 1500. What should you do