How to solve this problem with the dual simplex algorithm: max 60x1 + 30x2 + 20x3 subject to 8x1 + 6x2 + x3 <= 48 4x1 + 2x2 + 1.5x3 <= 20 2x1 + 1.5x2 + 0.5x3 <= 8 x1 + x2 + x3 <= 11 x1,x2,x3 >= 0

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter5: Orthogonality
Section5.3: The Gram-schmidt Process And The Qr Factorization
Problem 7BEXP
icon
Related questions
Question

How to solve this problem with the dual simplex algorithm:

max 60x1 + 30x2 + 20x3
subject to
8x1 + 6x2 + x3 <= 48
4x1 + 2x2 + 1.5x3 <= 20
2x1 + 1.5x2 + 0.5x3 <= 8
x1 + x2 + x3 <= 11

x1,x2,x3 >= 0

Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning