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 30P
Summary Introduction
Interpretation: The location at which Mr. AB should park in order to reduce the total distance traveled to the customers is to be determined.
Concept Introduction:
Facility location refers to the process of finding the best suitable location to operate the organization’s operations.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
A company needs to locate three departments (I, II, and III) in the three areas (A, B, and C) of a new facility. They want to minimize interdepartmental transportation costs, which are expected to be $.40 per load per meter moved. An analyst has prepared the following distances and flow matrices:
Distance (meters) Flows (loads per week)
From/To A B C From/To I II III
A - 30 40 I - 30 110
B - 60 II 90 - 70
C - III 70 60 -
In what areas, A, B, and C, should departments I, II, and III be located that minimize the total cost of moving loads over…
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:…
A company needs to locate three departments (X, Y, and Z) in the three areas (I, II, and III) of a new facility. They want to minimize interdepartmental transportation costs, which are expected to be $.50 per load meter moved. An analyst has prepared the following flow and distance matrices:
Distances (meters) Flows (Loads per week)
From/To I II III From/To X Y Z
I - 10 20 X - 0 80
II - - 10 Y 30 - 150
III - Z 100 130 -If the company were to locate departments X, Y, and Z in areas 1, 2, and 3, respectively, what would be the total distance (in meters) loads would be moved each week?A. 3,100B. 3,600C. 6,200D. 7,200E. 8,200
Work must…
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
- The Sav-Us Rental Car Agency has six lots in Nashville, and it wants to have a certain number of cars available at each lot at the beginning of each day for local rental. The agency would like a model it could quickly solve at the end of each day that would tell it how to redistribute the cars among the six lots in the minimum total time. The times required to travel between the six lots are as follows: To (min.) From 1 2 3 4 5 6 1 12 17 18 10 20 2 14 10 19 16 15 3 14 10 12 8 9 4 8 16 14 12 15 5 11 21 16 18 10 6 24 12 9 17 15 The agency would like the following number of cars at each lot at the end of the day. Also, shown is the number of available cars at each lot at the end of a particular day. Determine the optimal reallocation of rental cars. Lot (cars) Cars 1 2 3 4 5 6 Available 37 20 14 26 40 28…arrow_forwardThe Green Cab Company has a taxi waiting at each of four cabstands in Evanston, Illinois. Four customers have calledand requested service. The distances, in miles, from the waiting taxis to the customers a re given in the following table. Find the optimal assignment of taxis to customers so as to minimize total driving distances to the customers.arrow_forwardA beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below. A graph with 7 nodes and 9 arcs is shown. Node 1 is connected to node 2 by arc of value 3, to node 5 by arc of value 3, and to node 6 by arc of value 11. Node 2 is connected to node 3 by arc of value 4. Node 3 is connected to node 2 by arc of value 4 and to node 4 by arc of value 7. Node 4 is connected to node 3 by arc of value 7, to node 6 by arc of value 5, and to node 7 by arc of value 6. Node 5 is connected to node 6 by arc of value 7. Node 6 is connected to node 4 by arc of value 5, to node 5 by arc of value 7, and to node 7 by arc of value 3. Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let xij represent the flow from node i to node j.) Min s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows Node 7…arrow_forward
- Formulate a system of equations for the situation below and solve.Cantwell Associates, a real estate developer, is planning to build a new apartment complex consisting of one-bedroom units and two- and three-bedroom townhouses. A total of 204 units is planned, and the number of family units (two- and three-bedroom townhouses) will equal the number of one-bedroom units. If the number of one-bedroom units will be 3 times the number of three-bedroom units, find how many units of each type will be in the complex. one-bedroom units units two-bedroom townhouses units three-bedroom townhouses unitsarrow_forwardThe Bayside Art Gallery is considering installing a video camera security system to reduce its insurance premiums. A diagram of the eight display rooms that Bayside uses for exhibitions is shown in the figure below; the openings between the rooms are numbered 1-13. A security firm proposed that two-way cameras be installed at some room openings. Each camera has the ability to monitor the two rooms between which the camera is located. For example, if a camera were located at opening number 4, rooms 1 and 4 would be covered; if a camera were located at opening 11, rooms 7 and 8 would be covered; and so on. Management decided not to locate a camera system at the entrance to the display rooms. The objective is to provide security coverage for all eight rooms using the minimum number of two-way cameras.arrow_forwardBaseball umpiring crews are currently in four cities where three-game series are beginning. When these are finished, the crews are needed to work games in four different cities. The distances (miles) from each of the cities where the crews are currently working to the cities where the new games will begin are shown in the following table. The X indicates that the crew in Oakland cannot be sent to Toronto. Formulate as a linear programming problem to minimize the miles traveled. HINT: Since one assignment cannot be made, what are the options for that variable in the formulation? Solve using Excel solver. Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.arrow_forward
- Al, Barbara, Carol, and Dave have joined together to purchase two season tickets to the Giants’ home football games. Because there are eight home games, each person will get tickets to two games. Each person has ranked the games they prefer from 1 to 8, with 1 being most preferred and 8 least preferred, as follows: Determine the two games each person should get tickets for that will result in the groups’ greatest degree of satisfaction. Do you think the participants will think your allocation is fair?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_forwardhe Midvale Sand and Gravel Company desires to allocate its products (load) to their three projects from their three warehouses. The three warehouses, designated as A, B, and C have a capacity of 51, 23, and 38 respectively. The three projects, designated as D, E, and F have a demand of 46, 40 and 26 respectively. The shipping costs per load to its destination are as follows: From A to its projects are 4, 9 and 2 respectively; From B to its projects are 3, 5 and 8 respectively; and From C to its projects are 6, 2 and 5 respectively. 1. Show the Network presentation of the company. 2. Formulate the objective functions and constraints only using the Linear Programming Model. The objective is to minimize the total transportation costs. 3. Find the optimal solution using the NWC and stepping stone method.arrow_forward
- Oranges are grown, picked and then stored in warehouses in Tampa, Miami, and Fresno. Theses warehouses supply oranges to markets in New York, Philadelphia, Chicago, and Boston. The following table shows the shipping costs per truckload (in hundreds of dollars), supply, and demand. Because of an agreement between distributors, shipments are prohibited from Miami to Chicago Formulate this problem as a Linear Programming Define decision variables. Define objective function. Define the constraints.arrow_forwardA dispatcher for Citywide Taxi Company has six taxicabs at different locations and five customers who have called for service. The mileage from each taxi’s present location to each customer is shown in the following table: Determine the optimal assignment(s) that will minimize the total mileage traveled.arrow_forwardDavid Joseph is a supermarket chain manager based in Milwaukee, Wisconsin. He wants to establish business relations with China because China is part of the fastest-growing economies in the world. Through one of his Chinese employees, Wang Xin, David reached an agreement to import green tea from a farm animal products import and export company in Zhejiang Province, China. The goods should be in time to reach the sales peak of Thanksgiving. David himself is also a tea lover, and he is very struck by the quality of this tea, and the packaging is better than he expected. He is looking forward to tea selling in his supermarket and even tirelessly lets Wang Xin write some bilingual advertisements for tea in local mainstream newspapers or broadcast on the radio. Because of the small volume of transactions, the freight for each transaction is relatively high. To make a profit, David's accounting department suggested that the price of Chinese green tea could be set at a slightly higher price…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,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.