Question: Section A Question 1 (50%). Consider the following problem. Z= 23 Maximize subject to 22 + 2:02 + 2x3 0, x2 > 0, X3 >

Section A Question 1 (50%). Consider the

Section A Question 1 (50%). Consider the following problem. Z= 23 Maximize subject to 22 + 2:02 + 2x3 0, x2 > 0, X3 > 0. 201 321 -21 (1 (2 (3) If we let S1, S2 and s3 be the slack variables for the respective constraints, the simplex method yields the following final set of equations: Z + 12 + 2.63 + 1 S2 + 5.13 + S1 + 382 2.33 + S2 + S3 + 4x3 + Si + 252 18 24 7 21 (1) (2) (3) 21 = Now you are to conduct sensitivity analysis by independently investigating each of the following changes in the original model. For each change, use the sensitivity analysis procedure to revise this set of equations in tableau form) and convert it to canonical form for identifying and evaluating the current basic solution. Then test this solution for feasibility and for optimality. If either test fails, re-optimize to find ALL new optimal solution(s), if any. 10 (a) Change the right-hand sides to b b2 b3 4 2 C3 5 4 013 (b) Change the coefficients of x3 to = 023 033 2 C1 a11 (c) Change the coefficients of x1 to 021 -2 031 (d) Introduce a new constraint 2x1 + x2 + 3.03 0, x2 > 0, X3 > 0. 201 321 -21 (1 (2 (3) If we let S1, S2 and s3 be the slack variables for the respective constraints, the simplex method yields the following final set of equations: Z + 12 + 2.63 + 1 S2 + 5.13 + S1 + 382 2.33 + S2 + S3 + 4x3 + Si + 252 18 24 7 21 (1) (2) (3) 21 = Now you are to conduct sensitivity analysis by independently investigating each of the following changes in the original model. For each change, use the sensitivity analysis procedure to revise this set of equations in tableau form) and convert it to canonical form for identifying and evaluating the current basic solution. Then test this solution for feasibility and for optimality. If either test fails, re-optimize to find ALL new optimal solution(s), if any. 10 (a) Change the right-hand sides to b b2 b3 4 2 C3 5 4 013 (b) Change the coefficients of x3 to = 023 033 2 C1 a11 (c) Change the coefficients of x1 to 021 -2 031 (d) Introduce a new constraint 2x1 + x2 + 3.03

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!

Question 6 (50%). Consider the following problem: Z= = 3X3 Maximize subject to 4x1 + 5x2 -X1 X2 + 2x3 0, x2 > 0, X3 0, x2 > 0, X3

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

Question 1 (50%). Consider the following problem, where the value of p has not yet been given: = 2x2 Maximize Z = subject to 21 2x1 + X2 2 X2 0, 22 > 0. (3) Use the graphical method to determine the...

Question 1 (50%). Consider the following problem, where the value of p has not yet been given: = I 1 2x2 Maximize Z subject to 21 X 2 2x1 + X2 2 X2 0, x2 > 0. (1) (2) (3) 2 Use the graphical method...

Please answer question 6 Consider the following problem: Maximize Z= subject to 3x1 + 2x2 2x1 - x2 X1 > 0, x2 > 0. 2 2 (1) (2) (a) Let M +00. Construct the big-M problem for the big-M method in...

Question 2 (50%). Consider the following problem. 2x3 Maximize Z= subject to 6x1 + X2 + 221 + 2x2 + (1/2)x3 = 2 232 (3/2)x3 0 (j = 1,2,3). -421 (1) (2) (3) Let S1, S2 and s3 denote the slack...

Question 5 (50%). Consider the following problem. = + 3x3 Minimize Z = subject to 2x1 + X2 5x1 + 2x2 + 7X3 = 420 3x1 + 2x2 + 5x3 > 280 Xi > 0, x2 > 0, X3 > 0. (1) (2) (a) Reformulate the problem so...

Question 7 (50%). Consider the following problem (P): = Maximize Z subject to 2x1 + 4x2 + 3x3 2x1 + X2 + X3 0, x2 > 0, X3 unrestricted (1) (2) Use the tabular form of the simplex method to determine...

Question 8 (50%). Consider the following problem (P): = 2x3 Minimize Z = subject to 5x1 + 4x2 X 1 X2 + 4x3 0, X2 > 0, X3 > 0. o co (1) (2) Use the tabular form of the simplex method to determine an...

The capital structure of Whitefield Mills, Inc., is as follows: Long-term debt ..................$250 million Common stock , $1 par ..............25 million Contributed capital in excess of par value...

A company is sued for job discrimination because only 20% of the newly hired candidates were women when 35% of all applicants were women. Is this strong evidence that the company's hiring practices...

Which of these is NOT a Screening outcome? Seek lead investor position Seek a non - lead investor position SLOR the venture Refer venture to all financial market participants

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