Question: Consider the following linear programme: Min x1 x2 s:t x1 2x2 7 2x1 x2 5 x1 6x2 11

Consider the following linear programme: Min x1 þ x2 s:t x1 þ 2x2  7 2x1 þ x2  5 x1 þ 6x2  11 x1; x2  0

a. Solve this problem using the graphical solution procedure.

b. Calculate the range of optimality for the objective function coefficient of x1.

c. Calculate the range of optimality for the objective function coefficient of x2.

d. Suppose the objective function coefficient of x1 is increased to 1.5. Find the new optimal solution.

e. Suppose the objective function coefficient of x2 is decreased to one-third. Find the new optimal solution.

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 Project Managers Questions!

Q:

Consider the following LP Min z = x1 + x2 s.t x1 - 2x2 4 2x1 + x2 -2 x1 - x2 -3 x1, x2 0 a. (25 pts) Graphically solve this LP. You need to draw all the constraints, shade the feasible region, draw...

Q:

Explain the management implications of sensitivity analysis. leads to the formulation: Max 40F 30S s:t 2 /5F 1 /2 S 20 Material 1 1 /2 S 5 Material 2 3 /5F 3 /10 S 21 Material 3 F; S 0 Use the...

Q:

atar University, College of Engineering Advanced Operations Research, IENG 331 Spring 2017 Instructor: Dr. A.Sleptchenko Homework 26/05/2017 Contains 6 problems (120 points) 1. (20 points) Dual...

Q:

Consider the following linear programme: Max 3x1 + 2x2 s.t. 1x1 + 1x2 10 3x1 + 1x2 24 1x1 + 2x2 16 x1, x2 0 a) Find the optimal solution using the graphical solution procedure. b) If the objective...

Q:

Consider the following linear program: max x1 +2x2 s.t. x1 x2 2 x1 + x2 4 x1 2.5 x2 3 x1, x2 0 (a) Graph the feasible region of the LP. Is the feasible region unbounded? (b) Are any of the above...

Q:

RESEARCH OPERATION CLEAR FORMATTING QUESTION ONE a) Operations Research involves the use of mathematical models to aid in better decision making. Clearly define the following models and indicate...

Q:

4x3 + x2 Task 1 (50 points) Consider the following LP problem: maximize 3x1 + 2x2 + s.t. X1 + 2x3 4 2x1 + 3x3 5 5 2xi + x2 + 3x3 5 7 X1, X2X3, X4 > 0 and call x4, X5, X6 the three slack variables to...

Q:

In the rest of this chapter, we lead the reader through the formulation of several more complicated linear programming models. The most important step in formulating an LP model is the proper choice...

Q:

ARTIFICIAL STARTING SOLUTION (10 points each) 1. Consider the following set of constraints: X1 + x2 + x3 = 7 2x1 5x2 + x3 > 10 X1, X2, X3 20 (a) Maximize z = 2x1 3x2 - 5x3 (Use M-Method) (b) Minimize...

Q:

2. (25 pts. Consider the following problem. Maximize Z=2x1 + 5x2 + 3x3 St. X1 - 2x2 + 3x3 20 2x1 + 4x2 + x3 = 50 x1 + x2 + 3x3 3 4 .X1 x3 > -1 - and X1, X2, 3 > 0 a Reformulate this problem to fit...

Q:

Derek is a police officer in Auckland. His house is located on a large corner site on a main street, which provides good exposure to passing traffic. He was approached by a heat pump company who...

Q:

E 3-1A (LO2) Cash bal: $1,200 (Dr.) FOOT AND BALANCE A T ACCOUNT Foot and balance the cash T account shown below. 500 400 600 Cash 100 200

Q:

You short - sell 2 0 0 shares of Tuckerton Trading Company, now selling for $ 5 6 per share. What is your maximum possible gain, ignoring transactions cost? Multiple Choice $ 5 6 $ 1 1 , 2 0 0 $ 1 4...

Q:

Sunset Homes manufactures prefabricated chalets in Colorado. The company uses a perpetual inventory system and a job cost system in which each chalet is a job. The following events occurred during...