Use a graphing calculator or other technology to solve the following linear programming problem. Maximize z=37x₁ +34x2 +36x3 +30x4 + 35x5 subject to: 16x₁ +19x2 +23x3 + 15x4 +21x5 ≤37,000 15x₁ +10x2 +19x3 +23x4 +10x5 ≤25,000 9x₁ +16x2 +14x3 + 12x4+11x5 ≤27,000 18x₁ +20x2 +15x3 +17x4+19x5 ≤32,000 x₁ 20, x₂ 20, x3 20, x4 ≥0, x5 20 with .... ₁ ×4 0, = [ X4 $2 The maximum is when x₁ = ₁x₂ = ₁x3 = x₁ = ₁ ×5=₁ $₁ = $₂, $3 =, and $4 (Round to the nearest hundredth as needed.)

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Use a graphing calculator or other technology to solve the following linear programming problem.
Maximize
z=37x₁+34x₂+36x3 +30x4 +35x5
subject to: 16x₁+19x2 +23x3 + 15x4 +21x5 ≤37,000
15x₁ +10x2 +19x3 +23x4 +10x5 ≤25,000
9x₁ +16x2 +14x3 + 12x4 + 11x5 ≤27,000
18x₁ +20x2 +15x3 + 17x4 +19x5 ≤32,000
x₁20, X₂ ≥0, X3 20, x4 ≥0, x5 20
F3
View an example Get more help.
ܩ ܠ
$
4
SEP
122
R
LL
with
The maximum is when x₁ = ₁x₂ = ₁ x3 = ₁ X4 = ₁ ×5 = ₁, $₁=₁ $S₂ = , $3 = ₁ and $4 = 0.
1
X2
(Round to the nearest hundredth as needed.)
F
F4
%
5
A
T
G
6
Y
H
&
7
◄◄
U
J
*
8
► 11
F8
(
9
K
Clear all
F9
O
O
F10
Check answer
P
F11
+
A
||
Transcribed Image Text:Use a graphing calculator or other technology to solve the following linear programming problem. Maximize z=37x₁+34x₂+36x3 +30x4 +35x5 subject to: 16x₁+19x2 +23x3 + 15x4 +21x5 ≤37,000 15x₁ +10x2 +19x3 +23x4 +10x5 ≤25,000 9x₁ +16x2 +14x3 + 12x4 + 11x5 ≤27,000 18x₁ +20x2 +15x3 + 17x4 +19x5 ≤32,000 x₁20, X₂ ≥0, X3 20, x4 ≥0, x5 20 F3 View an example Get more help. ܩ ܠ $ 4 SEP 122 R LL with The maximum is when x₁ = ₁x₂ = ₁ x3 = ₁ X4 = ₁ ×5 = ₁, $₁=₁ $S₂ = , $3 = ₁ and $4 = 0. 1 X2 (Round to the nearest hundredth as needed.) F F4 % 5 A T G 6 Y H & 7 ◄◄ U J * 8 ► 11 F8 ( 9 K Clear all F9 O O F10 Check answer P F11 + A ||
Expert Solution
Step 1

To find- Use a graphing calculator or other technology to solve the following linear programming problem.

Maximize z = 37x1 + 34x2 + 36x3 + 30x4 + 35x5subject to:16x1 + 19x2 + 23x3 + 15x4 + 21x5  37,00015x1 + 10x2 + 19x3 + 23x4 + 10x5  25,0009x1 + 16x2 + 14x3 + 12x4 + 11x5  27,00018x1 + 20x2 + 15x3 + 17x4 + 19x5  32,000with x1 0, x2 0, x3 0, x4 0, x5 0

steps

Step by step

Solved in 7 steps

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,