Use the simplex method to solve the linear programming problem. Maximize z=16x₁ +5x₂ subject to: 4x₁ + 2x₂ ≤9 X₁ +3x₂ ≤8 with x₁ 20, x₂ 20

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter6: Optimization Models With Integer Variables
Section: Chapter Questions
Problem 80P
icon
Related questions
Question
Use the simplex method to solve the linear programming problem.
Maximize z= 16x₁ +5x₂
subject to: 4x₁ + 2x₂ ≤9
X₁ + 3x₂ ≤8
with x₁ 20, x₂ 20
Select the correct choice below and, if necessary, fill in the answer box to complete your choice.
OA.
23
x₂ = $₁ = 0, and s2 = 4
GELD
The maximum is when x₁ =
(Reduce any fractions to lowest terms.)
OB. There is no maximum solution to this linear programming problem.
Transcribed Image Text:Use the simplex method to solve the linear programming problem. Maximize z= 16x₁ +5x₂ subject to: 4x₁ + 2x₂ ≤9 X₁ + 3x₂ ≤8 with x₁ 20, x₂ 20 Select the correct choice below and, if necessary, fill in the answer box to complete your choice. OA. 23 x₂ = $₁ = 0, and s2 = 4 GELD The maximum is when x₁ = (Reduce any fractions to lowest terms.) OB. There is no maximum solution to this linear programming problem.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer