Linear Algebra and Its Applications (5th Edition)
5th Edition
ISBN: 9780321982384
Author: David C. Lay, Steven R. Lay, Judi J. McDonald
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 9.4, Problem 11E
Sometimes a minimization problem has inequalities only of the “≥” type. In this case, replace the problem by its dual. (Multiplying the original inequalities by − 1 to reverse their direction will not work, because the basic solution of die initial simplex tableau in this case will be infeasible.) In Exercises 11-14, use the simplex method to solve the dual, and from this solve die original problem (the dual of die dual).
11. Maximize 16x1 + 10x2 + 20x3
subject to x1 + x2 + 3x3 ≥ 4
2x1 + x2 + 2x3 ≥ 5
and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
How do you detect infeasibility using the Dual Simplex Method?
When problem become unrestricted after changing primal to dual simplex Method justify your statement with valid example.
In this problem we want to understand how the simplex method deals with an LP problem having
an infinite number of solutions.
Solve: Maximize z = 2x1 + 4x2 subject to x1 + 2x2 0.
Chapter 9 Solutions
Linear Algebra and Its Applications (5th Edition)
Ch. 9.1 - Find the optimal strategies and the value of the...Ch. 9.1 - Player R has a supply of dimes and quarters....Ch. 9.1 - Prob. 2ECh. 9.1 - In the traditional Japanese childrens game janken...Ch. 9.1 - Prob. 4ECh. 9.1 - Prob. 5ECh. 9.1 - Find all saddle points for the matrix games in...Ch. 9.1 - Find all saddle points for the matrix games in...Ch. 9.1 - Find all saddle points for the matrix games in...Ch. 9.1 - Prob. 9E
Ch. 9.1 - Prob. 10ECh. 9.1 - In Exercises 11-18, find the optimal row and...Ch. 9.1 - In Exercises 11-18, find the optimal row and...Ch. 9.1 - In Exercises 11-18, find the optimal row and...Ch. 9.1 - In Exercises 11-18, find the optimal row and...Ch. 9.1 - In Exercises 11-18, find the optimal row and...Ch. 9.1 - Prob. 16ECh. 9.1 - In Exercises 11-18, find the optimal row and...Ch. 9.1 - In Exercises 11-18, find the optimal row and...Ch. 9.1 - In Exercises 21 and 22, mark each statement True...Ch. 9.1 - In Exercises 21 and 22, mark each statement True...Ch. 9.1 - Find the optimal strategies and the value of the...Ch. 9.1 - Bill and Wayne are playing a game in which each...Ch. 9.1 - Consider the matrix game A=[abcd] where A has no...Ch. 9.2 - Consider the following problem: Maximize 2x1 + x2...Ch. 9.2 - Graph the feasible set for Practice Problem 1.Ch. 9.2 - Find the extreme points of the feasible set in...Ch. 9.2 - Use the answer to Practice Problem 3 to find the...Ch. 9.2 - Betty plans to invest a total of 12,000 in mutual...Ch. 9.2 - A dog breeder decides to feed his dogs a...Ch. 9.2 - In Exercises 3-6, find vectors b and c and matrix...Ch. 9.2 - In Exercises 3-6, find vectors b and c and matrix...Ch. 9.2 - In Exercises 3-6, find vectors b and c and matrix...Ch. 9.2 - In Exercises 3-6, find vectors b and c and matrix...Ch. 9.2 - In Exercises 7-10, solve the linear programming...Ch. 9.2 - In Exercises 7-10, solve the linear programming...Ch. 9.2 - Prob. 9ECh. 9.2 - Prob. 10ECh. 9.2 - Prob. 11ECh. 9.2 - Prob. 12ECh. 9.2 - Prob. 13ECh. 9.2 - Prob. 14ECh. 9.2 - Prob. 15ECh. 9.2 - Prob. 16ECh. 9.2 - Prob. 17ECh. 9.2 - Prob. 18ECh. 9.2 - Prob. 19ECh. 9.3 - Use the simplex method to solve the following...Ch. 9.3 - In Exercises 1 and 2, set up the initial simplex...Ch. 9.3 - Prob. 2ECh. 9.3 - Prob. 3ECh. 9.3 - Prob. 4ECh. 9.3 - Prob. 5ECh. 9.3 - Prob. 6ECh. 9.3 - Exercises 7 and 8 relate to a canonical linear...Ch. 9.3 - Prob. 9ECh. 9.3 - Prob. 10ECh. 9.3 - Prob. 11ECh. 9.3 - Solve Exercises 9-14 by using the simplex method....Ch. 9.3 - Solve Exercises 9-14 by using the simplex method...Ch. 9.3 - Solve Exercises 9-14 by using the simplex method....Ch. 9.3 - Solve Example 7 by bringing x1 into the solution...Ch. 9.3 - Use the simplex method to solve the linear...Ch. 9.3 - Prob. 17ECh. 9.3 - Use the simplex method to solve the linear...Ch. 9.4 - The following questions relate to the Shady-Lane...Ch. 9.4 - The following questions relate to the Shady-Lane...Ch. 9.4 - Prob. 3PPCh. 9.4 - Prob. 1ECh. 9.4 - Prob. 2ECh. 9.4 - Prob. 3ECh. 9.4 - In Exercises 1-4, state the dual of the given...Ch. 9.4 - In Exercises 5-8, use the final tableau in the...Ch. 9.4 - In Exercises 5-8, use the final tableau in the...Ch. 9.4 - In Exercises 5-8, use the final tableau in the...Ch. 9.4 - In Exercises 5-8, use the final tableau in the...Ch. 9.4 - Exercises 9 and 10 relate to a primal linear...Ch. 9.4 - Sometimes a minimization problem has inequalities...Ch. 9.4 - Sometimes a minimization problem has inequalities...Ch. 9.4 - Sometimes a minimization problem has inequalities...Ch. 9.4 - Sometimes a minimization problem has inequalities...Ch. 9.4 - Exercises 15 and 16 refer to Exercise 15 in...Ch. 9.4 - Exercises 15 and 16 refer to Exercise 15 in...Ch. 9.4 - Solve the matrix games in Exercises 17 and 18 by...Ch. 9.4 - Solve the matrix games in Exercises 17 and 18 by...Ch. 9.4 - Solve the matrix game in Exercise 9 in Section 9.1...Ch. 9.4 - Solve the matrix game in Exercise 10 in Section...Ch. 9.4 - Prob. 22ECh. 9.4 - Prob. 23E
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, algebra and related others by exploring similar questions and additional content below.Similar questions
- Solve the LP problem using Simplex Method Maximize = 2x₁ - x2 + 2x3 subject to: 2x1 + x2 10 x1 + 2x₂ 2x3 < 20 x1 + 2x3 ≤ 5 X1, X2, X3 ≥ 0arrow_forwardOPERRATION RESEARCH (UPVOTE WILL BE GIVEN. PLEASE WRITE THE COMPLETE SOLUTIONS LEGIBLY. NO LONG EXPLANATION NEEDED.ANSWER IN 2 DECIMAL PLACES) Write the dual for the following primal problemarrow_forwardWhat if you were to square root both sides of this constraint. Wouldn't you get x1-x3>=4?Or is that not how it works?arrow_forward
- (i) Use x.and x.as the initial basic variables and apply simplex method to solve: Maximize: z=6x. + 8x: + X+ 2x. subject to: 2x. +x: +x = 20 X+ 3x. +x.= 24 With: x., x., X,X, >0 ii) Write the dual to the problem.arrow_forwardPlease do not give solution in image format thankuarrow_forwarddocs google.com/forms/d/e/1FAlpQL.dl Solve using the simplex technique, and then identify the optimal values of these variables: Z, x1, x2, x3. Write your solution in a piece of paper, take a picture and upload. (Note: if you are going to use Excel as a tool, do not forget to rewrite your answer on a piece of paper and follow the same procedure). a. Maximize 4x1+ 2x2+5x3 Subject to 1x1 + 2x2 + 1x3 O 1 Add filearrow_forward
- Q2) Solve the following problem using the simplex method: Maximize: z = 4x+3y x +3y < 3 -2x +ys 5 X20, y 20arrow_forwardI Download O Info Page < of 4 ZOOM + 3. Use the Simplex method to find the optimal solution to the problem below. Advertising: A department store has up to $22,000 to spend on television advertising for an upcoming sale. All ads will be placed with one television station. A 30-second ad on daytime TV costs $1,500 and is viewed by 12,000 potential customers. A 30- second ad on prime-time TV costs $2,000 and is viewed by 15,000 potential customers. And a 30-second ad on late-night TV costs $1,000 and is viewed by 10,000 potential customers. If the total number of ads placed cannot exceed 12, how many ads should be placed in each time period in order to maximize the number of potential customers? How many potential customers will see the ads? Please show me at least the following work: all decision variables, x1,x2...etc. and indicate what each variable represents - the objective function equation - the initial simplex matrix - the final solution matrix - the answers to the two questions…arrow_forwardPlz answer ASAParrow_forward
- Could you please help me to solve those 2 questions? The first one should be talking something in general, about the theory, not solve a specific question or LLP.arrow_forwardExplain a corner point feasible solution in operations ?arrow_forwardUse the simplex method to solve the problem: Maximize: P = 3x1 + 2x2 subject to: 5x1 + 2x2 ≤ 20 3x1 + 2x2 ≤ 16 x1 ≥ 0, x2 ≥ 0arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Elementary AlgebraAlgebraISBN:9780998625713Author:Lynn Marecek, MaryAnne Anthony-SmithPublisher:OpenStax - Rice UniversityCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
- Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Elementary Algebra
Algebra
ISBN:9780998625713
Author:Lynn Marecek, MaryAnne Anthony-Smith
Publisher:OpenStax - Rice University
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY
Optimization Problems in Calculus; Author: Professor Dave Explains;https://www.youtube.com/watch?v=q1U6AmIa_uQ;License: Standard YouTube License, CC-BY
Introduction to Optimization; Author: Math with Dr. Claire;https://www.youtube.com/watch?v=YLzgYm2tN8E;License: Standard YouTube License, CC-BY