The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/ PDF Free Download

The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014 Name TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) In a transportation problem, each destination must be supplied by one and only one source. 1) 2) A "balanced problem" exists in a transportation model when the optimal solution has the same amount being shipped over all paths that have any positive shipment. 2) 3) There are no limitations on the number of constraints or variables that can be graphed to solve an LP problem. 3) 4) In a transportation problem, a single source may supply something to all destinations. 4) 5) In the term linear programming, the word programming comes from the phrase "computer programming." 5) 6) Since the production mix linear program applications are a special situation, the number of decision variables is limited to two. 6) 7) In a linear program, the constraints must be linear, but the objective function may be nonlinear. 7) 8) In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row. 8) 9) An objective function is necessary in a maximization problem but is not required in a minimization problem. 9) 10) Any linear programming problem can be solved using the graphical solution procedure. 10) MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) Which of the following methods is used only with the assignment problem? A) the Hungarian method B) stepping-stone method C) MODI method D) Vogel's approximation method E) the simplex method 1) 2) In revising the opportunity cost table of the assignment problem, after drawing lines through all of the zeros, A) the smallest uncovered number is added to all zeros. B) the smallest uncovered number is added to all uncovered numbers. C) the largest uncovered number is added to all uncovered numbers. D) the smallest uncovered number is added to all numbers at the intersection of lines. E) the largest uncovered number is added to all numbers at the intersection of lines. 2) A-1

3) If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be A) unbounded. B) non-negative. C) infeasible. D) redundant. E) bounded. 3) 4) In order for a linear programming problem to have multiple solutions, the solution must exist A) at the intersection of the non-negativity constraints. B) on a non-redundant constraint parallel to the objective function. C) at the intersection of the objective function and a constraint. D) at the intersection of three or more constraints. 4) 5) Which of the following is not a step in the Hungarian method of assignment? A) find the opportunity-cost table B) test for an optimal assignment C) enumerate all possible solutions D) revise the opportunity-cost table 5) 6) Practically speaking, multiple optimal solutions. A) are infeasible B) are unbounded C) are degenerate D) are unbalanced E) provide management with greater flexibility in selecting and using resources 6) 7) The difference between the left-hand side and right-hand side of a greater-than-or-equal-to constraint is referred to as A) surplus. B) constraint. C) slack. D) shadow price. 7) 8) If the total supply from the sources does not equal the total demand from the destinations in the transportation problem, A) and if supply is greater than demand, add a dummy source or factory. B) the amount put in a dummy source or destination should make supply and demand equal. C) and if demand is greater than supply, add a dummy destination or warehouse. D) All of the above 8) A-2

9) Which of the following is not acceptable as a constraint in a linear programming problem (maximization)? 9) Constraint 1 X + XY + Y 12 Constraint 2 X - 2Y 20 Constraint 3 X + 3Y = 48 Constraint 4 X + Y + Z 150 A) Constraint 1 B) Constraint 2 C) Constraint 3 D) Constraint 4 10) Two models of a product Regular (X) and Deluxe (Y) are produced by a company. A linear programming model is used to determine the production schedule. The formulation is as follows: 10) Maximize profit = 50X + 60Y Subject to: 8X + 10Y 800 (labor hours) X + Y 120 (total units demanded) 4X +10Y 500 (raw materials) X, Y 0 The optimal solution is X=100, Y=0. Which of these constraints is redundant? A) the first constraint B) the second constraint C) the third constraint D) All of the above A-3

ESSAY. Write your answer in the space provided or on a separate sheet of paper. 1) Two advertising media are being considered for promotion of a product. Radio ads cost $400 each, while newspaper ads cost $600 each. The total budget is $7,200 per week. The total number of ads should be at least 15, with at least 2 of each type. Each newspaper ad reaches 6,000 people, while each radio ad reaches 2,000 people. The company wishes to reach as many people as possible while meeting all the constraints stated. a) Formualte this as a linear programming problem. b) Find the dual for the primal problem in (a) c) Find the solution of the dual in (b) if the optimal solution for the primal problem in (a) is 9 radio and 6 newspaper ads. and the maximum exposure 54,000. How many ads of each type should be placed? A-4

2) A certain firm has four different operations that must be assigned to four locations. The profit (in thousands of dollars) associated with each operation at each location is presented below. The firm's vice president would like to assign the various operations so that the total profit is maximized. Find the appropriate assignments. A-5

3) SE Appliances manufacturers refrigerators in Richmond, Charlotte, and Atlanta. Refrigerators then must be shipped to meet demand in Washington, New York, and Miami. The table below lists the shipping costs, supply, and demand information. How many units should be shipped from each plant to each retail store in order to minimize shipping costs using: a) Northwest corner method b) Vogel's Approximation method c} What is the cost difference between the two methods? A-6

Answer Key Testname: EXAM 2 1) FALSE 2) FALSE 3) FALSE 4) TRUE 5) FALSE 6) FALSE 7) FALSE 8) FALSE 9) FALSE 10) FALSE 1) A 2) D 3) D 4) B 5) C 6) E 7) A 8) B 9) A 10) B 1) Let R = number of radio ads placed N = number of newspaper ads placed Maximize 2000R + 6000N Subject to: R + N 15 400R + 600N 7200 R 2 N 2 R, N 0 Feasible corner points (R,N): (9,6) (13,2) (15,2) Maximum exposure 54,000 with 9 radio and 6 newspaper ads. 2) Assign W to 2, X to 4, Y to 3, and Z to 1. Total profit = $48 (thousand) 3) Ship 1000 units from Richmond to New York, 1000 units from Charlo e to Washington, 800 units from Atlanta to New York, and 1200 units from Atlanta to Miami, with the 500 from Charlo e to the Dummy unshipped. A-1

The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014 Name TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) In a transportation problem, each destination must be supplied by one and only one source. 1) 2) A "balanced problem" exists in a transportation model when the optimal solution has the same amount being shipped over all paths that have any positive shipment. 2) 3) There are no limitations on the number of constraints or variables that can be graphed to solve an LP problem. 3) 4) In a transportation problem, a single source may supply something to all destinations. 4) 5) In the term linear programming, the word programming comes from the phrase "computer programming." 5) 6) Since the production mix linear program applications are a special situation, the number of decision variables is limited to two. 6) 7) In a linear program, the constraints must be linear, but the objective function may be nonlinear. 7) 8) In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row. 8) 9) An objective function is necessary in a maximization problem but is not required in a minimization problem. 9) 10) Any linear programming problem can be solved using the graphical solution procedure. 10) MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) Which of the following methods is used only with the assignment problem? A) the simplex method B) MODI method C) Vogel's approximation method D) stepping-stone method E) the Hungarian method 1) 2) In revising the opportunity cost table of the assignment problem, after drawing lines through all of the zeros, A) the largest uncovered number is added to all uncovered numbers. B) the smallest uncovered number is added to all numbers at the intersection of lines. C) the largest uncovered number is added to all numbers at the intersection of lines. D) the smallest uncovered number is added to all zeros. E) the smallest uncovered number is added to all uncovered numbers. 2) B-1

3) If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be A) bounded. B) redundant. C) non-negative. D) infeasible. E) unbounded. 3) 4) In order for a linear programming problem to have multiple solutions, the solution must exist A) at the intersection of the non-negativity constraints. B) on a non-redundant constraint parallel to the objective function. C) at the intersection of three or more constraints. D) at the intersection of the objective function and a constraint. 4) 5) Which of the following is not a step in the Hungarian method of assignment? A) test for an optimal assignment B) find the opportunity-cost table C) enumerate all possible solutions D) revise the opportunity-cost table 5) 6) Practically speaking, multiple optimal solutions. A) are degenerate B) are infeasible C) are unbounded D) are unbalanced E) provide management with greater flexibility in selecting and using resources 6) 7) The difference between the left-hand side and right-hand side of a greater-than-or-equal-to constraint is referred to as A) surplus. B) shadow price. C) constraint. D) slack. 7) 8) If the total supply from the sources does not equal the total demand from the destinations in the transportation problem, A) the amount put in a dummy source or destination should make supply and demand equal. B) and if demand is greater than supply, add a dummy destination or warehouse. C) and if supply is greater than demand, add a dummy source or factory. D) All of the above 8) B-2

9) Which of the following is not acceptable as a constraint in a linear programming problem (maximization)? 9) Constraint 1 X + XY + Y 12 Constraint 2 X - 2Y 20 Constraint 3 X + 3Y = 48 Constraint 4 X + Y + Z 150 A) Constraint 1 B) Constraint 2 C) Constraint 3 D) Constraint 4 10) Two models of a product Regular (X) and Deluxe (Y) are produced by a company. A linear programming model is used to determine the production schedule. The formulation is as follows: 10) Maximize profit = 50X + 60Y Subject to: 8X + 10Y 800 (labor hours) X + Y 120 (total units demanded) 4X +10Y 500 (raw materials) X, Y 0 The optimal solution is X=100, Y=0. Which of these constraints is redundant? A) the third constraint B) the second constraint C) the first constraint D) All of the above B-3

Answer Key Testname: EXAM 2 1) FALSE 2) FALSE 3) FALSE 4) TRUE 5) FALSE 6) FALSE 7) FALSE 8) FALSE 9) FALSE 10) FALSE 1) E 2) B 3) B 4) B 5) C 6) E 7) A 8) A 9) A 10) B 1) Let R = number of radio ads placed N = number of newspaper ads placed Maximize 2000R + 6000N Subject to: R + N 15 400R + 600N 7200 R 2 N 2 R, N 0 Feasible corner points (R,N): (9,6) (13,2) (15,2) Maximum exposure 54,000 with 9 radio and 6 newspaper ads. 2) Assign W to 2, X to 4, Y to 3, and Z to 1. Total profit = $48 (thousand) 3) Ship 1000 units from Richmond to New York, 1000 units from Charlo e to Washington, 800 units from Atlanta to New York, and 1200 units from Atlanta to Miami, with the 500 from Charlo e to the Dummy unshipped. B-1