write the simplex tableau for the given linear pro- gramming problem. You do not need to solve the problem. (In each case the objective function is to be maximized.) 1. Objective function: z = x1 + 2x2 2. Objective function: z = x1 + 3x, Constraints: Constraints: 2x1 + x,5 8 X, + x, s5 X1, X, 2 0 3. Objective function: z = 2x1 + 3x, + 4X3 X1 + x25 4 X1 - X,5 1 X1, X2 2 0 4. Objective function: z = 6x1 – 9x2 Constraints: Constraints: X1 + 2x, < 12 2x1 – 3x, s 6 X1 + x3s 8 X1 + x2s 20 X1, X2, X3 2 0 X1, X, 2 0
write the simplex tableau for the given linear pro- gramming problem. You do not need to solve the problem. (In each case the objective function is to be maximized.) 1. Objective function: z = x1 + 2x2 2. Objective function: z = x1 + 3x, Constraints: Constraints: 2x1 + x,5 8 X, + x, s5 X1, X, 2 0 3. Objective function: z = 2x1 + 3x, + 4X3 X1 + x25 4 X1 - X,5 1 X1, X2 2 0 4. Objective function: z = 6x1 – 9x2 Constraints: Constraints: X1 + 2x, < 12 2x1 – 3x, s 6 X1 + x3s 8 X1 + x2s 20 X1, X2, X3 2 0 X1, X, 2 0
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter7: Nonlinear Optimization Models
Section: Chapter Questions
Problem 49P: If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60...
Related questions
Question
Please solve everything
![write the simplex tableau for the given linear pro-
gramming problem. You do not need to solve the problem. (In each
case the objective function is to be maximized.)
1. Objective function:
z = x1 + 2x,
2. Objective function:
z = x1 + 3x,
Constraints:
Constraints:
X1 + x,54
X1 - X,<1
2x1 + x2< 8
X1 + x,55
X1, X,2 0
X1, X, 2 0
3. Objective function:
z = 2x1 + 3x, + 4x3
4. Objective function:
z = 6x1 – 9x,
Constraints:
Constraints:
X1 + 2x2
< 12
2x, - 3x, < 6
X1 + x2< 20
X1, X, 2 0
X1
+ x3< 8
X1, X2, X32 0](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8aa4824e-4aca-49e4-bda7-af3cb8860244%2F265b450d-6761-4856-9005-5c3d5b44de1a%2F92b4eiq_processed.png&w=3840&q=75)
Transcribed Image Text:write the simplex tableau for the given linear pro-
gramming problem. You do not need to solve the problem. (In each
case the objective function is to be maximized.)
1. Objective function:
z = x1 + 2x,
2. Objective function:
z = x1 + 3x,
Constraints:
Constraints:
X1 + x,54
X1 - X,<1
2x1 + x2< 8
X1 + x,55
X1, X,2 0
X1, X, 2 0
3. Objective function:
z = 2x1 + 3x, + 4x3
4. Objective function:
z = 6x1 – 9x,
Constraints:
Constraints:
X1 + 2x2
< 12
2x, - 3x, < 6
X1 + x2< 20
X1, X, 2 0
X1
+ x3< 8
X1, X2, X32 0
![use the simplex method to solve the given
linear programming problem. (In each case the objective function
is to be maximized.)
9. Objective function:
z = x1 + 2x,
10. Objective function:
z = x1 + x2
Constraints:
Constraints:
X1 + 4x, s 8
X1 + x2< 12
X1 + 2x, s 6
3x, + 2x, < 12
X1, X22 0
X1, X2 2 0](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8aa4824e-4aca-49e4-bda7-af3cb8860244%2F265b450d-6761-4856-9005-5c3d5b44de1a%2Fhgvcrko_processed.png&w=3840&q=75)
Transcribed Image Text:use the simplex method to solve the given
linear programming problem. (In each case the objective function
is to be maximized.)
9. Objective function:
z = x1 + 2x,
10. Objective function:
z = x1 + x2
Constraints:
Constraints:
X1 + 4x, s 8
X1 + x2< 12
X1 + 2x, s 6
3x, + 2x, < 12
X1, X22 0
X1, X2 2 0
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
![Practical Management Science](https://www.bartleby.com/isbn_cover_images/9781337406659/9781337406659_smallCoverImage.gif)
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,