Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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 =9x1+6x2,
Subject to
Constraint 1: 5x1+3x2>=30,
Constraint 2: 2x1+5x2>=33,
Constraint 3: x1,x2>=0,
where x1 and x2 represent the decision variables. Solve the LP problem to answer the following questions.
What are the values of x1 and x2 at the optimal solution? What is the minimum value of z?
Note: Round your answers to 2 decimal places.
Identify the binding and nonbinding constraints and report the surplus value, as applicable.
Note: If the answer to constraints is "Non-Binding" 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 2 decimal places or leave cells blank.
What is the range of optimality for the two objective function coefficients?
Note: Round your answers to 1 decimal place.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Understanding And Managing Public Organizations

Authors: Hal G. Rainey

5th Edition

9781118583715

More Books

Students also viewed these General Management questions

Question

Why could the Robert Bosch approach make sense to the company?

Answered: 1 week ago