+38x4-8x5 -17x2 (b) Maximize subject to Z 2 107 + 16x5-7x6 -x1-13x2 + 45x3 + 30x7 S 81 3x3-18x =-...

Question

Question

+38x4-8x5 -17x2 (b) Maximize subject to Z 2 107 + 16x5-7x6 -x1-13x2 + 45x3 + 30x7 S 81 3x3-18x =-13 -5x3 4x1 10 s x1 -2 16 S

Answer 1

Answer #1

we have run this problem in Excel with solver tool and we have used simplex method to get the solution

the excel output is

4 Solutions -> 2 6.923077 16 75 Final value objective fun 38 117.6923077 RHS of constraints 107 81 13 constraints -13 45 107

so optimal solution is

and the final value of objective function is

-117.6923077

Answer 2

Similar Homework Help Questions

+38x4-8x5 -17x2 (b) Maximize subject to Z 2 107 + 16x5-7x6 -x1-13x2 + 45x3 + 30x7 S 81 3x3-18x =-...

+38x4-8x5 -17x2 (b) Maximize subject to Z 2 107 + 16x5-7x6 -x1-13x2 + 45x3 + 30x7 S 81 3x3-18x =-13 -5x3 4x1 10 s x1 -2 16 S X3 x5 unrestricted 4. Write the duals of the following problems. problem. [15 pts for each] Verify that the dual of the dual is the original (a) Minimize Z = 3x1-7x2 + 6x4 + 5x5 -X6, subject to 3x1 1x2 4x3 1x4 5x5 + 9x6-265 5 s xj s 20 for all...
2. Consider the following LP: Min z = -4x1 - 5x2 + 3x3 Subject to X1...

2. Consider the following LP: Min z = -4x1 - 5x2 + 3x3 Subject to X1 + x2 + x3 = 10 X1 X2 > 1 X1 + 3x2 + x3 = 20 X1, X2, X3 20 (a) Solve the problem by Big M method. (b) Solve the problem by two-phase method.
Consider the following problem: Maximize z+ 2x1+5x2+3x3 subject to x1-2x2+3x3>=20, and 2x1+4x2+x3=50 using the Big-M and...

Consider the following problem: Maximize z+ 2x1+5x2+3x3 subject to x1-2x2+3x3>=20, and 2x1+4x2+x3=50 using the Big-M and two phase method.

Excel Use Simplex method and Exel To solve the following LPPs. Maximize Maximize P-3x + x2...

Excel Use Simplex method and Exel To solve the following LPPs. Maximize Maximize P-3x + x2 subject to the constraints x1 + x2 = 2 2x) + 3x2 s 12 3x + = 12 x 20 x220 P = 5x1 + 7x2 subject to the constraints 2xy + 3x2 = 12 3x + x2 = 12 x 20 *2 2 0 Maximize Maximize P = 2x2 + 4x2 + x3 subject to the constraints -*1 + 2x2 + 3x3 5...
Solve the linear program using the simplex algorithm method maximize Z = 5x1 + x2 +...

Solve the linear program using the simplex algorithm method maximize Z = 5x1 + x2 + 3x3 + 4x4 subject to: x1 – 2 x2 + 4 x3 + 3x4 s 20 –4x1 + 6 x2 + 5 X3 – 4x4 = 40 2x1 – 3 x2 + 3 x3 + 8x4 5 50 X1, X2, X3 , X4 20
Consider the following LPP: Maximize z = 50x1 + 20x2 + 30x3 subject to 2x1 + x2 + 3x3 + 90 (Resource A) x1 + 2x2 + x3 +...

Consider the following LPP: Maximize z = 50x1 + 20x2 + 30x3 subject to 2x1 + x2 + 3x3 + 90 (Resource A) x1 + 2x2 + x3 + 50 (Resource B) x1 + x2 + x3 + 80 (Resource C) x1, x2 , x3 > 0 The final simplex table is Basis cj  x1 x2 x3 s1 s2 s3 Solution 50 20 30 0 0 0 x1 50 1 -1 0 1 -1 0 40 x3 30 0...

(2 points) Use the simplex method to maximize P = 7xı + 13x2 subject to <...

(2 points) Use the simplex method to maximize P = 7xı + 13x2 subject to < 5x1 x1 + + x2 5x2 10 15 x120 x2 > 0 P =
6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s 10 2x x 20, x, 0, x320. (a) State the dua...

6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s 10 2x x 20, x, 0, x320. (a) State the dual problem. (b) Solve both the primal and the dual problem with any method that works. (c) Check that your optimal solutions are correct by verifying they are feasible and the primal and dual objective functions give the same value. 6, Maximize z = 2x1 + x2 + 3x3 subject to x 3x2 5x3 s...
8. Minimize z - 8x1 + 6x2 + 11x3 subject to 5x1 x2 + 3x3 s 4 5x1 + x2 + 3x3 2 2 2x, + 4x2 + 7x3 s...

8. Minimize z - 8x1 + 6x2 + 11x3 subject to 5x1 x2 + 3x3 s 4 5x1 + x2 + 3x3 2 2 2x, + 4x2 + 7x3 s.5 2x1 + 4x2 + 7x3 2 3 X1 + X2 + X3 = 1 (a) State the dual problem. (b) Solve both the primal and the dual problem with any method that works. (c) Check that your optimal solutions are correct by verifying they are feasible and the primal and...

Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2,...

Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks) Consider the following linear program: Maximize Z-3xI+2x2-X3 Subject to:X1+X2+2 X3s 10 2x1-X2+X3 s20 3 X1+X2s15 X1, X2, X320 (a) Convert the above constraints to equalities. (2 marks) (b) Set up the initial simplex tableau and solve. (9 marks)