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 directly to this primal problem or by applying the simplex method directly to the dual problem instead. Explain. (a) Maximize Z = 10x₁ - 4x₂ + 7x3 subject to 3x1x₂ + 2x3 ≤ 25 x12x2 + 3x3 ≤ 25 5x₁ + x₂ + 2x3 ≤ 40 x₁ + x₂ + x3 ≤ 90 2x₁x₂ + x3 ≤ 20 and x₁ ≥ 0, x₂ ≥ 0, x3 ≥ 0. (b) Maximize Z = 2x₁ + 5x₂ + 3x3 + 4x4 + x5 subject to 3x₁ + 3x₂ + 2x3 + 3x4 + x5 ≤6 4x₁ + 6x₂ + 5x3 + 7x4 + x5 ≤ 15 and x; ≥ 0, for j = 1, 2, 3, 4, 5.

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 directly to this primal problem or by applying the simplex method directly to the dual problem instead. Explain. (a) Maximize Z = 10x₁ - 4x₂ + 7x3 subject to 3x1x₂ + 2x3 ≤ 25 x12x2 + 3x3 ≤ 25 5x₁ + x₂ + 2x3 ≤ 40 x₁ + x₂ + x3 ≤ 90 2x₁x₂ + x3 ≤ 20 and x₁ ≥ 0, x₂ ≥ 0, x3 ≥ 0. (b) Maximize Z = 2x₁ + 5x₂ + 3x3 + 4x4 + x5 subject to 3x₁ + 3x₂ + 2x3 + 3x4 + x5 ≤6 4x₁ + 6x₂ + 5x3 + 7x4 + x5 ≤ 15 and x; ≥ 0, for j = 1, 2, 3, 4, 5.

Algebra for College Students

10th Edition

ISBN:9781285195780

Author:Jerome E. Kaufmann, Karen L. Schwitters

Publisher:Jerome E. Kaufmann, Karen L. Schwitters

Chapter12: Algebra Of Matrices

Section12.4: Systems Of Linear Inequalities Linear Programming

Problem 7CQ

See similar textbooks