2.The GOODBABY Company has three plants producing child push chairs that are to be shipped to four distribution centers. Plants 1,2 and 3 produce 20, 22 and 18 shipments per month, respectively. Each distribution center needs to re ceive 15 shipments per month. The distance from each plant to the respective distributing centers is given in the following table. The shipping cost for each shipment is $10 per mile. The question is: How mu ch should be shipped from each plant to each of the distribution centers to mi nimize the total shipping cost? Please construct the proper parameter table an d formulate this problem as a transportation problem model. Distance Distribution center 1 2 3 4 Plant 1 60 miles 130 miles 30 miles 75 miles Plant 2 90 miles 130 miles 60 miles 120 miles Plant 3 50 miles 90 miles 100 miles 120 miles

2.The GOODBABY Company has three plants producing child push chairs that are to be shipped to four distribution centers. Plants 1,2 and 3 produce 20, 22 and 18 shipments per month, respectively. Each distribution center needs to re ceive 15 shipments per month. The distance from each plant to the respective distributing centers is given in the following table. The shipping cost for each shipment is $10 per mile. The question is: How mu ch should be shipped from each plant to each of the distribution centers to mi nimize the total shipping cost? Please construct the proper parameter table an d formulate this problem as a transportation problem model. Distance Distribution center 1 2 3 4 Plant 1 60 miles 130 miles 30 miles 75 miles Plant 2 90 miles 130 miles 60 miles 120 miles Plant 3 50 miles 90 miles 100 miles 120 miles

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 Child-fair Company has three plants producing child push chairs that are to be shipped to four distribution centers. Plants 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 centers is given below. How much should be shipped from each plant to each of the distribution centers to minimize the total shipping cost, where the freight cost for each shipment is $100 plus 50 cents/mile? Formulate this case as a transportation problem (a) algebraically, and (b) on a spreadsheet, then (c) use Solver to obtain the optimal solutions
A Company has 3 production facilities S1, S2 and S3 with production capacity of 7, 9 and 18 units (in 100's) per week of a product, respectively. These units are tobe shipped to 4 warehouses D1, D2, D3 and D4 with requirement of 5,6,7 and 14 units (in 100's) per week, respectively. The transportation costs (in rupees) per unit between factories to warehouses are given in the table below. D1 D2 D3 D4 Capacity S1 19 30 50 10 7 S2 70 30 40 60 9 S3 40 8 70 20 18 Demand 5 8 7 14 34 Find initial basic feasible solution for given problem by usingcolumn minima methodif the object is to minimize the total transportation cost.
Suppose Jack like to solve the following formulation in Excel. And the problem is setup in Excel like this: See attached picture. A B C D E 1 X1 X2 2 decision variable objective 3 coefficient of objective function 2 3 4 Constraints LHS RHS 5 Constraints 1 2 1 3 6 Constraints 2 4 5 20 7 Constraints 3 2 8 16 8 Constraints 4 5 6 60 We want to put our objective function in cell D3. What should we type in D3? In cell D5 to D8, we will put the left hand side of our constraint. What should we type in D8? In OpenSolver, what should we assign to Variable Cell? What should you do to input the non-negativity constraint in OpenSolver?
A company has three manufacturing plants (in Atlanta,Tulsa, and Springfi eld) that produce a product that is then shipped to one of four distribution centers. Th e three plants can produce13, 18, and 12 truckloads of product each week, respectively. Eachdistribution center needs 10 truckloads of product each week. Th eshipping costs per truckload between the plants and distributioncenters are given in the table. Th e company needs to determinehow much to ship from each plant to each distribution center andwould like to minimize total shipping costs (a) Formulate an LP to minimize the total shipping costs.(b) Set up and solve the problem on a spreadsheet.(c) What is the optimal solution? Explain the rationale for thesolution
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 firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. The firm’s problem falls within which classification? Multiple Choice Cost-benefit-trade-off Assignment problems Transshipment problems Transportation problems Resource-allocation
A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. Which of the following constraints is unnecessary for this problem (xi,j is the number of widgets shipped from factory i to customer j)? A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced…
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…
The Vanguard Publishing Company wants to hire seven of the eight college students who have applied as salespeople to sell encyclopedias during the summer. The company desires to allocate them to three sales territories. Territory 1 requires three salespeople, and territories 2 and 3 require two salespeople each. It is estimated that each salesperson will be able to generate the amounts of dollar sales per day in each of the three territories as given in the following table: Help the company allocate the salespeople to the three territories so that sales will be maximized.
The Heartland Distribution Company is a food warehouse and distributor that has a contractwith a grocery store chain in several Midwest and Southeast cities. The company wants toconstruct new warehouses/distribution centers in some of the cities it services to serve thestores in those cities plus all the other stores in the other cities that don’t have distributioncenters. A distribution center can effectively service all stores within a 300-mile radius. Thecompany also wants to limit its fixed annual costs to under $1,200,000. The company wants tobuild the minimum number of distribution centers possible. The following table shows thecities within 300 miles of every city and the projected fixed annual charge for a distributioncenter in each city.City Annual fixed charge ($1ks) Cities within 300 miles1. Atlanta 270 1, 2, 72. Charlotte 250…
2. Optimal solutionA company wants to hire 4 vendors for the sale of 4 products, they could only sell one type of product. The following table (image) indicates what each seller charges for selling each of the products. The company wants to assign each seller a product, find all possible optimal assignments by pinpointing their optimal cost. Indicate which is the optimal solution and the optimal value: a) Seller 1 is assigned product 2, seller 2 is assigned product 4, seller 3 is assigned product 3, and seller 4 is assigned product 1. For an optimal cost of 15 b) Seller 2 is assigned product 1, Seller 4 is assigned product 2, Seller 3 is assigned product 3, and Seller 1 is assigned product 4. For an optimal cost of 15 c) Seller 1 is assigned product 2, seller 2 is assigned product 4, seller 3 is assigned product 3, and seller 4 is assigned product 1. For an optimal cost of 14 d) None of the above
Transeast Airlines flies planes on the following route:L.A.–Houston–N.Y.–Miami–L.A. The length (in miles) ofeach segment of this trip is as follows: L.A.–Houston, 1,500miles; Houston–N.Y., 1,700 miles; N.Y.–Miami, 1,300miles; Miami–L.A., 2,700 miles. At each stop, the planemay purchase up to 10,000 gallons of fuel. The price of fuelat each city is as follows: L.A., 88¢; Houston, 15¢; N.Y.,$1.05; Miami, 95¢. The plane’s fuel tank can hold at most12,000 gallons. To allow for the possibility of circling overa landing site, we require that the ending fuel level for eachleg of the flight be at least 600 gallons. The number ofgallons used per mile on each leg of the flight is1 (average fuel level on leg of flight/2,000)Review Problems 123To simplify matters, assume that the average fuel level onany leg of the flight isFormulate an LP that can be used to minimize the fuel costincurred in completing the schedule