7. The Atlantic Coast Conference (ACC) has four basketball games on a particular night. The conference office wants to assign four teams of officials to the four games in a way that will minimize the total distance traveled by the officials. The supply is always one team of officials, and the demand is for only one team of officials at each game. The distances in miles for each team of officials to each game location are shown in the following table: Game Sites Officials Raleigh Atlanta Durham Clemson A 210 90 180 160 B 100 70 130 200 C 175 105 140 170 D 80 65 105 120

7. The Atlantic Coast Conference (ACC) has four basketball games on a particular night. The conference office wants to assign four teams of officials to the four games in a way that will minimize the total distance traveled by the officials. The supply is always one team of officials, and the demand is for only one team of officials at each game. The distances in miles for each team of officials to each game location are shown in the following table: Game Sites Officials Raleigh Atlanta Durham Clemson A 210 90 180 160 B 100 70 130 200 C 175 105 140 170 D 80 65 105 120

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section: Chapter Questions

Problem 100P

See similar textbooks

Similar questions

Required information The Childfair 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, respec- tively. Each distribution center heeds to receive 10 shipments per month. The distance from each plant to the respective distributing centers is given below: Distance Plant 1 2 3 1 1450 1750 1250 Distribution Center 3 1050 1250 1450 Obtain an optimal solution, and determine the total cost. Total Cost = $ 2 1950 2050 1850 The freight cost for each shipment is $100 plus 50 cents per mile. 4 1350 1650 1550
A contractor has one crane available at four different building sites at which work has just been completed. The contractor wants to move the four cranes to four new sites. The transportation time (in hours) between the old and the new sites is presented in the table below. New Sites Old Sites I II III IV A 3.50 4.00 8.50 5.00 B 4.25 5.50 9.25 5.50 C 6 5.50 7.50 6.50 D 4.00 7.00 7.50 3.75 a) Develop a mathematical model that can be used to find the optimal way to move the cranes between old and new sites optimally. b) Solve the problem using Microsoft Excel (Please, submit your Excel file along with your answer)
2. Frieda Millstone and her family live in Roanoke, Virginia, and they are planning an auto vacation across Virginia, their ultimate destination being Washington, DC. The family has developed the following network of possible routes and cities to visit on their trip: The time, in hours, between cities (which is affected by the type of road and the number of intermediate towns) is shown along each branch. Determine the shortest Weebingten Stayate Charletteaui route that the Millstone family can travel from Roanoke to Washington, DC.
4. The origins at 2 plants at Cagayan de Oro and Davao with capacities of 500 and 700 units, while the destinations are 3 distribution centers with demands of 400, 500 and 300 respectively. The costs of transporting a unit of the product from origins to destinations are shown below: ORIGIN DISTRIBUTION CENTERS DC1 DC2 DC3 Cagayan de Oro 6 4 Davao 6. 3 REQUIRED: Draw the network model and create the linear programming of this transportation problem.
City Cab Company identified 10 primary pickup and drop locations for cab riders in New York City. In an effort to minimize travel time and improve customer service and the utilization of the company's fleet of cabs, management would like the cab drivers to take the quickest route between locations whenever possible. The travel times in minutes are shown on the arcs of the network. Note that there are two one-way streets and that the direction is shown by the arrows. 1 I 13 10 15 10 2 5 3 2 4 4 5 15 3 5 6 12 2 7 5 8 4 7 9 Using the above network of roads and streets, what is the quickest route a driver beginning at location 1 should take to reach location 10? path = 1, 10
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
. You are managing a badminton tournament and need a game official for each of the four games. All the games occur at the same time in four different departments. The departments are Education, Accountancy, Nursing and IT. The four game officials live in different parts of Abra and will need to travel to the games and submit a travel expense according to the table below. The assignment is one official to one game location. Formulate this assignment question as an LP question to minimize cost to send the officials to their games. Game Locations Official Education Accountancy Nursing IT 1 60 155 190 215 2 75 200 120 105 3 110 180 130 165 4 55 122 110 70
By Monday April 16th the following towns will need the numbers of coal cars listed: coal valley 30 Coaltown 45 Coal Junction 25 Coalsburg 20 Using a railway city to city distance chart, the dispatcher constructs a mileage table on this page. Minimizing total miles over which cars are moved to new locations, compute the best shipment of coal cars.
Consider the following network representation of a transportation problem. Let Min 40 s.t. 35 Supplies From Jefferson City From Omaha To Des Moines Jefferson City To Kansas City Omaha To St. Louis 14 9 8 X11 = amount shipped from Jefferson City to Des Moines X12 = amount shipped from Jefferson City to Kansas City X13 = amount shipped from Jefferson City to St. Louis X21 amount shipped from Omaha to Des Moines X22 = amount shipped from Omaha to Kansas City X23 = amount shipped from Omaha to St. Louis 8 11 24 The supplies, demands, and transportation costs per unit are shown on the network. (a) Develop a linear programming model for this problem; be sure to define the variables in your model. Des Moines Kansas City St. Louis 25 10 40 Demands
A&B Transport Co. is a company that manages a food supply chain. The problem involves the delivery of cargo (canned peas) from four canneries (loading ports) to three destination ports, using tankers. Since the shipping costs are a major expense for the company, management is initiating a study to reduce them as much as possible. For the upcoming season, has come up with an estimation of the available output from each cannery. Furthermore, each destination port has also specific requirements for the total supply of peas that have to be satisfied. This information (in units of tanker loads), along with the shipping cost per tanker load for each loading - destination port combination, is given in Tables 1 and 2. The problem for the A&B Transport Co. is to determine the shipping strategy given the various loading - destination port combinations, so that the total shipping costs are minimised. Question 1 . A&B Transport Co is thinking of including in its strategy the shipment…
Draw the schedual network diagramand duration while calculating the following: Forward pass, backward pass, float and stake.
Describe in your own words assumptions of Maximal Flow Problem by indicating any differences with the assumptions of Transshipment Problem.