Question: Consider the following LP problem. Maximize z = 2 . 8 9 x 1 + 1 . 9 6 x 2 , Subject to Constraint

Consider the following LP problem.
Maximize z =2.89x1+1.96x2,
Subject to
Constraint 1: 2x1+3x2=40,
Constraint 2: 3x1+ x2=30,
Constraint 3: x1,x2>=0,
where x1 and x2 represent the decision variables. Solve the LP problem to answer the following questions.b. Identify the binding and nonbinding constraints and report the slack value, as applicable.
Note: If the answer to constraints is "Non-Binding" enter slack value to 2 decimal places or leave cells blank.
c. Report the shadow price and range of feasibility of each binding constraint.
Note: If the answer to constraints is "Binding" enter the "Shadow price" and "Range of feasibility" to 2 decimal places or leave
cells blank.
d. What is the range of optimality for the two objective function coefficients?
 Consider the following LP problem. Maximize z =2.89x1+1.96x2, Subject to Constraint

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!