Fred Block Company has orders for 90 tons of concrete blocks at three suburban locations as follows: Northwood -- 25 tons, Westwood -- 45 tons, and Eastwood -- 20 tons. Fred has two plants, each of which can produce 50 tons per week. Delivery cost per ton from each plant to each suburban location is shown as follows Delivery Cost Per Ton Northwood Westwood Eastwood Plant1 20 30 40 Plant 2 30 40 45 a. Develop a network representation of this distribution problem. b. Develop a linear program model that can be used to determine the plan that will minimize total distribution costs. c. Solve the problem to describe the distribution plan and show total distribution cost.(Submit Excel files).

Fred Block Company has orders for 90 tons of concrete blocks at three suburban locations as follows: Northwood -- 25 tons, Westwood -- 45 tons, and Eastwood -- 20 tons. Fred has two plants, each of which can produce 50 tons per week. Delivery cost per ton from each plant to each suburban location is shown as follows Delivery Cost Per Ton Northwood Westwood Eastwood Plant1 20 30 40 Plant 2 30 40 45 a. Develop a network representation of this distribution problem. b. Develop a linear program model that can be used to determine the plan that will minimize total distribution costs. c. Solve the problem to describe the distribution plan and show total distribution cost.(Submit Excel files).

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 34P

See similar textbooks

Similar questions

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…
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?
TRANSPORTATION METHOD: INSTRUCTIONS: Solve for the optimal distribution and cost of transportation using the given problem below. Show all solution. GIR Company received a contract to supply unleaded gasolne to four different locations Project A needs 60,000 iters, Project Bneeds 90,000 liters, Project Oneeds 20,000 liters, and Product D needs 30,000 liters. The company has two depot located in two different places, Depot 1 har 220.000 liters available and Depot 2 has 80,000 sters wal sole. Cost to Transport Project Project B Project C Proxecto 5 7 13 Depot 1 Depot 2 8 6 B B SIMPLEX METHOD: Instruction Detamine the optimal solution Mimiz 50XL -20 X2 Subject to X1 420 X1 X2 248
Oranges are grown, picked and then stored in warehouses in Tampa, Miami, and Fresno. Theses warehouses supply oranges to markets in New York, Philadelphia, Chicago, and Boston. The following table shows the shipping costs per truckload (in hundreds of dollars), supply, and Because of an agreement between distributors, shipments are prohibited from Miami to Chicago: Draw a network of this problem. Formulate a linear program for this problem.
Solve the following problem: The Krampf Lines railway company specializes in coal handling. On Saturday, Krampf had empty cars at the following towns in the quantities indicated: Town Supply of cars Morgantown 35 Youngstown 60 Pitsburg 25 By Monday, the following towns will need cars as follows: Town Demand for cars Coal Valley 30 Coal town 45 Coal junction 25 Coalsburg 20 The result is shown in the table below. To From Coal Valley Coal town Coal junction Coalsburg Morgantown 50 30 60 70 Youngstown 20 80 10 90 Pitsburg 100 40 80 30 Required: Minimize total miles over which cars are moved to new locations regarding the following: Formulate as a linear programming. Use North-West corner method to obtain the total shipment cost of coal cars.
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…
ASAP PLEASE.. The distribution of goods from the source (factory) to the target (warehouse) will cause problems regarding TRANSPORT, namely how the goods are sent from the factory to the warehouse which produces minimum costs. If it is known that - the capacity of 3 factories is 40000, 30000 and 20000, - the need for 3 warehouses is 20000, 50000 and 30000 respectively. The cost of shipping goods from the factory to the warehouse is shown in the following table Solve the above TRANSPORTATION problems with VAM and MODI
his transshipment problem concerns a fruit company who contracts with farms, plants, and distribution centers. They want to determine the optimal shipments from farms to plants to distribution centers to minimize total transportation costs. The Excel spreadsheet, including transportation costs per ton from the farms to the plants and from the plants to the distributors, and the supply at the farms and demand at the distribution centers, is pasted below:
Suisan Fish Company contracts with fishers in Hilo, Kona, and Puna, Big Island to purchase fishes. The fishes are cleaned and stored at the local processing facilities. Then the fishes are shipped to two plants, where they are cut, processed, and packaged as sushi and sashimi. The sushi and sashimi are then transported to three restaurants. The transportation costs per fish from the fishers to the plants and from the plants to the restaurants are summarized in the following tables: Determine the optimal shipments from fishers to plants and from plants to restaurants to minimize total transportation costs. Include the formulation and solver outputs. What would be the effect on the solutions if the capacity at each plant were 70 fishes?
The Midlands Field Produce Company contracts with potato farmers in Colorado, Minnesota, North Dakota, and Wisconsin for monthly potato shipments. Midlands picks up the potatoes at the farms and ships mostly by truck (and sometimes by rail) to its sorting and distribution centers in Ohio, Missouri, and Iowa. At these centers the potatoes are cleaned, rejects are discarded, and the potatoes are sorted according to size and quality. They are then shipped to combination plants and distribution centers in Virginia, Pennsylvania, Georgia, and Texas, where the company produces a variety of potato products and distributes bags of potatoes to stores. Exceptions are the Ohio distribution center, which will accept potatoes only from farms in Minnesota, North Dakota, and Wisconsin, and the Texas plant, which won’t accept shipments from Ohio because of disagreements over delivery schedules and quality issues. Following are summaries of the shipping costs from the farms to the distribution centers…
he Midvale Sand and Gravel Company desires to allocate its products (load) to their three projects from their three warehouses. The three warehouses, designated as A, B, and C have a capacity of 51, 23, and 38 respectively. The three projects, designated as D, E, and F have a demand of 46, 40 and 26 respectively. The shipping costs per load to its destination are as follows: From A to its projects are 4, 9 and 2 respectively; From B to its projects are 3, 5 and 8 respectively; and From C to its projects are 6, 2 and 5 respectively. 1. Show the Network presentation of the company. 2. Formulate the objective functions and constraints only using the Linear Programming Model. The objective is to minimize the total transportation costs. 3. Find the optimal solution using the NWC and stepping stone method.
Consider 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…