Question: Question 4 (50%). Consider the following problem. Maximize Z= 2x1 + 22 423 + 3x4 subject to -21 + 2 + 3x3 + 2x4 >

Question 4 (50%). Consider the following problem.

Question 4 (50%). Consider the following problem. Maximize Z= 2x1 + 22 423 + 3x4 subject to -21 + 2 + 3x3 + 2x4 > 2 23 24 1 -2x1 + 0 (j = 1, 2, 3, 4). | + + X1 (1) (2) (3) (4) 22 = = Let M +0. Let ej and aj be the excess and artificial variables for the constraint 1. Let az and be the corresponding artificial variables. Let s3 be the slack variable for the constraint 3. After you apply the simplex method, a portion of the optimal simplex tableau is as follows: a4 X2 C3 a1 a2 04 RHS BV Z Z 1 ei 0 0 S3 0 0 X 1 0 0 1 0 0 X4 0 1 0 0 0 0 0 0 0 0 0 -1 1 1 2 1 2 4 0 0 1 1 0 Based on the above tableau, use the fundamental insight to identify the missing entries in the final simplex tableau. Find the optimal solution for (21, 22, 23, 24) and the associated value for Z. Show all 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!

Consider the following problem. + ++ | = Maximize Z= 2x1 + 22 4x3 + 3x4 subject to -21 22 + 3x3 + 2x4 > 2 (1) 21 23 24 1 2 -2x1 + 12 0(j = 1, 2, 3, 4). Let M +0. Let ej and ai be the excess and...

(25 pts. Consider the following problem. Maximize Z=- 2x1 + x2 - 4x3 + 3x4 s.t. x1 + x2 + 3x3 + 2x4 3 4 X1 X3 + x4 -1 2x1 + x2 s 2 X1 +2x2 + xy + 2x4 2 and X1, X2, X3, X4 20 a. Reformulate this...

Question 1 (50%). Consider the following problem: . = 21 Maximize Z= 2x1 + 5x2 + 3x3 subject to 2x2 + X3 > 20 2x1 + 4x2 + 23 50 X1 > 0, x2 > 0, X3 > 0. (1) (2) - (a) Let M +0. Construct the big-M...

Question 3 (50%). Consider the following problem. Maximize subject to Z = 4x1 + 2x2 + 3x3 + 5x4 2x1 + 3x2 + 4x3 + 2x4 = 8x1 + x2 + x3 + 5x4 = X; > 0 (j = 1, 2, 3, 4). 300 300 (a) Using the big-M...

Question 1 (50%). Consider the following problem: = X 1 X3 > 20 Maximize Z= 2x1 + 5x2 + 3x3 subject to 2x2 + 2x1 + 4x2 + X1 > 0, x2 > 0, X3 > 0. (1) (2) X3 = 50 (a) Let M +00. Construct the big-M...

4.8-7. Consider the following problem. Maximize Z= 2.x1 + 5 x2 + 3 x3, subject to x1 - 2x2 + x3 2 20 2x2 + 4x2 + x3 = 50 and x120, X220, *3 20. What is the initial Basic Feasible Solution for Problem...

5. Consider the following problem Maximize Z = 2x1 - 2x2 + 3x3, subject to -X1 + x2 + x3 = 4 2x1 - x2 + x3 = 2 X1 2-4 and x2 > 0 (no negativity constraint for x3) Reformulate this problem so that is...

Question 3. Consider the following problem: Maximize Z = 2x_1 + 5x_2 + 3x_3, Subject to x_1 - 2x_2 + x_3 20 2x_1 + 4x_2 + x_3 =50 x1 and x2 are non-negative Solve the problem using the Big M method...

Q2. (30 marks) Consider the following problem: Maximize Z = X1 + 3X2 Minimize Z2 = 4X1 + X2 Subject to 5X1 +2X2 10 X1 > 0, X2 > 0 a. Solve the problem separately for goal Z and Z2 (15 marks) b. Using...

Dustin is 135 lbs and moves from the 20-yard line to the 65-yard line mark in 5.8 seconds. What is Dustins linear momentum?

Tom and Faith are in a partnership sharing profits and losses in the ratio of 3/5 for Tom and 2/5 for Faith. The partnership deed provides for interest on capital at the rate of 5% and interest on...

The inventory turnover ratio is the annual sales of an inventory divided by its average monthly inventory on hand, it should be maintained at an optimal level, if turning the inventory more...

atch the compensation objectives with their meanings. Efficiency Efficiency drop zone empty. Fairness Fairness drop zone empty. Compliance Compliance drop zone empty. Improving performance and...