Question: Consider the following Linear Programming problem, in which X and Y denote the number of units of products X and Y to be produced, respectively,

Consider the following Linear Programming
Consider the following Linear Programming
Consider the following Linear Programming problem, in which X and Y denote the number of units of products X and Y to be produced, respectively, and Z denotes the overall resulting profit Objective Function Maximize Z = $4X + $5Y Subject to X + 2Y = 10 (labor available, in hours) 6X + 6Y S 36 (material available, in pounds) (storage available, in square feet) X, Vzo The Excel Sensitivity Report for this problem is given below. Answer the following questions and provide calculations of your answers. Each question is independent of the others. Adjustable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient increase Decrease $C$5 X 20 4 1 15 $D$5 Y 4053 1 Constraints Final Shadow Cell Name Value Price Constraint Allowable Allowable R.H. Side Increase Decrease 10 SES7 Labor SE$8 Material $E$9 Storage 101 36 05 32 401E+30 (A) How much excess labor and storage capacity there are in the optimal solution? Provide your answers in numerical digits only. Approximate to two decimal digits if needed. ANSWER: Excess Labor Hours ANSWER: Excess Storage = Square Feet (B) How does the total profit change if you give up 1 hour of labor and get additional 15 pounds of material?! ANSWER: The profit would by S How does the total profit change if you decided to introduce a new product that has a profit contribution of $2 per unit, given that each unit of this product will use 1 hour of labor, 1 pound of material and 2 square feet of storage? ANSWER: The profit would bys

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!