Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

3 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

4 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

30) The first step in solving a linear programming model manually with the simplex method is to convert the model into ________ form. Answer: standard Diff: 2 Keywords: standard form 31) The ________ values are contribution to profit for each variable. Answer: cj Diff: 2 Keywords: cj values, contribution to profit. 32) The ________ values are computed by multiplying the cj column values by the variable column values and summing. Answer: zj Diff: 2 Keywords: zj values 33) The ________ variable allows for an initial basic feasible solution, but it has no meaning. Therefore, after we get the simplex tableau started, they are discarded in later iterations. Answer: artificial Diff: 2 Keywords: artificial variables 34) In solving a minimization problem, artificial variables are assigned a ________ in the objective function to eliminate them from the final solution. Answer: large cost Diff: 2 Keywords: artificial variables 35) A(n) ________ maximization linear programming problem has an artificial variable in the final simplex tableau where all cj - zj values are less than or equal to zero. Answer: infeasible Diff: 2 Keywords: infeasible problem, infeasible solution 36) In using the simplex method, ________ optimal solutions are identified by cj - zj = 0 for a non-basic variable. Answer: multiple or alternative Diff: 2 Keywords: alternative optimal solutions, multiple optimal solutions 37) A primal maximization model with â&#x2030;¤ constraints converts to a ________ minimization model with constraints. Answer: dual Diff: 2 Keywords: dual model

5 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

38) The quantity values on the right-hand side of the primal inequality constraints are the ________ coefficients in the dual. Answer: objective function Diff: 2 Keywords: dual model 39) If the primal problem has three constraints, then the corresponding dual problem will have three ________. Answer: decision variables Diff: 2 Keywords: dual model 40) Whereas the maximization primal model has ≤ constraints, the ________ dual model has ≥ constraints. Answer: minimization Diff: 1 Keywords: dual model 41) ________ in linear programming is when a basic variable takes on a value of zero (i.e., a zero in the right-hand side of the constraints of the tableau). Answer: Degeneracy Diff: 2 Keywords: degeneracy 42) In a ________ problem, artificial variables are assigned a very high cost. Answer: minimization Diff: 1 Keywords: artificial variables 43) A(n) ________ problem can be identified in the simplex procedure when it is not possible to select a pivot row. Answer: unbounded Diff: 2 Keywords: simplex irregularity, unbounded solution 44) The ________ form of a linear program is used to determine how much one should pay for additional resources. Answer: dual Diff: 2 Keywords: dual 45) To determine the sensitivity range for the coefficient of a variable in the objective function, calculations are performed such that all values in the cj - zj row are ________. Answer: less than or equal to zero Diff: 2 Keywords: sensitivity analysis

6 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

46) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 What are the basic variables in the initial tableau? Answer: S1, S2 Diff: 1 Section Heading: The Simplex Method Keywords: basic variables, initial tableau 47) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 What are the Cj values for the basic variables? Answer: 0, 0 Diff: 1 Section Heading: The Simplex Method Keywords: basic variables, objective function coefficients 48) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 What is the (Cj - Zj) value for S1 at the initial solution? Answer: 0 Diff: 1 Section Heading: The Simplex Method Keywords: Cj - Zj values 49) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 What is the (Ci- Zi) value for S2 at the initial solution? Answer: 0 Diff: 1 Section Heading: The Simplex Method Keywords: Cj - Zj values

7 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

50) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 What is the value of X1 in the final tableau? Answer: 0 or 4.25 Diff: 2 Section Heading: The Simplex Method Keywords: simplex method, simplex tableaus 51) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 What is the value of x2 in the final tableau? Answer: 2 or 7.667 Diff: 2 Section Heading: The Simplex Method Keywords: simplex method, simplex tableaus 52) Solve the following problem using the simplex method. Minimize Z = 3x1 + 4x2 + 8x3 Subject to: 2x1 + x2 ≥ 6 x2 + 2x3 ≥ 4 x1, x2 ≥ 0 Answer: x1 = 1, x2 = 4, x3 = 0 and Z = 19 Diff: 3 Section Heading: The Simplex Method Keywords: simplex method, simplex tableaus 53) Solve the following problem using the simplex method. Minimize Z = 2x1 + 6x2 Subject to: 2x1 + 4x2 ≤ 12 3x1 + 2x2 ≥ 9 x1, x2 ≥ 0 Answer: x1 = 1.5, x2 = 2.25, and Z = 16.5 Diff: 3 Section Heading: The Simplex Method Keywords: simplex method, simplex tableaus

8 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

54) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 What is the optimal value of this objective function? Answer: 23 Diff: 2 Section Heading: The Simplex Method Keywords: objective function value, simplex tableaus 55) Given the following linear programming problem: maximize 4x1 + 3x2 subject to 4x1 + 3x2 ≤ 23 5x1 - x2 ≤ 5 x1, x2 ≥ 0 How many iterations did we have to perform before reaching the final tableau? Answer: 3 Diff: 3 Section Heading: The Simplex Method Keywords: simplex tableaus, simplex iterations 56) Given the following linear programming problem: maximize Z = \$100x1 + 80x2 subject to x1 + 2x2 ≤ 40 3x1 + x2 ≤ 60 x1, x2 ≥ 0 Using the simplex method, what is the optimal value for X1? Answer: 16 Diff: 2 Section Heading: The Simplex Method Keywords: simplex tableaus, simplex iterations 57) Given the following linear programming problem: maximize Z = \$100x1 + 80x2 subject to x1 + 2x2 ≤ 40 3x1 + x2 ≤ 60 x1, x2 ≥ 0 Using the simplex method, what is the optimal value for X2? Answer: 12 Diff: 2 Section Heading: The Simplex Method Keywords: simplex tableaus, simplex iterations

9 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

58) Given the following linear programming problem: maximize Z = \$100x1 + 80x2 subject to x1 + 2x2 ≤ 40 3x1 + x2 ≤ 60 x1, x2 ≥ 0 Using the simplex method, what is the value for S2 in the optimal tableau? Answer: 0 Diff: 2 Section Heading: The Simplex Method Keywords: simplex tableaus, simplex iterations 59) Given the following linear programming problem: maximize Z = \$100x1 + 80x2 subject to x1 + 2x2 ≤ 40 3x1 + x2 ≤ 60 x1, x2 ≥ 0 Using the simplex method, what is the optimal value for the objective function? Answer: \$2560 Diff: 2 Section Heading: The Simplex Method Keywords: objective function value 60) Given the following linear programming problem: maximize Z = \$100x1 + 80x2 subject to x1 + 2x2 ≤ 40 3x1 + x2 ≤ 60 x1, x2 ≥ 0 Using the simplex method, what is the value for S1 in the final basic feasible solution? Answer: 0 Diff: 2 Section Heading: The Simplex Method Keywords: slack variables, simplex iterations

10 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

The linear programming problem whose output follows determines how many red nail polishes, blue nail polishes, green nail polishes, and pink nail polishes a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes. Constraints 3 and 4 are marketing restrictions. MAX 100x1 + 120x2 + 150x3 + 125x4 Subject to 1. x1 + 2x2 + 2x3 + 2x4 ≤ 108 2. 3x1 + 5x2 + x4 ≤ 120 3. x1 + x3 ≤ 25 4. x2 + x3 + x4 > 50 x1, x2, x3, x4 ≤ 0 Optimal Solution: Objective Function Value = 7475.000

Objective Coefficient Ranges

Right Hand Side Ranges

61) How much space will be left unused? Answer: 0 Diff: 1 Section Heading: The Simplex Method 11 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

Keywords: computer output of linear programming method, slack variables

12 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

13 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

69) Consider the following linear programming problem: MAX s.t.

Z = 10x1 + 30x2 4x1 + 6x2 ≤ 12 8x1 + 4x2 ≤ 16

Use the two tables below to create the initial tableau and perform 1 pivot.

14 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

Diff: 2 Section Heading: The Simplex Method Keywords: simplex procedure 70) Consider the following linear programming problem and the corresponding final tableau. MAX s.t.

Z = 3x1 + 5x2 x1 ≤ 4 2x2 ≤ 12 3x1 + 2x2 ≥ 18

What is the shadow price for each constraint? Answer: constraint 1, 3; constraint 2, 2.5; constraint 3, 0 Diff: 2 Section Heading: The Simplex Method Keywords: sensitivity analysis, shadow price

15 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

71) Consider the following linear programming problem and the corresponding final tableau. MAX s.t.

Z = 3x1 + 5x2 x1 ≤ 4 2x2 ≤ 12 3x1 + 2x2 ≥ 18

What is the sensitivity range for the first constraint? Answer: maximum decrease of 2, and an infinite increase Diff: 2 Section Heading: The Simplex Method Keywords: sensitivity analysis, quantity ranges for constraints 72) Write the dual form of the following linear program. MAX s.t.

Z = 3x1 + 5x2 x1 ≤ 4 2x2 ≤ 12 3x1 + 2x2 ≥ 18

Answer: MIN Zd = 4y1 + 12y2 + 18y3 s.t. y1 + 3y3 ≥ 3 2y2 + 2y3 ≥ 5 Diff: 2 Section Heading: The Simplex Method Keywords: dual form

16 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

73) The simplex method ________ be used to solve quadratic programming problems. A) can B) cannot C) may D) should Answer: B Diff: 2 Section Heading: Converting the Model into Standard Form Keywords: simplex method 74) The simplex method is a general mathematical solution technique for solving ________ programming problems. A) integer B) non-linear C) linear D) A, B, and C Answer: C Diff: 2 Section Heading: Converting the Model into Standard Form Keywords: simplex method 75) Slack variables are added to ________ constraints and represent unused resources. A) ≤ B) < C) ≥ D) > E) = Answer: A Diff: 2 Section Heading: Converting the Model into Standard Form Keywords: slack variables 76) The ________ step in solving a linear programming model manually with the simplex method is to convert the model into standard form. A) first B) second C) last D) only Answer: A Diff: 2 Section Heading: Converting the Model into Standard Form Keywords: standard form, simplex method

17 Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

77) Row operations are used to solve simultaneous equations where equations are ________ by constants and added to or subtracted from each other. A) converted B) restrained C) divided D) multiplied Answer: D Diff: 3 Section Heading: Converting the Model into Standard Form Keywords: row operations, simultaneous equations 78) The basic feasible solution in the initial simplex tableau is the origin where all decision variables equal: A) 0 B) 1 C) -1 D) 1 or -1 Answer: A Diff: 3 Section Heading: The Simplex Method Keywords: basic feasible solution, initial simplex tableau 79) At the initial basic feasible solution at the origin, only slack variables have a value greater than: A) 0 B) 1 C) -1 D) 1 or -1 Answer: A Diff: 3 Section Heading: The Simplex Method Keywords: basic feasible solution, initial simplex tableau 80) At the initial basic feasible solution at the origin, only ________ variables have a value greater than zero. A) linear B) slack C) non-linear D) integer Answer: B Diff: 1 Section Heading: The Simplex Method Keywords: basic feasible solution

18 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

19 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

85) The objective function coefficient of an artificial variable for a minimization linear programming problem is: A) +M B) -M C) 0 D) 1 E) an arbitrary value between 0 and positive infinity Answer: A Diff: 2 Section Heading: The Simplex Method Keywords: artificial variables 86) If a slack variable has a positive value (is basic) in the optimal solution to a linear programming problem, then the shadow price of the associated constraint A) is always zero. B) is always greater than zero. C) is always less than zero. D) could be any value (i.e., zero greater than zero or less than zero). Answer: A Diff: 2 Section Heading: The Simplex Method Keywords: slack variable, shadow price 87) In the simplex procedure, if cj - zj = 0 for a non-basic variable, this indicates that A) the solution is infeasible. B) the solution is unbounded. C) there are multiple optimal solutions. D) the formulation is incorrect. Answer: C Diff: 2 Section Heading: The Simplex Method Keywords: simplex irregularity, multiple optimal solutions 88) In the simplex procedure, if it is not possible to select a pivot row, this indicates that A) the solution is infeasible. B) the solution is unbounded. C) there are multiple optimal solutions. D) the formulation is incorrect. Answer: B Diff: 2 Section Heading: The Simplex Method Keywords: simplex irregularity, unbounded solution

20 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Full file at http://testbank360.eu/test-bank-introduction-to-management-science-11th-edition-taylor

89) In the simplex procedure, if all cj - zj â&#x2030;¤ 0 and one or more of the basic variables are artificial, this indicates that A) the solution is infeasible. B) the solution is unbounded. C) there are multiple optimal solutions. D) the formulation is incorrect. Answer: A Diff: 2 Section Heading: The Simplex Method Keywords: simplex irregularity, infeasible solution 90) The ________ form of a linear program is used to determine how much one should pay for additional resources. A) standard B) primal C) feasible D) dual E) simplex Answer: D Diff: 2 Section Heading: The Simplex Method Keywords: dual

21 Copyright ÂŠ 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall

Test bank introduction to management science 11th edition taylor

test bank introduction to management science 11th edition taylor. Full file at http://testbank360.eu/test-bank-introduction-to-manageme...