Concept explainers
(a)
Interpretation: For the situation described in Problem 28, the gravity solution needs to be determined.
Concept Introduction: In a gravity problem, the objective becomes appropriate when the cost for locating new facilities goes up, as the function of square of distances between the new facility to the existing facility.
(b)
Interpretation: For the situation described in Problem 28, by using the answer obtained in part (a) as an initial solution for the Euclidean distance problem, and if it is solved by hand then
Concept Introduction: In a Euclidean space, the distance between two points, in a straight line is called Euclidean distance.
Want to see the full answer?
Check out a sample textbook solutionChapter 11 Solutions
Production and Operations Analysis, Seventh Edition
- Find the optimal solution for the following problem. (Round your answers to 3 decimal places.) Maximize C = 13x + 3y subject to 12x + 14y ≤ 21 15x + 20y ≤ 37 and x ≥ 0, y ≥ 0. What is the optimal value of x?arrow_forwardFor the following linear programming problem, determine the optimal solution using the graphical solution method. Max −X + 2Y s.t. 6X − 2Y ≤ 3 −2X + 3Y ≤ 8 X + Y ≤ 3 X, Y ≥ 0 (X, Y) =arrow_forwardPLEASE 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…arrow_forward
- 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_forwardInstructions: Solve using Excel Solver. Create the linear programming model and get the optimal solution to the problem. (Follow the steps and format in the photo below) 1. A company manufactures two products X1 and X2 on three machines A, B, and C. X1 requires 1 hour on machine A and 1hour on machine B and yields a revenue of Php 30. Product X2 requires 2 hours on machine A and 1 hour on machine B and 1 hour on machine C and yields revenue of PhP 50. In the coming planning period the available time of three machines A, B, and C are 2000 hours, 1500 hours and 600 hours respectively. Find the optimal product mix.arrow_forwardThe Easy Time Grocery chain operates in major metropolitan areas on the East Coast. The stores have a “no-frills” approach, with low overhead and high volume. They generally buy their stock in volume at low prices. However, in some cases they actually buy stock at stores in other areas and ship it in. They can do this because of high prices in the cities they operate in compared with costs in other locations. One example is baby food. Easy Time purchases baby food at stores in Albany, Binghamton, Claremont, Dover, and Edison and then trucks it to six stores in and around New York City. The stores in the outlying areas know what Easy Time is up to, so they limit the number of cases of baby food Easy Time can purchase. The following table shows the profit Easy Time makes per case of baby food, based on where the chain purchases it and at which store it is sold, plus the available baby food per week at purchase locations and the shelf space available at each Easy Time store per week:…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_forwardfollow the simplex method to compute the optimal solution?arrow_forwardThe following table presents cost, capacity, and demand data for a transportation problem in Stephanie Robbin’s furniture company. Set up the appropriate transportation table and find the optimal solution using Excel's solver. From/To 1 2 3 Supply A 30 10 5 20 B 10 10 10 30 C 20 10 25 75 Demand 40 60 55 a. Is the problem balanced? [ Select ] ["Yes", "it is balanced", "No", "cannot determine"] , If not, where? [ Select ] ["Neither", "Supply", "Demand"] , and by how much? [ Select ] ["0", "40", "30", "25"] b. What is the optimal cost? $ [ Select ] ["2,500", "1,100", "1,275", "1,300"] c. Were you able to meet all demand requirement? [ Select ] ["no", "cannot determine based on the information given", "yes"] If not, which destination (s) was/were not met? [ Select ] ["none, all destinations were met based on supply and demand being equal", "destination 3 by 30 units", "destination 2 by 30 units", "destination 1 by 25 units…arrow_forward
- Consider the following transportation problem (cost in rupees). Find the initial solution by using Vogel’sApproximation method and perform optimality test using MODI Methodarrow_forwardFormulate 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_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
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,