Question: Consider the following LP problem. Minimize z = 9 x 1 + 6 x 2 , Subject to Constraint 1 : 5 x 1 +
Consider the following LP problem.
Minimize z xx
Subject to
Constraint : xx
Constraint : xx
Constraint : xx
where x and x represent the decision variables. Solve the LP problem to answer the following questions.
What are the values of x and x at the optimal solution? What is the minimum value of z
Note: Round your answers to decimal places.
Identify the binding and nonbinding constraints and report the surplus value, as applicable.
Note: If the answer to constraints is "NonBinding" enter surplus value or leave cells blank.
Report the shadow price and range of feasibility of each binding constraint.
Note: If the answer to constraints is "Binding" enter "Shadow price" and "Range of feasibility" to decimal places or leave cells blank.
What is the range of optimality for the two objective function coefficients?
Note: Round your answers to decimal place.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
