Homework Help is Here – Start Your Trial Now!
Math
Algebra
In Problems 3–6, set up the simplex matrix used to solve each linear programming problem. Assume that all vari- hmaldovnl aixnta boinboeas ables are nonnegative. 3. Maximize f = 3x + 7y subject to al oituloaslqilumeed x + 2y < 175 aiwond voy loe rod oinlqas 2x + 5y < 400

In Problems 3–6, set up the simplex matrix used to solve each linear programming problem. Assume that all vari- hmaldovnl aixnta boinboeas ables are nonnegative. 3. Maximize f = 3x + 7y subject to al oituloaslqilumeed x + 2y < 175 aiwond voy loe rod oinlqas 2x + 5y < 400

Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 16EQ
See similar textbooks
icon
Related questions
Question
#3
SECTION 4.3 sbosim ot bol -osimizalM 0E EXERCISES 4,3 1. Convert the constraint inequalities 3x + 5y < 15 and 3x + 6y < 20 to equations containing slack variables. 2. Convert the constraint inequalities 2x + y < 4 and S* + 2y < 8 to equations containing slack variables. (a) Write the v: and s1, S2, S (b) Indicate w complete (c) If the solu and state In Problems 3–6, set up the simplex matrix used to solve each linear programming problem. Assume that all vari- aldov nl era botnboeas algülum eed eulhwol uoy bns noituloe is, row op and then ables are nonnegative. 3. Maximize f = 3x + 7y subject to equal to 2x + 5y < 400 x + 2y < 175 11. 3 1 -6 4. Maximize f = x + 3y subject to 5x + y< 50 0. 4. 1 x + 2y < 50 12. 1 5. Maximize f = 2x + 5y + 2z subject to 0. 2x + 7y + 9z S 100 6x + 5y + z < 145 x + 2y + 7z s 90 10 27 13. 6. Maximize f = 3x + 5y + 11z subject to 15 2x + 3y + 4z < 60 x + 4y + z < 48 5x + y + z < 48 4. In Problems 7-10, a simplex matrix is given in which the solution is complete. Identify the maximum value of f and a set of values of the variables that gives this maxi- 14. -1 mum value. 1 11 9. 15. 2. 8. 7.
Transcribed Image Text:SECTION 4.3 sbosim ot bol -osimizalM 0E EXERCISES 4,3 1. Convert the constraint inequalities 3x + 5y < 15 and 3x + 6y < 20 to equations containing slack variables. 2. Convert the constraint inequalities 2x + y < 4 and S* + 2y < 8 to equations containing slack variables. (a) Write the v: and s1, S2, S (b) Indicate w complete (c) If the solu and state In Problems 3–6, set up the simplex matrix used to solve each linear programming problem. Assume that all vari- aldov nl era botnboeas algülum eed eulhwol uoy bns noituloe is, row op and then ables are nonnegative. 3. Maximize f = 3x + 7y subject to equal to 2x + 5y < 400 x + 2y < 175 11. 3 1 -6 4. Maximize f = x + 3y subject to 5x + y< 50 0. 4. 1 x + 2y < 50 12. 1 5. Maximize f = 2x + 5y + 2z subject to 0. 2x + 7y + 9z S 100 6x + 5y + z < 145 x + 2y + 7z s 90 10 27 13. 6. Maximize f = 3x + 5y + 11z subject to 15 2x + 3y + 4z < 60 x + 4y + z < 48 5x + y + z < 48 4. In Problems 7-10, a simplex matrix is given in which the solution is complete. Identify the maximum value of f and a set of values of the variables that gives this maxi- 14. -1 mum value. 1 11 9. 15. 2. 8. 7.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS