LM.61 Boxmart needs to set up a new hub to distribute to a number of stores in four cities. The table below gives the map coordinates and number of weeklyshipments for each city.CityX CoordinateY CoordinateShipmentsA5.12.0185.20.540C1.05.4101.21.516What should be the center of gravity x-coordinate for the new hub? (Display your answer to two decimal places.)NumberWhat should be the center of gravity y-coordinate for the new hub? (Display your answer to two decimal places.)Number

Answered: Image /qna-images/answer/84254d0c-4146-4ab7-b1be-f9b968e41f86.jpg

Answered: LM.61 Boxmart needs to set up a new hub…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

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:…
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…
Modify 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…
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 ≥ 0
Dennison Manufacturing makes large helical springs used in aircraft landing gear. The company has narrowed its potential choices for its new manufacturing facility to four cities. The following information is known about the manufacturing and shipping costs of locating in each of these four cities: Fixed Costsper Year Variable ManufacturingCosts per Unit Variable ShippingCosts per Unit Phoenix Buffalo Seattle Atlanta $300,000 $600,000 $1,500,000 $1,750,000 $70.00 $56.00 $36.00 $42.00 $5.00 $4.00 $2.00 $5.00 a. Use break-even point analysis to determine where Dennison should locate.b. Based solely on break-even quantity, if Dennison’s manufacturing forecast for the foreseeable future is 40,000 units annually, where should he locate?
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.
The figure below shows the possible routes from city A to city J as well as the time (in minutes) required for a trip between each pair of cities (note that if no arc joins two cities it is not possible to travel non-stop between those two cities). A traveler wishes to find the quickest option to travel from city A to city J. What is the shortest time possible to travel from node F to node J. Multiple Choice: 200 140 110 180 160
Transportation Problems: The EBKK company has three plants producing child push chairs that are to be shipped to four distribution centers. Plans 1, 2, and 3 produce 12, 17, and 11 shipments per month, respectively. Each distribution center needs to receive 10 shipments per month. The distance from each plant to the respective distribution center is given below: DISTRIBUTION CENTER Plant 1 2 3 4 1 800 1300 400 700 2 1100 1400 600 800 3 600 1200 800 900 a. Draw a complete network representation of the problem b. Is the initial solution optimal? c. Find the optimal solution using the MODI Method d. The freight cost for each shipment is $100 plus 50 cents per mile. How much should be shipped from each plant to each of the distribution centers to minimize the total shipping cost?
A 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…
Given the following existing facilities data: Existing facility #1 has weight 2 and coordinate (9, 10). Existing facility #2 has weight 10 and coordinate (6, 8). Existing facility #3 has weight 8 and coordinate (-3, -3). Existing facility #4 has weight 9 and coordinate (5, 2). Existing facility #5 has weight 3 and coordinate (-7, -1). Existing facility #6 has weight 7 and coordinate (-2, -6). Existing facility #7 has weight 4 and coordinate (-5, 0). Existing facility #8 has weight 3 and coordinate (4, -7). What is the optimal minisum rectilinear x-coordinate? What is the optimal minisum rectilinear y-coordinate? What is the optimal minisum rectilinear objective function value? Need all
Instructions: 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.
General Ford produces cars at L.A. and Detroit and hasa warehouse in Atlanta; the company supplies cars tocustomers in Houston and Tampa. The cost of shipping a carbetween points is given in Table 60 (“—” means that ashipment is not allowed). L.A. can produce as many as1,100 cars, and Detroit can produce as many as 2,900 cars.Houston must receive 2,400 cars, and Tampa must receive1,500 cars.a Formulate a balanced transportation problem thatcan be used to minimize the shipping costs incurred inmeeting demands at Houston and Tampa.b Modify the answer to part (a) if shipments betweenL.A. and Detroit are not allowed.c Modify the answer to part (a) if shipments betweenHouston and Tampa are allowed at a cost of $5.

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

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

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

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

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

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.

SEE MORE TEXTBOOKS