Question: the resources. Question 3: (15 pts) Consider a LP problem as following Maximize Z= 2X, +4X2 + 3X3, subject to: X1 + 3X2 + 2X3

the resources. Question 3: (15 pts) Consider a LP

the resources. Question 3: (15 pts) Consider a LP problem as following Maximize Z= 2X, +4X2 + 3X3, subject to: X1 + 3X2 + 2X3 = 20 X1 + 5X2 > 10 X120, X220, X3 20. Let S, be the artificial variable for the first constraint. Let S2 and Sz be the surplus variable and artificial variable, respectively, for the second constraint. You are now given the information that a portion of the final simplex tableau is as follows: Coefficient of: A Basic Variable Eq. xl x2 x3 Si S2 S3 side Z (0) 1 M+2 0 M 2 O x1 (1) 0 1 0 0 S2 (2) 0 1 1 -1 N Right hand Extend the fundamental insight to identify the missing numbers in the final simplex tableau. Show your 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!

Solve the following linear-programming problem by means of the simplex method. Maximize z = 2x2 + 4x2 + 3x3 subject to: 3x2 + 4x2 + 2x3 = 60 2x1 + x2 + 2x3 = 40 X1 + 3x2 + 2x3 = 80 X1 = 0, x2 > 0, x2...

Given the following primal problem: maximize z = 2x + 4x2 + 3x3 subject to x + 3x2 + 2x3 20 x1 + 5x2 > 10 x + 2x + x3 18 X3 0 X1, X2, Find the optimal solution to this problem by applying initially...

PLEASE ANSWER 4. Consider the following problem. Maximize z = 2x: + 4x2 + 3x3, subject to X1 + 3x2 + 2x3 = 20 X: + 5x2 > 10 and X120, X220, X; 20. Let It be the artificial variable for the first...

For each of the following linear programming models, give your recommendation on which is the more efficient way (probably) to obtain an optimal solution: by applying the simplex method directly to...

Consider the following problem. Maximize Z = 2x1 + 4x2 + 3x3, subject to X1 + 3x2 + 2x3 s 30 X1 + x2 + x3 S 24 3x1 + 5x2 + 3x3 ...

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...

DI 7.2-4. Consider the following problem. Maximize Z = 2x1 + 7x2 3x3, subject to X1 + 3x2 + 4x3 = 30 x1 + 4x2 x3 = 10 and X1 20 x2 = 0, X3 20. By letting x4 and x5 be the slack variables for the...

Problem 1: For each of the following linear programming models, give your recommendation on which is the more efficient way (probably) to obtain an optimal solution: by applying the simplex method...

Consider the following problem. Minimize W 5y1 4y2, subject to 4y1 3y2 4 2y1 y2 3 y1 2y2 1 y1 y2 2 and y1 0, y2 0. Because this primal problem has more functional constraints than...

Jill Biggins works for Craighead Count and the City of Jonesboro School District. She is a custodian at the Craighead County Court House (currently meeting in a Church) and a cook for the School...

Mop and Broom Manufacturing is evaluating whether to produce a new type of mop. The company is considering the operations requirements for the mop as well as the market potential. Estimates of fixed...

recently there has been a hike in Merges and Acquisitions in African markers by finance companies. This is an example of which one of the following mentioned below: 1 . policies 2 . adaptability 3 ....

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...