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 26P
(a)
Summary Introduction
Interpretation: Optimal location is to be determined when the objective is to minimize the total rectilinear distance to the three existing facilities.
Concept Introduction:
Rectilinear distance refers to sum of distance between two facilities. Rectilinear distance can be defined by the following formula.
(b)
Summary Introduction
Interpretation: Optimal location is to be determined when the objective is to minimize the total Euclidean distance to the three existing facilities.
Concept Introduction:
Euclidean distance is nothing but the simple measurement of straight line lies between two facilities.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents 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.
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.)
Grave City is considering the relocation of several police substations to obtain better enforcement inhigh-crime areas. The locations under consideration together with the areas that can be covered fromthese locations are given in the following table:
a) Formulate an integer programming model that could be used to find the minimum number oflocations necessary to provide coverage to all areas.b) Solve the problem in part (a).
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 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_forwardGrave City is considering the relocation of several police substations to obtain better enforcement in high-crime areas. The locations under consideration together with the areas that can be covered from these locations are given in the following table: Locations Areas A 1,4,7 B 1,3,5,7 C 1,2,5 D 2,5,6 E 3,4,7 F 4,6 Areas 2 and 6 must be covered by at least 2 locations. The rest of the areas must be covered by at least 1 location. What is the minimum number of locations?arrow_forwardA firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 30x1 + 30x2 + 25x3+ 20x4s.t. 5x1 + 10x2 + 8x3 + 12x4 ≤ 22 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = {1, if location j is selected0, otherwise xj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected? What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)arrow_forward
- A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 35x1 + 25x2 + 15x3+ 30x4s.t. 7x1 + 8x2 + 7x3 + 13x4 ≤ 18 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = {1, if location j is selected0, otherwisexj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions:arrow_forwardA firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 15x1 + 25x2 + 15x3+ 35x4s.t. 8x1 + 11x2 + 6x3 + 6x4 ≤ 17 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = {1, if location j is selected0, otherwisexj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected? What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.)arrow_forwardA firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 15x1 + 25x2 + 15x3+ 35x4s.t. 8x1 + 11x2 + 6x3 + 6x4 ≤ 17 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = 0, 1 Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected? Location 1 will Answer Location 2 will Answer Location 3 will Answer Location 4 will Answer What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) Net present value Answer How much of the available capital will be spent (Hint: Constraint 1 enforces the available capital limit)? (Round your answer to the nearest whole number.) Available capital Answerarrow_forward
- A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm’s goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 15x1 + 15x2 + 15x3+ 30x4s.t. 7x1 + 13x2 + 11x3 + 10x4 ≤ 20 {Constraint 1}x1 + x2 + x3 + x4 ≥ 2 {Constraint 2}x1 + x2 ≤ 1 {Constraint 3}x1 + x3 ≥ 1 {Constraint 4}x2 = x4 {Constraint 5} xj = 1, if location j is selected0, otherwise Solve this problem to optimality and answer the following questions: Which of the warehouse locations will/will not be selected?arrow_forwardA salesman for Healthproof Pharmaceutical Company travels each week from his office in Atlanta to one of five cities in the Southeast where he has clients. The travel time (in hours) between cities along interstate highways is shown along each branch in the following network: A. Determine the shortest route from Atlanta to each of the other five cities in the network. B. Assume that the network now represents six different communities in a city and that the local transportation authority wants to design a rail system that will connect all six communities with the minimum amount of track. The miles between each community are shown on each branch. Develop a minimal spanning tree for this problem.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_forward
- Solve the linear programming problem. (If there is no solution, enter NO SOLUTION.) Minimize z = x + y Subject to 4x + y ≥ 50 x + 4y ≥ 50 x ≤ 23 y ≤ 23 Minimum value is z = at(x, y) = ( , )arrow_forwardConsider a supply chain network with three potential sites for warehouses and eight retailer regions. The fixed costs of locating warehouses at the three sites are given as follows: Site 1: $100,000 Site 2: $80,000 Site 3: $110,000 The capacities of the three sites are 100,000, 80,000, and 125,000 respectively. The retailer demands are 20,000 for the first four retailers and 25,000 for the remaining. The unit transportation costs ($) are given in Table below: a. Formulate a mixed integer linear program to determine the optimal location and distribution plan that will minimize the total cost. You must define your variables clearly, write out the constraints, explaining briefly the significance of each and write the objective function. Assume that the retailers can receive supply from multiple sites. Solve using any optimization software. Write down the optimal solution. b. Reformulate the optimization problem as a linear integer program, assuming dedicated warehouses, that is, each…arrow_forwardfollow the simplex method to compute the optimal solution?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.