To determine To calculate: The maximum value of z . Explanation Given: Maximize: z = 4 x 1 − 3 x 2 + 2 x 3 . Subject to: 2 x 1 − x 2 + 8 x 3 ≤ 40 4 x 1 − 5 x 2 + 6 x 3 ≤ 60 2 x 1 − 2 x 2 + 6 x 3 ≤ 24 x 1 ≥ 0 , x 2 ≥ 0 , x 3 ≥ 0 Calculation: As there are 3 constraints, there will be 3 slack variables namely s 1 , s 2 and s 3 . Rewrite constraint 1 gives, 2 x 1 − x 2 + 8 x 3 + s 1 = 40 Rewrite constraint 2 gives, 4 x 1 − 5 x 2 + 6 x 3 + s 2 = 60 Rewrite constraint 3 gives, 2 x 1 − 2 x 2 + 6 x 3 + s 3 = 24 Subject to, x 1 ≥ 0 , x 2 ≥ 0 , x 3 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 0 , s 3 ≥ 0 . The required initial simplex tableau with indicators is given as: x 1 x 2 x 3 s 1 s 2 s 3 z [ 2 − 1 8 1 0 0 0 40 4 − 5 6 0 1 0 0 60 2 − 2 6 0 0 1 0 24 − 4 3 − 2 0 0 0 1 0 ] Look at the indicators and choose the most negative one, which in this case is − 4 that belongs to column 1. Thus, column 1 is pivot column. Now, for each positive entry in the pivot column, divide the number in the far-right column of the same row by the positive number in the pivot column. x 1 x 2 x 3 s 1 s 2 s 3 z Quotients [ 2 − 1 8 1 0 0 0 40 4 − 5 6 0 1 0 0 60 2 − 2 6 0 0 1 0 24 − 4 3 − 2 0 0 0 1 0 ] 40 1 =40 60 4 =15 24 2 =12 The row with the smallest quotient (in this case, the third row) is the pivot row. The entry in the pivot row and pivot column is the pivot which is 2. To perform pivoting on the simplex tableau, start by multiplication of each entry of row 3 by 1 2 in order to change the pivot to 1. x 1 x 2 x 3 s 1 s 2 s 3 z [ 2 − 1 8 1 0 0 0 40 4 − 5 6 0 1 0 0 60 1 − 1 3 0 0 1 2 0 12 − 4 3 − 2 0 0 0 1 0 ] Now use row operations to make the entry in row 1, column 1, as 0. x 1 x 2 x 3 s 1 s 2 s 3 z [ 0 1 2 1 0 − 1 0 16 4 − 5 6 0 1 0 0 60 1 − 1 3 0 0 1 2 0 12 − 4 3 − 2 0 0 0 1 0 ] ⋅ ( R 1 − 2 R 3 ) Now use row operations to make the entry in row 2, column 1, as 0. x 1 x 2 x 3 s 1 s 2 s 3 z [ 0 1 2 1 0 − 1 0 16 0 − 1 − 6 0 1 − 2 0 12 1 − 1 3 0 0 1 2 0 12 − 4 3 − 2 0 0 0 1 0 ] ⋅ ( R 2 − 4 R 3 ) Finally, change the indicator − 4 to 0. x 1 x 2 x 3 s 1 s 2 s 3 z [ 0 1 2 1 0 − 1 0 16 0 − 1 − 6 0 1 − 2 0 12 1 − 1 3 0 0 1 2 0 12 0 − 1 10 0 0 2 1 48 ] ⋅ ( R 4 + 4 R 3 ) Since, one negative element still remains in indicators, continue the pivoting procedure

Mathematics with Applications In the Management, Natural and Social Sciences (11th Edition)

11th Edition

ISBN: 9780321931078

Author: Margaret L. Lial, Thomas W. Hungerford, John P. Holcomb, Bernadette Mullins

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 7.4, Problem 33E

To determine

To calculate: The maximum value of z.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 7.4, Problem 32E

Chapter 7.4, Problem 34E

Students have asked these similar questions

Could you show why the answer is B Using polar coordinates and the area formula

1. The parametric equations x = u, y = u cos v, z = usin v, with Ou≤ 2, 0 ≤ v ≤ 2π represent the cone that is obtained by revolving (about x-axis) the line y = x (for 0 ≤ x ≤2) in the xy-plane. Answer the following questions. (A) [50%] Sketch the cone and compute its surface area, which is given by dS = [ | Ər Or ди მა × du dv with S being the cone surface and D being the projection of S on the uv-plane. (B) [50%] Suppose that the density of the thin cone is σ(x, y, z) = 0.25x gr/cm². Compute the total mass of the cone.

The value of sin (2V · F) at x = 3, y = 3, z = −4, where F -0.592 -0.724 0.661 -0.113 -0.822 -0.313 0.171 0.427 = (-2x² + -4,2yz − x − 3, −5xz - 2yz), is

Chapter 7 Solutions

Mathematics with Applications In the Management, Natural and Social Sciences (11th Edition)

Ch. 7.1 - Checkpoint 1 Graph the given...Ch. 7.1 - Prob. 2CP Ch. 7.1 - Prob. 3CP Ch. 7.1 - Prob. 4CP Ch. 7.1 - Prob. 5CP Ch. 7.1 - Checkpoint 6 Graph the feasible region of the...Ch. 7.1 - Prob. 7CP Ch. 7.1 - Match the inequality with its graph, which is one...Ch. 7.1 - Match the inequality with its graph, which is one...Ch. 7.1 - Match the inequality with its graph, which is one...

Ch. 7.1 - Prob. 4E Ch. 7.1 - Match the inequality with its graph, which is one...Ch. 7.1 - Match the inequality with its graph, which is one...Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Prob. 9E Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Prob. 11E Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Prob. 17E Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Prob. 19E Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Prob. 22E Ch. 7.1 - Prob. 23E Ch. 7.1 - Graph each of the given linear inequalities. (See...Ch. 7.1 - Prob. 25E Ch. 7.1 - Prob. 26E Ch. 7.1 - Prob. 27E Ch. 7.1 - Prob. 28E Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Prob. 32E Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Prob. 34E Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Prob. 37E Ch. 7.1 - Prob. 38E Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Prob. 40E Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Prob. 43E Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Graph the feasible region for the given systems of...Ch. 7.1 - Prob. 47E Ch. 7.1 - Prob. 48E Ch. 7.1 - Prob. 49E Ch. 7.1 - Prob. 50E Ch. 7.1 - Prob. 51E Ch. 7.1 - 52. Business A manufacturer of electric shavers...Ch. 7.1 - Prob. 53E Ch. 7.1 - Prob. 54E Ch. 7.1 - Prob. 55E Ch. 7.1 - Prob. 56E Ch. 7.2 - Checkpoint 1 Suppose the objective function in...Ch. 7.2 - Prob. 2CP Ch. 7.2 - Prob. 3CP Ch. 7.2 - Checkpoint 4 Use the region of feasible solutions...Ch. 7.2 - Prob. 5CP Ch. 7.2 - Prob. 6CP Ch. 7.2 - Exercises 1–6 show regions of feasible solutions....Ch. 7.2 - Exercises 1–6 show regions of feasible solutions....Ch. 7.2 - Exercises 1–6 show regions of feasible solutions....Ch. 7.2 - Exercises 1–6 show regions of feasible solutions....Ch. 7.2 - Exercises 1–6 show regions of feasible solutions....Ch. 7.2 - Prob. 6E Ch. 7.2 - Use graphical methods to solve Exercises 7–12....Ch. 7.2 - Use graphical methods to solve Exercises 7–12....Ch. 7.2 - Prob. 9E Ch. 7.2 - Use graphical methods to solve Exercises 7–12....Ch. 7.2 - Use graphical methods to solve Exercises 7–12....Ch. 7.2 - Use graphical methods to solve Exercises 7–12....Ch. 7.2 - Find the minimum and maximum values of (if...Ch. 7.2 - Find the minimum and maximum values of (if...Ch. 7.2 - Find the minimum and maximum values of (if...Ch. 7.2 - Find the minimum and maximum values of (if...Ch. 7.2 - Prob. 17E Ch. 7.2 - 18. Find values and that maximize subject to...Ch. 7.2 - Prob. 19E Ch. 7.2 - Prob. 20E Ch. 7.3 - Prob. 1CP Ch. 7.3 - Prob. 2CP Ch. 7.3 - Prob. 3CP Ch. 7.3 - Prob. 1E Ch. 7.3 - Prob. 2E Ch. 7.3 - Prob. 3E Ch. 7.3 - Write the constraints in Exercises 1–4 as linear...Ch. 7.3 - Prob. 5E Ch. 7.3 - Solve these linear programming problems, which are...Ch. 7.3 - Prob. 7E Ch. 7.3 - Solve these linear programming problems, which are...Ch. 7.3 - Prob. 9E Ch. 7.3 - Prob. 10E Ch. 7.3 - Prob. 11E Ch. 7.3 - Solve these linear programming problems, which are...Ch. 7.3 - Prob. 13E Ch. 7.3 - Solve the following linear programming problems....Ch. 7.3 - Prob. 15E Ch. 7.3 - Prob. 16E Ch. 7.3 - Prob. 17E Ch. 7.3 - Prob. 18E Ch. 7.3 - Prob. 19E Ch. 7.3 - Prob. 20E Ch. 7.3 - Prob. 21E Ch. 7.3 - Solve the following linear programming problems....Ch. 7.3 - Prob. 23E Ch. 7.3 - Prob. 24E Ch. 7.3 - Prob. 25E Ch. 7.3 - Prob. 26E Ch. 7.3 - Prob. 27E Ch. 7.3 - Prob. 28E Ch. 7.3 - Prob. 29E Ch. 7.4 - Prob. 1CP Ch. 7.4 - Prob. 2CP Ch. 7.4 - Prob. 3CP Ch. 7.4 - Prob. 4CP Ch. 7.4 - Prob. 5CP Ch. 7.4 - Prob. 6CP Ch. 7.4 - Prob. 1E Ch. 7.4 - Prob. 2E Ch. 7.4 - In Exercises 1–4, (a) determine the number of...Ch. 7.4 - Prob. 4E Ch. 7.4 - Prob. 5E Ch. 7.4 - Prob. 6E Ch. 7.4 - Prob. 7E Ch. 7.4 - Prob. 8E Ch. 7.4 - Prob. 9E Ch. 7.4 - Prob. 10E Ch. 7.4 - Prob. 11E Ch. 7.4 - Prob. 12E Ch. 7.4 - Prob. 13E Ch. 7.4 - Prob. 14E Ch. 7.4 - Prob. 15E Ch. 7.4 - Prob. 16E Ch. 7.4 - Prob. 17E Ch. 7.4 - Prob. 18E Ch. 7.4 - Prob. 19E Ch. 7.4 - Prob. 20E Ch. 7.4 - Prob. 21E Ch. 7.4 - Use the simplex method to solve Exercises...Ch. 7.4 - Prob. 23E Ch. 7.4 - Prob. 24E Ch. 7.4 - Prob. 25E Ch. 7.4 - Prob. 26E Ch. 7.4 - Prob. 27E Ch. 7.4 - Prob. 28E Ch. 7.4 - Prob. 29E Ch. 7.4 - Prob. 30E Ch. 7.4 - Prob. 31E Ch. 7.4 - Prob. 32E Ch. 7.4 - Use the simplex method to solve Exercises...Ch. 7.4 - Prob. 34E Ch. 7.4 - Use the simplex method to solve Exercises...Ch. 7.4 - Use the simplex method to solve Exercises...Ch. 7.4 - Prob. 37E Ch. 7.4 - Prob. 38E Ch. 7.5 - Prob. 1CP Ch. 7.5 - Prob. 1E Ch. 7.5 - Prob. 2E Ch. 7.5 - Prob. 3E Ch. 7.5 - Set up the initial simplex tableau for each of the...Ch. 7.5 - In each of the given exercises, (a) use the...Ch. 7.5 - In each of the given exercises, (a) use the...Ch. 7.5 - In each of the given exercises, (a) use the...Ch. 7.5 - Prob. 8E Ch. 7.5 - Prob. 9E Ch. 7.5 - Prob. 10E Ch. 7.5 - Prob. 11E Ch. 7.5 - Prob. 12E Ch. 7.5 - Prob. 13E Ch. 7.5 - Prob. 14E Ch. 7.5 - Prob. 15E Ch. 7.5 - Prob. 16E Ch. 7.5 - Prob. 17E Ch. 7.5 - Prob. 18E Ch. 7.5 - Prob. 19E Ch. 7.5 - Prob. 20E Ch. 7.5 - Prob. 21E Ch. 7.5 - Prob. 22E Ch. 7.6 - Checkpoint 1 Give the transpose of each...Ch. 7.6 - Prob. 2CP Ch. 7.6 - Prob. 3CP Ch. 7.6 - Prob. 4CP Ch. 7.6 - Prob. 5CP Ch. 7.6 - Prob. 6CP Ch. 7.6 - Prob. 1E Ch. 7.6 - Prob. 2E Ch. 7.6 - Prob. 3E Ch. 7.6 - Prob. 4E Ch. 7.6 - Prob. 5E Ch. 7.6 - Prob. 6E Ch. 7.6 - Prob. 7E Ch. 7.6 - Prob. 8E Ch. 7.6 - Prob. 9E Ch. 7.6 - Prob. 10E Ch. 7.6 - Prob. 11E Ch. 7.6 - Prob. 12E Ch. 7.6 - Prob. 13E Ch. 7.6 - Prob. 14E Ch. 7.6 - Prob. 15E Ch. 7.6 - Prob. 16E Ch. 7.6 - Prob. 17E Ch. 7.6 - Prob. 18E Ch. 7.6 - Prob. 19E Ch. 7.6 - Prob. 20E Ch. 7.6 - Prob. 21E Ch. 7.6 - Prob. 22E Ch. 7.6 - Prob. 23E Ch. 7.6 - Prob. 24E Ch. 7.6 - Prob. 25E Ch. 7.6 - Prob. 26E Ch. 7.6 - Prob. 27E Ch. 7.6 - 28. Business An animal food must provide at least...Ch. 7.6 - Prob. 29E Ch. 7.6 - 30. Business Joan McKee has a part-time job...Ch. 7.6 - Prob. 31E Ch. 7.6 - Prob. 32E Ch. 7.6 - Prob. 33E Ch. 7.6 - Prob. 34E Ch. 7.7 - Prob. 1CP Ch. 7.7 - Prob. 2CP Ch. 7.7 - Prob. 3CP Ch. 7.7 - Prob. 4CP Ch. 7.7 - Prob. 5CP Ch. 7.7 - Prob. 1E Ch. 7.7 - Prob. 2E Ch. 7.7 - Prob. 3E Ch. 7.7 - Prob. 4E Ch. 7.7 - Prob. 5E Ch. 7.7 - Prob. 6E Ch. 7.7 - Prob. 7E Ch. 7.7 - Prob. 8E Ch. 7.7 - Prob. 9E Ch. 7.7 - Prob. 10E Ch. 7.7 - Prob. 11E Ch. 7.7 - Prob. 12E Ch. 7.7 - Prob. 13E Ch. 7.7 - Prob. 14E Ch. 7.7 - Prob. 15E Ch. 7.7 - Prob. 16E Ch. 7.7 - Prob. 17E Ch. 7.7 - Prob. 18E Ch. 7.7 - Prob. 19E Ch. 7.7 - Prob. 20E Ch. 7.7 - Prob. 21E Ch. 7.7 - Prob. 22E Ch. 7.7 - Prob. 23E Ch. 7.7 - Prob. 24E Ch. 7.7 - Prob. 25E Ch. 7.7 - Prob. 26E Ch. 7.7 - Prob. 27E Ch. 7.7 - Prob. 28E Ch. 7.7 - Prob. 29E Ch. 7.7 - Prob. 30E Ch. 7.7 - Prob. 31E Ch. 7.7 - Prob. 32E Ch. 7.7 - Prob. 33E Ch. 7.7 - Prob. 34E Ch. 7.7 - Prob. 35E Ch. 7.7 - Use the two-stage method to solve Exercises 33–40....Ch. 7.7 - Prob. 37E Ch. 7.7 - Prob. 38E Ch. 7.7 - Prob. 39E Ch. 7.7 - Prob. 40E Ch. 7.7 - Prob. 41E Ch. 7.7 - Prob. 42E Ch. 7.7 - Prob. 43E Ch. 7 - Prob. 1CE Ch. 7 - 2. Consider preparing a stir-fry using beef, oil,...Ch. 7 - Prob. EP Ch. 7 - Prob. 1RE Ch. 7 - Prob. 2RE Ch. 7 - Graph each of the given linear inequalities. 3. Ch. 7 - Prob. 4RE Ch. 7 - Prob. 5RE Ch. 7 - Prob. 6RE Ch. 7 - Prob. 7RE Ch. 7 - Prob. 8RE Ch. 7 - Prob. 9RE Ch. 7 - Prob. 10RE Ch. 7 - Prob. 11RE Ch. 7 - Prob. 12RE Ch. 7 - Prob. 13RE Ch. 7 - Use the graphical method to solve Exercises...Ch. 7 - Use the graphical method to solve Exercises...Ch. 7 - Prob. 16RE Ch. 7 - Prob. 17RE Ch. 7 - Prob. 18RE Ch. 7 - 19. Finance The BlackRock Equity Dividend Fund...Ch. 7 - Prob. 20RE Ch. 7 - Prob. 21RE Ch. 7 - Prob. 22RE Ch. 7 - Prob. 23RE Ch. 7 - Prob. 24RE Ch. 7 - Prob. 25RE Ch. 7 - Prob. 26RE Ch. 7 - Prob. 27RE Ch. 7 - Prob. 28RE Ch. 7 - Prob. 29RE Ch. 7 - Prob. 30RE Ch. 7 - Prob. 31RE Ch. 7 - Prob. 32RE Ch. 7 - Prob. 33RE Ch. 7 - Prob. 34RE Ch. 7 - Prob. 35RE Ch. 7 - Prob. 36RE Ch. 7 - 37. When is it necessary to use the simplex method...Ch. 7 - Prob. 38RE Ch. 7 - 39. What kind of problem can be solved with the...Ch. 7 - 40. In solving a linear programming problem, you...Ch. 7 - Prob. 41RE Ch. 7 - Prob. 42RE Ch. 7 - Prob. 43RE Ch. 7 - Prob. 44RE Ch. 7 - Prob. 45RE Ch. 7 - Use the method of duals to solve these...Ch. 7 - Prob. 47RE Ch. 7 - Prob. 48RE Ch. 7 - Prob. 49RE Ch. 7 - Prob. 50RE Ch. 7 - Prob. 51RE Ch. 7 - Prob. 52RE Ch. 7 - Use the two-stage method to solve these...Ch. 7 - Prob. 54RE Ch. 7 - Prob. 55RE Ch. 7 - Prob. 56RE Ch. 7 - Business Solve the following maximization...Ch. 7 - Prob. 58RE Ch. 7 - Business Solve the following maximization...Ch. 7 - Prob. 60RE Ch. 7 - Prob. 61RE Ch. 7 - Business Solve the following minimization...Ch. 7 - Business Solve these mixed-constraint...Ch. 7 - Business Solve these mixed-constraint...

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.