Question: The following linear programming problem has been solved by the management scientist. Use the output to answer the questions. LINEAR PROGRAMMING PROBELM MAX 25x1 +

The following linear programming problem has been solved by the management scientist. Use the output to answer the questions.

LINEAR PROGRAMMING PROBELM

MAX 25x1 + 30x2 + 15x3

s.t.

  1. 4x1 + 5x2 + 8x3 < 1200
  2. 9x1 + 15x2 + 3x3 < 1500

OPTIMAL SOLUTION
objective Function Value = 4700.000

variablevaluereduced costs
x1140.0000.000
x20.00010.000
x380.0000.000
constraintslack/surplusdual prices
10.0001.000
20.0002.333

OBJECTIVE COEFFICIENT RANGES

variablelower limitcurrent valueupper limit
x119.28625.00045.000
x2no30.00040.000
x38.33315.00050.000

RIGHT HAND SIDE RANGES

constraintlower limitcurrent valueupper limit
1666.6671200.0004000.000
2450.0001500.0002700.000

a. give the complete optimal solution

b. which constraints are binding?

c. what is the dual price for the second constraint? what interpretation does this have?

d. over what range can the objective function coefficient of x2 vary before a new solution point becomes optimal?

e. by how much can the amount of resource 2 decrease before the dual price will change?

Step by Step Solution

3.49 Rating (152 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Solution a The complete optimal solution is x1 140 x2 0 x3 80 b The constraints t... View full answer

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!