7. Маximize z 3 8x, + 9х, + 5хз subject to х, + х2 + 2х; s 2 2х, + 3x, + 4хз < 3 Зх, + 3x, + х, s 4 х, 2 0, ј3D 1, 2,3

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 34E
icon
Related questions
Question

please do the question 7 

In Exercises
simplex method. Also, set up and solve the dual of the given problem. Finally,
verify that your solutions satisfy part (b) (iii) of the Duality Theorem.
7, solve the given linear programming problem using the
Transcribed Image Text:In Exercises simplex method. Also, set up and solve the dual of the given problem. Finally, verify that your solutions satisfy part (b) (iii) of the Duality Theorem. 7, solve the given linear programming problem using the
7. Маximize z 3 8x, + 9х, + 5х3
subject to
х, + х2 + 2х; < 2
2х] + 3x, + 4х3 < 3
Зх, + 3x, + х; < 4
х, 2 0, ј3D1, 2,3
Transcribed Image Text:7. Маximize z 3 8x, + 9х, + 5х3 subject to х, + х2 + 2х; < 2 2х] + 3x, + 4х3 < 3 Зх, + 3x, + х; < 4 х, 2 0, ј3D1, 2,3
Expert Solution
steps

Step by step

Solved in 8 steps

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning