Work through the simplex method step by step to solve the problem and find an optimal solution. The optimal solution is ( 10.5 1.50 0) with Z=- 45.5 O

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter12: Queueing Models
Section12.5: Analytic Steady-state Queueing Models
Problem 17P
icon
Related questions
Question
Required information
Consider the following problem.
Maximize Z= 5x1 +4x2.-x3+3x4.
subject to
5x1+4x2-5x3+3x4≤ 36 (resource 1)
4x1+4x2+2x3+4x4 ≤42 (resource 2)
and
*120, *2 ≥ 0, x320, x420.
Work through the simplex method step by step to solve the problem and find an optimal solution.
The optimal solution is (10.5
1.5
0
) with Z= 45.5
Transcribed Image Text:Required information Consider the following problem. Maximize Z= 5x1 +4x2.-x3+3x4. subject to 5x1+4x2-5x3+3x4≤ 36 (resource 1) 4x1+4x2+2x3+4x4 ≤42 (resource 2) and *120, *2 ≥ 0, x320, x420. Work through the simplex method step by step to solve the problem and find an optimal solution. The optimal solution is (10.5 1.5 0 ) with Z= 45.5
Expert Solution
steps

Step by step

Solved in 6 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,