Question: Consider the Linear Program: MAXIMIZE Z = 5X 1 + 8X 2 Subject to: X 1 + 2X 2 < = 62 2 X 1

Consider the Linear Program: MAXIMIZE Z = 5X1 + 8X2

Subject to: X1 + 2X2 < = 62

2 X1 + 2X2 <= 100

4X1 + 7X2 >= 224

X1 and X2 >= 0

a. Sketch the Region of Feasible solutions and list all corner point of the region of feasible solution

b.Calculate the number of units of slack in constraint1: X1 + 2X2 <= 62

c. calculate the number of units of surplus in constraints3: 4X1 + 7X2 >= 224

d. specify the two binding constraints for this problem at the optimal solution

e. calculate ( derive by hand) the shadow price for an additional unit added to the RHS of constraint2: 2 X1 + 2X2 100 ( keep 3 decimal place in your calculations)

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!