Question: Consider the following problem. Maximize Z = 3X1 + 7x2 + 2x3, subject to -2x; + 2x2 + x3 = 10 3x + x2 -

Consider the following problem. Maximize Z = 3X1 + 7x2 + 2x3, subject to -2x; + 2x2 + x3 = 10 3x + x2 - X3 = 20 and X720, X220, X3 2 0. You are given the fact that the basic variables in the optimal solution are x, and X3. (a) Introduce slack variables, and then use the given information to find the optimal solution directly by Gaussian elimination. (b) Extend the work in part (a) to find the shadow prices. (c) Use the given information to identify the defining equations of the optimal CPF solution, and then solve these equations to obtain the optimal solution. (d) Construct the basis matrix B for the optimal BF solution, invert B manually, and then use this B-1 to solve for the optimal solution and the shadow prices y* Then apply the optimality test for the matrix form of the simplex method to verify that this solution is optimal. (e) Given B-1 and y* from part (d), use the fundamental insight presented in Sec. 5.3 to construct the complete final simplex tableau

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!

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

D 5.3-1. Consider the following problem. Maximize Z = x1 - x2 + 2x3. subject to 2x - 2x2 + 3x3 = 5 x1 + x2 - X3 = 3 x1 - x2 + x3 = 2 and x 20, X220, X3 20. Let X4, X5, and xo denote the slack...

D 5.3-1.* Consider the following problem. Maximize Z = X1 - x2 + 2x3, subject to 2x1 - 2x2 + 3x3 - 5 X1+ X2 - X3-3 X1 - X2 + X3-2 and x1 20, X2 2 0, X3 2 0. Let x4, x5, and x6 denote the slack...

D 5.3-1.* Consider the following problem. Maximize Z = x1 - X2 + 2x3, subject to 2x1 - 2x2 + 3x3 - 5 X1+ x2 - X3-3 X1 - X2 + X3-2 and x1 20, *2 2 0, *3 2 0. Let x4, X5, and x6 denote the slack...

Operations research D 5.3-1.* Consider the following problem. Maximize Z = x1 - x2 + 2x3, subject to 2x; 2x2 + 3x3 = 5 x1 + x2 x1 - x2 + x3 = 2 X3

D 5.3-5. Consider the following problem. Maximize Z= cx + cxx2 + xs. subject to X1 + 2x2 + x3 Sb 2x1 + x2 + 3x3 S 25 and X 20, X220, X3 20. Note that values have not been assigned to the coefficients...

I need it to be solved in subsequent tableau. 3. Consider the following LP: Maximize z = 7x1 + 12x2 + 4xz Subject to xy + 2x2 + x3 = 10 2x1 - x2 + 3x3 38 X1, X2, X3 20 Construct the optimal simplex...

For the primal problem below, write out its matrix form, its dual problem, and the matrix form of the dual problem. Explain why the objective function for the dual problem is minimized. Solve the...

Consider the following problem: Maximize z = 3x1 + 2x2 + 3x3 Subject to 2x1 + x2 + x3 = 2 X1 + 3x2 + x3 = 6 3x1+ 4x2 + 2x3 = 8 X1, x2, x3 0

An excess of zinc metal is added to 50.0 mL of a 0.100 M AgNO3 solution in a constant-pressure calorimeter like the one pictured in Figure 6.9. As a result of the reaction The temperature rises from...

I-9 Networking Solutions began operations on January 1, 2012, and immediately issued its stock, receiving cash. I-9s balance sheet at December 31, 2012, reported the following stockholders equity:...

An investment's rate of return is positively related to its price. Question 1 options: TrueFalse

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