Operations Management: Processes and Supply Chains (12th Edition) (What's New in Operations Management)
12th Edition
ISBN: 9780134741062
Author: Lee J. Krajewski, Manoj K. Malhotra, Larry P. Ritzman
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 13, Problem 1P
A
Summary Introduction
Interpretation: The Euclidean distance between each of the three pairs of facilities is to be calculated.
Concept Introduction: Plant location means to choose a particular region for setting up a business. Choosing a place for the plant is most essential in order to get maximum profit. So it is very crucial to identify an ideal place, where all the capital is brought together for the progress of the business.
B
Summary Introduction
Interpretation: The Rectilinear distance between each of the three pairs of facilities is to be calculated.
Introduction: Plant location means to choose a particular region for setting up a business. Choosing a place for the plant is most essential in order to get maximum profit. So it is very crucial to identify an ideal place, where all the capital is brought together for the progress of the business.
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.
PLEASE SHOW ALL FORMULA
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows):
Potential Rep Home
City Served?
Albuquerque
El Paso
Denver
Phoenix
San Diego
Los Angeles
San Francisco
Portland
Seattle
Las Vegas
Salt Lake City
Albuquerque
1
1
1
1
0
0
0
0
0
0
0
El Paso
1
1
0
1
0
0
0
0
0
0
0
Denver
1
0
1
1
0
0
0
0
0
0
1
Phoenix
1
1
1
1
1
1
0
0
0
1
1
San Diego
0
0
0
1
1
1…
The 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:…
Chapter 13 Solutions
Operations Management: Processes and Supply Chains (12th Edition) (What's New in Operations Management)
Ch. 13 - Prob. 1DQCh. 13 - Prob. 2DQCh. 13 - Prob. 3DQCh. 13 - Prob. 1PCh. 13 - Prob. 2PCh. 13 - Prob. 3PCh. 13 - Prob. 4PCh. 13 - Prob. 5PCh. 13 - Prob. 6PCh. 13 - Prob. 7P
Ch. 13 - Prob. 8PCh. 13 - Prob. 9PCh. 13 - Prob. 10PCh. 13 - Prob. 11PCh. 13 - Prob. 12PCh. 13 - Prob. 13PCh. 13 - Prob. 14PCh. 13 - Prob. 15PCh. 13 - Prob. 16PCh. 13 - Prob. 17PCh. 13 - Prob. 18PCh. 13 - Prob. 19PCh. 13 - Prob. 20PCh. 13 - Prob. 21PCh. 13 - Prob. 22PCh. 13 - Prob. 23PCh. 13 - Prob. 24PCh. 13 - Prob. 1AMECh. 13 - Prob. 2AMECh. 13 - Prob. 3AMECh. 13 - Prob. 4AMECh. 13 - Prob. 1VCCh. 13 - Prob. 2VCCh. 13 - Prob. 3VC
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
- Given the following transportation matrix where the numbers in the cells represent cost of transporting 1unit from a specific source to a specific destination, determine the initial solution using the 3 methods anddetermine the optimum solution by using the initial solution with the lowest value of Z.arrow_forwardA coordinate system is superimposed on a map. Three existing facilities arelocated at (5, 15), (10, 20), and (6, 9). Compute both the rectilinear and theEuclidean distances separating each facility from a new facility located at (x, y) =(8, 8).arrow_forwardPharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows): Potential Rep Home City Served? Albuquerque El Paso Denver Phoenix San Diego Los Angeles San Francisco Portland Seattle Las Vegas Salt Lake City Albuquerque 1 1 1 1 0 0 0 0 0 0 0 El Paso 1 1 0 1 0 0 0 0 0 0 0 Denver 1 0 1 1 0 0 0 0 0 0 1 Phoenix 1 1 1 1 1 1 0 0 0 1 1 San Diego 0 0 0 1 1 1 1 0 0 1 0…arrow_forward
- PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows): Potential Rep Home City Served? Albuquerque El Paso Denver Phoenix San Diego Los Angeles San Francisco Portland Seattle Las Vegas Salt Lake City Albuquerque 1 1 1 1 0 0 0 0 0 0 0 El Paso 1 1 0 1 0 0 0 0 0 0 0 Denver 1 0 1 1 0 0 0 0 0 0 1 Phoenix 1 1 1 1 1 1 0 0 0 1 1 San Diego 0 0 0 1 1 1 1 0 0 1 0…arrow_forwardConsider 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_forwardAn 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_forward
- Determine whether the statement is true or false. In a transportation problem with total supply equal to total demand, if there are two origins and three destinations, and there is a unique optimal solution, the optimal solution will utilize 5 shipping routes. True or Falsearrow_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_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_forward
- In the original Gorman Construction Company problem, we found the shortest distance from the office (node 1) to the construction site located at node 6. Because some of the roads are highways and others are city streets, the shortest-distance routes between the office and the construction site may not necessarily provide the quickest or shortest-time route. Shown here is the Gorman road network with travel time rather than distance. Find the shortest route from Gorman’s office to the construction site at node 6 if the objective is to minimize travel time rather than distance.arrow_forwardFour cargo ships must be used to transport goods from one port to four other ports (numbered 1, 2, 3, and 4). Any boat can be used to make any of the four trips. However, given some differences between ships and cargoes, the total cost of loading, transporting, and unloading goods from different combinations of ships and ports varies considerably. These costs are shown in the following table: The goal is to assign ships to ports in a one-to-one correspondence so that the total cost of the four shipments is minimized. a) Describe how this problem can be adapted to the general format of assignment problems. b) Obtain an optimal solution using Excel Solver step by steparrow_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,