Using the grid technique to determine the least-cost location (warehouse) for this problem: Tons Rate X - Coordinates Y – Coordinates S1 200 0.5 2 14 S2 300 0.6 6 10 M1 100 1 2 2 M2 100 2 10 14 M3 100 1 14 18 M4 100 2 14 6 The Grid center coordination is ____ and _____ (round the results to 1 decimal place) Group of answer choices (9.9; 7.8) (5.5; 6.9) (8.7; 10.5) (10.5; 6.4) (9.9; 8.9)

Using the grid technique to determine the least-cost location (warehouse) for this problem: Tons Rate X - Coordinates Y – Coordinates S1 200 0.5 2 14 S2 300 0.6 6 10 M1 100 1 2 2 M2 100 2 10 14 M3 100 1 14 18 M4 100 2 14 6 The Grid center coordination is and _ (round the results to 1 decimal place) Group of answer choices (9.9; 7.8) (5.5; 6.9) (8.7; 10.5) (10.5; 6.4) (9.9; 8.9)

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.5: Set-covering And Location-assignment Models

Problem 29P

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:…
The High-Price Oil Company owns a pipeline network that is used to convey oil from its source to several storage locations. A portion of the network is as follows: Due to the varying pipe sizes, the flow capacities vary. By selectively opening and closing sections of the pipeline network, the firm can supply any of the storage locations. a. If the firm wants to fully utilize the system capacity to supply storage location 7, how long will it take to satisfy a location 7 demand of 100,000 gallons? What is the maximal flow for this pipeline system? b. If a break occurs on line 2–3 and that line is closed down, what is the maximal flow for the system? How long will it take to transmit 100,000 gallons to location 7?
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?
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.
The Acme Company operates four factories that ship products to five warehouses. The shipping costs, requirements capacities, and optimal allocations are shown below. Factory Shipping Cost per Case to Warehouses Capacity W1 W2 W3 W4 W5 F1 $1.50 $4.50 $6.00 $7.50 $9.00 40,000 30,000 10,000 F2 $3.00 $3.00 $1.50 $6.00 $7.50 30,000 25,000 5,000 F3 $1.50 $7.50 $1.50 $4.50 $1.50 30,000 10,000 20,000 F4 $7.50 $3.00 $6.00 $7.50 $6.00 25,000 25,000 Demand 30,000 35,000 25,000 15,000 20,000 125,000 What is the total cost of the optimal solution? Total cost = $nothing. (Enter your response to the nearest dollar.)
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…
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…
Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.
The figure below shows the nodes (A−I) and capacities (labelled on arcs in TB/s) of a computer network. The firm would like to know how much information can flow from node A to node I. Which nodes are the sink and source for this problem? Multiple Choice: Node A is the source, Node I is the sink. Node A is the sink, Node B is the source. Node A is the sink, Node I is the source. Node B is the sink, Node I is the source. Node B is the source, Node I is the sink.
TMA manufactures 37-in. high definition LCD televisions in two separate locations, Locations I and II. The output at Location I is at most 6000 televisions/month, whereas the output at Location II is at most 5000 televisions/month. TMA is the main supplier of televisions to the Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 3000 and 4000 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. To Pulsar Factories From TMA City A City B Location I $5 $3 Location II $6 $9 TMA will ship x televisions from Location I to city A and y televisions from Location I to city B. Find a shipping schedule that meets the requirements of both companies while keeping costs to a minimum. (x, y) =…
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?
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 units