Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11.9, Problem 35P
Summary Introduction
Interpretation: Contour lines for two facilities located at
Concept Introduction: The line that passes through or drawn through points having the same value is called a contour line.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Assign nine automobile service departments to bays in a 3 × 3 grid so that the closeness ratings Problem 2 in the following matrix are satisfied. (The unimportant and ordinary-importance ratings have been omitted to simplify the example.) The location of department 4 must be in the upper right-hand corner of the grid to satisfy a town ordinance.
An electronics firm located near Phoenix, Arizona, is considering where to locate a new phone switch that will link five buildings. The buildings are located at (0, 0), (2, 6), (10, 2), (3, 9), and (0, 4). The objective is to locate the switch to minimize the cabling required to those five buildings.a. Determine the gravity solution.b. Determine the optimal location assuming a straight-line distance measure. (If you are solving this problem by hand, iterate the appropriate equations at least five times and estimate the optimal solution.)
Consider the following apportionment problem, table[]North, 18, 400, East: 17,400 (South: 12,200, West: 14,000, Use the apportionment plan requested below assuming that there must be zs representatives. Jefferson's plan North South East West
Chapter 11 Solutions
Production and Operations Analysis, Seventh Edition
Ch. 11.3 - Prob. 1PCh. 11.3 - Prob. 2PCh. 11.3 - Prob. 3PCh. 11.3 - Prob. 4PCh. 11.3 - Prob. 5PCh. 11.3 - Prob. 6PCh. 11.4 - Prob. 7PCh. 11.4 - Prob. 8PCh. 11.5 - Prob. 10PCh. 11.6 - Prob. 11P
Ch. 11.6 - Prob. 12PCh. 11.6 - Prob. 13PCh. 11.6 - Prob. 14PCh. 11.6 - Prob. 15PCh. 11.6 - Prob. 16PCh. 11.6 - Prob. 17PCh. 11.6 - Prob. 18PCh. 11.6 - Prob. 19PCh. 11.7 - Prob. 20PCh. 11.7 - Prob. 21PCh. 11.7 - Prob. 22PCh. 11.7 - Prob. 23PCh. 11.8 - Prob. 24PCh. 11.8 - Prob. 25PCh. 11.8 - Prob. 26PCh. 11.8 - Prob. 27PCh. 11.9 - Prob. 28PCh. 11.9 - Prob. 29PCh. 11.9 - Prob. 30PCh. 11.9 - Prob. 31PCh. 11.9 - Prob. 32PCh. 11.9 - Prob. 33PCh. 11.9 - Prob. 34PCh. 11.9 - Prob. 35PCh. 11.9 - Prob. 36PCh. 11.9 - Prob. 37PCh. 11.9 - Prob. 38PCh. 11.10 - Prob. 39PCh. 11.10 - Prob. 40PCh. 11.10 - Prob. 41PCh. 11.11 - Prob. 42PCh. 11.11 - Prob. 43PCh. 11.11 - Prob. 45PCh. 11 - Prob. 46APCh. 11 - Prob. 47APCh. 11 - Prob. 48APCh. 11 - Prob. 49APCh. 11 - Prob. 50APCh. 11 - Prob. 51APCh. 11 - Prob. 52APCh. 11 - Prob. 53APCh. 11 - Prob. 54APCh. 11 - Prob. 55APCh. 11 - Prob. 56APCh. 11 - Prob. 58AP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- Solve the linear programming problem by the method of corners. Minimize C = 6x + 7y subject to 4x + y ≥ 42 2x + y ≥ 30 x + 3y ≥ 30 x ≥ 0, y ≥ 0 The minimum is C = at (x, y) =arrow_forwardA company has n factories. Factory i is located at point(xi, yi), in the x–y plane. The company wants to locate awarehouse at a point (x, y) that minimizes ini1(distance from factory i to warehouse)2Where should the warehouse be located?arrow_forwardThree existing facilities are located at (0, 0), (5, 5), and (10, 10). The weights applied to these facilities are 1, 2, and 3, respectively. Find the location of a new facility that minimizes the weighted Euclidean distance to the existing facilities.arrow_forward
- The accompanying tableau represents the shipping costs and supply-and-demand constraints for supplies of purified water to be shipped to companies that resell the water to office buildings. Use the Stepping Stone Method to find an optimal solution for graph "a".arrow_forwardMaximal Flow a. Write the linear program for this problem. b. Create a spreadsheet model to find the maximal flow from node 1 to 6arrow_forwardDesign a spreadsheet to compute the total rectilinear distance from a set of up to10 existing locations to any other location. Assume that existing locations areplaced in Columns A and B and the new location in cells D1 and E1. Initializecolumn A with the value of cell D1 and column B with the value of cell E1, so thatthe total distance will be computed correctly when there are fewer than10 locations.a. Suppose that existing facilities are located at (0, 0), (5, 15), (110, 120), (35, 25),(80, 10), (75, 20), (8, 38), (50, 65), (22, 95), and (44, 70), and the new facility is tobe located at (50, 50). Determine the total rectilinear distance of the new facilityto the existing facilities.b. Suppose the new facility in part (a) can be located only at x =0, 5, 10, . . . , 100and y = 0, 10, 20, . . . , 100. By systematically varying the x and y coordinates,find the optimal location of the new facilityarrow_forward
- Consider the transportation table below. REQUIRED:(a) Use the Northwest-Corner Method, the Least-Cost Method and the VAM to get the starting feasible solution.(b) Find the optimal solution by considering the smallest value of the objective function computed in (a).arrow_forwardMitch just built 4 franchise locations for his newest pizzerias and wants to decide where to put his headquarters. He makes 1 weekly visit to his Northside store (X = 3, Y = 10), 2 visits to his Eastside store (X = 4, Y = 6), 3 visits to his Southside store (X = 2, Y = 5) & 4 visits to his Westside store (X = 1, Y = 4). __________ 1. Using the store visits as weights, compute the coordinates of the center of gravity to help him with his location decision.arrow_forwardIdentify the range of feasibility for the right-hand-side values. (If there is no upper or lower limit, enter NO LIMIT.) constraint 1 ______ to_______ constraint 2 ______to_______ constraint 3 ______to_______arrow_forward
- Consider the transportation problem having the cost and requirement table below. a. Obtain the initial basic feasible solution using all the three methods (i. Northwest-Corner, ii. Least-Cost and iii. VAM) and determine the value of z. b. Use the most optimal initial basic feasible solution from (a) as your starting point to find the optimal solution. c. Draw a network showing the quantities obtained in the final iteration and the optimal value of z.arrow_forwardA telecommunications system is going to be installed at a company site. Theswitching center that governs the system must be located in one of the five buildingsto be served. The goal is to minimize the amount of underground cabling required.In which building should the switching center be located? Assume a straight-linedistance measure.Building Location1 (10, 10)2 (0, 4)3 (6, 15)4 (8, 20)5 (15, 0)arrow_forwardDraw the network for this transportation problem. (Let xij represent the flow from node i to node j.) Min 2x13 + 4x14 + 6x15 + 8x23 + 11x24 + 9x25 s.t. x13 + x14 + x15 ≤ 500 x23 + x24 + x25 ≤ 400 x13 + x23 = 300 x14 + x24 = 300 x15 + x25 = 300 xij ≥ 0arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,