Question: GRAPHICAL SENSITIVITY ANALYSIS (4 MARKS) The optimal solution of the linear programming problem is at the intersection of constraints 2 and 3. Max x1 +

GRAPHICAL SENSITIVITY ANALYSIS (4 MARKS) The optimal solution of the linear programming problem is at the intersection of constraints 2 and 3. Max x1 + x2 s.t. 4x1 + 1x2 < 400 4x1 + 3x2 < 600 1x1 + 2x2 300 x1 , x2 > 0 a) Over what range (optimality range) can the coefficient of x1 vary before the current solution is no longer optimal? (2 marks) b) Over what range (optimality range) can the coefficient of x2 vary before the current solution is no longer optimal? (2 marks) Notice: You do not need to draw any graphs to solve this problem. Show the details of your calculations. Last page

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!

I need help pleaseThe optimal solution of this linear programming problem is atthe intersection of constraints 1 and 2. Max 5x1 + 3x2 St. 4x1 + x2? 400 4x1 + 3x2 ? 600 x1 + 2x2 ? 300 x1, x2 ? 1 answer

Which of the following is not acceptable as a constraint in a linear programming problem? Constraint 1 X + XY + Y 12 Constraint 2 X - 2Y 20 Constraint 3 X + 3Y = 48 Constraint 4 X + Y + Z 150 A....

Q1: Solve the following problem graphically: Maximize Z=3x=9 Subject to the constraints: x+3y = 60 x+y2 10 XS where xy20 (25 Marks) Q2: The below table defines the activities within a small project....

For the following linear programming problem: Max 2x1 + x2 s.t. 4x1 + 1x2 400 4x1 + 3x2 600 1x1 + 2x2 300 x1, x2 0 (a) Find the optimal solution by graphical method. (b) Over what range can the...

The optimal solution of this linear programming problem is at the intersection of constraints 1 and 2. Max 6 x 1 + 3 x 2 s.t. 4 x 1 + x 2 400 4 x 1 + 3 x 2 600 x 1 + 2 x 2 300 x 1 , x 2 0 (a) Over...

The optimal solution of this linear programming problem is at the intersection of constraints 1 and 2 . Max 2 x 1 + x 2 s . t . 4 x 1 + 1 x 2

The optimal solution of this linear programming problem is at the intersection of constraints 1 and 2. Max s.t. 2x1 + x2 4x1 + 1x2

0.5 points The optimal solution of this linear programming problem is at the intersection of constraints 2 and 3 \[ \begin{array}{l} \text { Max } 3 x_{1}+4 x_{2} \\ \text { st } \quad 4 x_{1}+1 x_{2}

3 Use the Big M method and the two-phase method to nd the optimal solution to the following LP: max z 5x1 x2 s.t. 2x1 x2 6 s.t. x1 x2 4 s.t. x1 2x2 5 x1, x2 0 4 Use the simplex algorithm to nd the...

Problem 1 (20 points) Personal Mini Warehouses is planning to open a new branch in Manitoba. In doing so,the company must determine how many storage rooms of each size to build. The company builds...

To protect the privacy of individuals identified in information systems maintained by federal agencies, the Privacy Act of 1974 regulates the use of the information. The statute provides for a...

Make a list of different federal taxes in order of their progressiveness. If the federal government were to trade in income taxes for consumption or sales taxes, what would be the effect in terms of...

4. A pyramid with a triangular base has a volume of 50 cm. If the base and the height of the triangular base are 5 cm and 8 cm respectively, find the height of the pyramid.

When older adults have difficulty with transportation and communication, or may be reluctant to request needed assistance to which they are entitled, they may be in need of: Group of answer choices...