Use the simplex method to solve the linear programming Maximize z = 10x₁ + 12x2

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.CR: Review Problem Set
Problem 37CR
icon
Related questions
Question
Use the simplex method to solve the linear programming
problem.
A. The maximum is when X₁ =
1
, x₂ =
(Type integers or simplified fractions.)
B. There is no maximum.
‚ S₁ =
Maximize
subject to:
Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice.
"
with
= 10x₁ + 12x₂
S2 =
Z=
4x₁ + 2x₂ ≤24
6x1 + x₂ ≤50
2x₁ + 2x₂ ≤26
X₁ ≥ 0, X₂ ≥ 0
and $3
=
Transcribed Image Text:Use the simplex method to solve the linear programming problem. A. The maximum is when X₁ = 1 , x₂ = (Type integers or simplified fractions.) B. There is no maximum. ‚ S₁ = Maximize subject to: Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. " with = 10x₁ + 12x₂ S2 = Z= 4x₁ + 2x₂ ≤24 6x1 + x₂ ≤50 2x₁ + 2x₂ ≤26 X₁ ≥ 0, X₂ ≥ 0 and $3 =
Expert Solution
steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

So the maximum is 144 when x1= 12, x2= 12, s1= ?, s2=? and s3=? 

What are the answers for s1, s2, s3?

Solution
Bartleby Expert
SEE SOLUTION
Recommended textbooks for you
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning