Question: Consider the following LP problem: Maximize 2x1 + x2 - x3 Subject to x1 + 2x2 + x3 8 -x1 + x2 - 2x3 4

Consider the following LP problem: Maximize 2x1 + x2 - x3 Subject to x1 + 2x2 + x3 8 -x1 + x2 - 2x3 4 x1, x2, x3 0 With the Final Simplex tableau with the optimal value z=16: z x1 x2 x3 x4 x5 RHS -------------------------- 1 0 3 3 2 0 16 0 1 2 1 1 0 8 0 0 3 -1 1 1 12 If the following new constraint is added x2 + 2x3 3 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 General Management Questions!

a) (4 points) Suppose that the coefficient of x2 in the objective function is changed from 1 to 6. Does the current bfs remain optimal? If not, just name the entering variable (no need to do simplex...

2. Consider the following LP: minimize z = 2x1 + 3x2 + x3 subject to X1 + 4x2 + 2x3 > 8 3x1 + 2x2 > 6 X1, X2, X3 > 0. (a) Using the Big M method, construct the complete first simplex table for the...

please assist QUESTION 3 Consider the following problem Maximize Z = 2x1 + x2 + x3 subject to 3x1 + x + x = 6 21x2 + 2x3 1 x1 + x2 + x3 = 2 and x3 0.x2 2 0,43 20 (a) Work through the simplex method...

What happens to your current optimal solution if the company considers to use a new material, material C; in producing the 3 products? Daily availability of Material C is 200 kg. Product 1 requires 2...

thank you 1 . 6 marks Consider the following linear program: Maximize: 2x1 - X2 + 3x3, subject to: X1 + 20 2 - 20 2 IAIAIN - 21 +2 02 - 23 3. and x1 2 0, x2 2 0, X3 2 0. (a) Set up the auxiliary...

Problem 3 Use the Simplex method to solve the following LP problem: Maximize Z= 2X2 + X3 subject to X - X2 + X3 55 -2X1 + X2 $3 X2 + 2X3

I have completed parts A-D. can you help on E & F Consider the following LP model: Maximize Z = 3x1 + 2x2 subject to x1 + x2 3 2x1 + x2 4 and x1 0, x2 0 a. (8 pts) Transform the two problem...

Consider the following problem. Maximize Z = 2x1 + 5x2 + 3x3, subject to x1 - 2x2 + x3 20 2x1 + 4x2 + x3 = 50 and x1 0, x2 0, x3 0. (a) Using the Big M method, construct the complete first simplex...

Consider the following LP problem: Maximize : = 2x1 + 3x2 - 533 Subject to: *1 + x2 + x3 = 7 2x1 - 5x2 + x3 210 *1, X2, X3 20 If the problem is solved using the M method or the Two-Phase method, the...

2. Consider the following problem. Maximize Z = 2x1 + 7x2 + 4x3 subject to X1 + 2x2 + x3 = 10 3x1 + 3x2 + 2x3 = 10 X1 20, X220, X3 20 (a) Construct the dual problem for this primal problem. (b) Use...

What is the difference between comparative financial statements and common-size comparative statements?

Discuss how do you focus regular light to make it a laser beam? Explain in detailed giving examples.

6 Arun and Marcus are 400 metres apart. They run towards each other. This graph shows their distances from Arun's starting point. a b How long does Arun take to run 200m? How far does Arun run every...

Create a C# application named SalesTransactionDemo that declares several SalesTransaction objects and displays their values and their sum. The SalesTransaction class contains the following fields:...