Suppose a linear programming problem has a constraint of the form 3x1 + 2x2 + 5x3 - 2x4 2 12. Why can we not solve this problem using the simplex method as described up to this point? (In Section 2.3 we develop techniques for handling this situation.)

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 33E
icon
Related questions
Question
Suppose a linear programming problem has a constraint of the form
3x1 + 2x2 + 5x3 - 2x4 2 12.
Why can we not solve this problem using the simplex method as described up
to this point? (In Section 2.3 we develop techniques for handling this situation.)
Transcribed Image Text:Suppose a linear programming problem has a constraint of the form 3x1 + 2x2 + 5x3 - 2x4 2 12. Why can we not solve this problem using the simplex method as described up to this point? (In Section 2.3 we develop techniques for handling this situation.)
Expert Solution
Step 1

The given inequality is 3x1+2x2+5x3-2x412

The linear programming problems which satisfy the following conditions can be solved by simplex method.

(1) The inequalities in the problem are of  types.

(2) The right-sides of all the constraints are positive.

(3) All the variables are strictly greater than 0.

 

 

 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 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