Question

Use the simplex method to solve the linear programming problem. Maximize z = 5x1 + 3x2 subject to: 2x1 + 4x2 ? 13 x1 + 2x2 ? 6 with x1 ? 0, x2 ? 0 A. Maximum is 32.5 when x1 = 6.5, x2 = 0 B. Maximum is 30 when x1 = 6, x2 = 0 C. Maximum is 18 when x1 = 0, x2 = 6 D. Maximum is 9 when x1 = 0, x2 = 3

          Use the simplex method to solve the linear programming problem.

Maximize z = 5x1 + 3x2
subject to: 2x1 + 4x2 ? 13
x1 + 2x2 ? 6
with x1 ? 0, x2 ? 0

A. Maximum is 32.5 when x1 = 6.5, x2 = 0
B. Maximum is 30 when x1 = 6, x2 = 0
C. Maximum is 18 when x1 = 0, x2 = 6
D. Maximum is 9 when x1 = 0, x2 = 3

Use the simplex method to solve the linear programming problem.

Maximize z = 5x1 + 3x2
subject to: 2x1 + 4x2 ? 13
x1 + 2x2 ? 6
with x1 ? 0, x2 ? 0

A. Maximum is 32.5 when x1 = 6.5, x2 = 0
B. Maximum is 30 when x1 = 6, x2 = 0
C. Maximum is 18 when x1 = 0, x2 = 6
D. Maximum is 9 when x1 = 0, x2 = 3

Added by Tiffany Y.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Carson Merrill

12/16/2022

Step 1

x1 = 6.5 Since the constraint 2x1 4x2 < 13 is not satisfied, we can eliminate this variable from the equation. x1 = 5 Show more…

Show all steps

Thanks for your feedback!

Use the simplex method to solve the linear programming problem: Maximize z = 5x1 3x2 subject to: 2x1 4x2 < 13 2x2 < 6 with x1 2 0, x2 2 0 A Maximum is 32.5 when x1 = 6.5, x2 = 0 Maximum is 30 when x1 Maximum is 18 when x1 x2 = x276 Maximum is when x1 0, x2 = 3