Question: 1. The following is the computer solution from a LP problem. Optimal Objective Value =1250.00000 Variable X1 X2 X3 Value 25.00000 0.00000 25.00000 Reduced Cost

1. The following is the computer solution from a

1. The following is the computer solution from a LP problem. Optimal Objective Value =1250.00000 Variable X1 X2 X3 Value 25.00000 0.00000 25.00000 Reduced Cost 0.00000 -7.50000 0.00000 Constraint 1 2 3 4 5 Slack/Surplus 8.75000 2.50000 0.00000 0.00000 15.00000 Dual Value 0.00000 0.00000 12.50000 10.00000 0.00000 Variable X X2 X3 Constraint 1 2 3 4 5 Objective Coefficient Allowable Increase Allowable Decrease Missing #1 Infinite 10,00000 50.00000 Missing #2 Infinite 20.00000 10.00000 4,28571 O RHS Value Allowable Increase Allowable Decrease 40.00000 Infinite 8.75000 40.00000 Infinite 2.50000 100.00000 6.66667 100.00000 0.00000 5.00000 25.00000 0.00000 15.00000 Infinite Answer the following questions accordingly. 1) What is the optimal solution? (+5 points) 2) What is the value of "Missing #1"? (+5 points) 3) Which constraints are binding? (+5 points) 4) Give the range of feasibility for Constraint 1 and explain it (+5 points) 5) If this is a maximization problem, what is the type of constraint 1? That is, is the LHS of Constraint I S.=, or the RHS of Constraint 1? (+5 points) 6) What is the value of Missing #2"? (+5 points)

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!