Question Completion Status: QUESTION 30 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. Space The Obi Whose LINEAR PROGRAMMING PROBLEM MAX 100X1+120X2+150X3+125X4 S.T. 1) X1+2X2+2X32X450 OPTIMAL SOLUTION Objective Function Value - 7475.000 Variable Value Reduced Cost Click Save and Submit to save and submit. Click Save All Answers to save all answers Answer Report Sensitivity Report 1 Limits Report 1 Answer Report 2 S ensitivity Report 2 Limits Report 2 Objective Function Vain - 7475.000 Variable Value 8.000 0.000 17.000 33.000 Reduced Cost 0.000 5.000 0.000 0.000 Constraint Slack/Surplus 0.000 63.000 0.000 0.000 OBJECTIVE COEFFICIENT RANGES Dual Price 75.000 0.000 25.000 25.000 Variable Table Lower Limit X1 X2 Current Value 100.000 7 Lower Limit 87.500 No Lower Limit 125.000 120.000 X3 120.00 Upper Limit No Upper Limit 125.000 162.500 150.000 150.000 125.000 X4 RIGHT HAND SIDE RANGES Constraint 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 Use the output to answer the questions. How many necklaces should be stocked? Now many bracelets should be stocked? How many rings should be stocked? How many earrings should be stocked? 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