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.8, Problem 25P
Summary Introduction
Interpretation: Rectilinear distance and Euclidean distances for the exiting facilities located at different points are to be calculated.
Concept Introduction:
Rectilinear distance refers to the sum of the distance between two facilities, whereas Euclidean distance is nothing but the simple measurement of a straight line lies between two facilities.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Three 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.
Design 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 facility
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
- 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.)arrow_forwardConsider above problem. Suppose that the weight of facility 2 is 20. Applying the median method, it can be verified that the optimal location is (10, 10) - the centroid of department 2, where immovable structures exist. It is now desired to find a feasible and “near-optimal” location using the contour line method.arrow_forwardOscar's Bowling, Inc., wants to break into the Phoenix metropolitan market with one of its super-sized 200 lane, 24-hour bowling alleys. It, however, only has enough capital to build one facility. Oscar wants it to be centered by population, as determined by the center of gravity method. The following information is given: City Population x coordinate y coordinate Tempe 275,000 5 5 Scottsdale 415,000 5 10 Chandler 310,000 5 0 Mesa 660,000 10 1 Glendale 335,000 1 10 a. Where should Oscar build? Oscar should build at an x coordinate of nothing and a y coordinate of nothing. b. If Oscar wanted to relocate to the closest city near his new facility, where would he live? (Enter your responses rounded to one decimal place.)arrow_forward
- Oscar’s Bowling, Inc., wants to break into the Phoenix metropolitan market with one of its super-sized 200 lane, 24-hour bowling alleys. It, however, only has enough capital to build one facility. Oscar wants it to be centered by population, as determined by the center of gravity method. The following information is given: City Population x coordinate y coordinate Tempe Scottsdale Chandler Mesa Glendale 250,000 400,000 300,000 700,000 350,000 5 5 5 10 1 5 10 0 1 10 a. Where should Oscar build? b. If Oscar wanted to relocate to the closest city near his new facility, where would he live?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_forwardThe distance between two cities in the United States can be approximated by the following formula, where lat1 and long1 are the latitude and longitude of city 1 and lat2 and long2 are the latitude and longitude of city 2. 69 (lat1 − lat2)2 + (long1 − long2)2 Ted's daughter is getting married, and he is inviting relatives from 15 different locations in the United States. The file Wedding gives the longitude, latitude, and number of relatives in each of the 15 locations. Ted would like to find a wedding location that minimizes the demand-weighted distance, where demand is the number of relatives at each location. Assuming that the wedding can occur anywhere, find the latitude and longitude of the optimal location. (Hint: Notice that all longitude values given for this problem are negative. Make sure that you do not check the option for Make Unconstrained Variables Non-Negative in Solver. Round your answers to three decimal places.) latitude of the optimal wedding location:…arrow_forward
- A company wants to expand its offices to different cities in the future which might cost them alot and will lower their companies revenue suggest three alternatives with advanatges and disadvanatges they can opt for instead of building offices in different citiesarrow_forwardThe 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_forwardModify the warehouse location model as suggested inModeling Issue 2. Specifically, assume that the samefour customers have the same annual shipments, butnow, there are only two possible warehouse locations,each with distances to the various customers. (Thesedistances, along with other inputs, are in the fileP07_27.xlsx.) The company can build either or bothof these warehouses. The cost to build a warehouseis $50,000. (You can assume that this cost has beenannualized. That is, the company incurs a buildingcost that is equivalent to $50,000 per year.) If onlyone warehouse is built, it will ship to all customers. However, if both warehouses are built, then the com-pany must decide which warehouse will ship to each customer. There is a traveling cost of $1 per mile.a. Develop an appropriate model to minimize totalannual cost, and then use Solver to optimize it.Is this model an NLP or an IP model (or both)?b. Use SolverTable with a single input, the traveling costper mile, to see how large…arrow_forward
- Draw 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_forwardDue to increased sales, a company is considering building three new distribution centers (DCs) to serve four regional sales areas. The annual cost to operate DC 1 is $500 (in thousands of dollars). The cost to operate DC 2 is $600 (in thousands of dollars.). The cost to operate DC 3 is $525 (in thousands of dollars). Assume that the variable cost of operating at each location is the same, and therefore not a consideration in making the location decision. The table below shows the cost ($ per item) for shipping from each DC to each region. Region DC A B C D 1 1 3 3 2 2 2 4 1 3 3 3 2 2 3 The demand for region A is 70,000 units; for region B, 100,000 units; for region C, 50,000 units; and for region D, 80,000 units. Assume that the minimum capacity for the distribution center will be 500,000 units. Write the constraints for the three distribution centers.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_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,