This action might not be possible to undo. Are you sure you want to continue?

This document contains practice questions that supplement homework questions and review questions for Lessons II-1 and II-2. This document first identifies the learning objectives of solving supplemental questions. The document then lists 36 questions. Four of those questions (questions 7, 11, 15, and 19) are like the questions in Homework 6. Finally, the document answers all questions except the homework questions. All questions can be helpful except questions 29 to 36. Questions marked with an asterisk * are similar to review questions. Tip: Supplemental questions are grouped into sets of similar type. Once you have mastered the questions in a set, you can skip the rest of the questions in that set.

1

Quantitative Analysis BA 452 Supplemental Questions 6

Objectives

By working through the homework questions and the supplemental questions, you will: 1. Be able to identify the special features of the transportation problem. Become familiar with the types of problems that can be solved by applying a transportation model. Be able to develop network and linear programming models of the transportation problem. Know how to handle the cases of (1) unequal supply and demand, (2) unacceptable routes, and (3) maximization objective for a transportation problem. Be able to identify the special features of the assignment problem. Become familiar with the types of problems that can be solved by applying an assignment model. Be able to develop network and linear programming models of the assignment problem. Be familiar with the special features of the transshipment problem. Become familiar with the types of problems that can be solved by applying a transshipment model. Be able to develop network and linear programming models of the transshipment problem. Know the basic characteristics of the shortest route problem. Be able to develop a linear programming model and solve the shortest route problem.

2

2.

3.

4.

5.

6.

7.

8.

9.

10

11. 12.

**Quantitative Analysis BA 452 Supplemental Questions 6
**

13. 14. Know the basic characteristics of the maximal flow problem. Be able to develop a linear programming model and solve the maximal flow problem. Know how to structure and solve a production and inventory problem as a transshipment problem. Understand the following terms: network flow problem transportation problem origin destination transshipment problem shortest route source node sink node assignment problem

15.

16.

3

Quantitative Analysis BA 452 Supplemental Questions 6

Supplemental Questions 6

1. A company imports goods at two ports: Philadelphia and New Orleans. Shipments of one product are made to customers in Atlanta, Dallas, Columbus, and Boston. For the next planning period, the supplies at each port, customer demands, and shipping costs per case from each port to each customer are as follows: Customers Port Atlanta Dallas Columbus Boston Port Supply Philadelphia 2 6 6 2 5000 New Orleans 1 2 5 7 3000 Demand 1400 3200 2000 1400 Develop a network representation of the distribution system (transportation problem). 2. Consider the following network representation of a transportation problem:

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. b. Solve the linear program to determine the optimal solution.

4

**Quantitative Analysis BA 452 Supplemental Questions 6
**

3. Tri-County Utilities, Inc., supplies natural gas to customers in a three-county area. The company purchases natural gas from two companies: Southern Gas and Northwest Gas. Demand forecasts for the coming winter season are Hamilton County, 400 units; Butler County, 200 units; and Clermont County, 300 units. Contracts to provide the following quantities have been written: Southern Gas, 500 units; and Northwest Gas, 400 units. Distribution cost for the counties vary, depending upon the location of the suppliers. The distribution costs per unit (in thousands of dollars) are as follows: To From Hamilton Butler Clermont Southern Gas 10 20 15 Northwest Gas 12 15 18 a. Develop a network representation of this problem. b. Develop a linear programming model that can be used to determine the plan that will minimize the total distribution costs. c. Describe the distribution plan and show the total distribution cost. d. Recent residential and industrial growth in Butler County has the potential for increasing demand by as much as 100 units. Which supplier should Tri-County contract with to supply the additional capacity? 4. Arnoff Enterprises manufactures the central processing unit (CPU) for a line of personal computers. The CPUs are manufactured in Seattle, Columbus, and New York and shipped to warehouses in Pittsburgh, Mobile, Denver, Los Angeles, and Washington, D.C., for further distribution. The following table shows the number of CPUs available at each plant, the number of CPUs required by each warehouse, and the shipping costs (dollars per unit): Warehouse Denver 5 8 7 4000

Plant Seattle Columbus New York CPUs Required

Pittsburgh 10 2 1 3000

Mobile 20 10 20 5000

Los Angeles 9 30 10 6000

Washington 10 6 4 3000

CPUs Available 9000 4000 8000 21,000

a. Develop a network representation of this problem. b. Determine the amount that should be shipped from each plant to each warehouse to minimize the total shipping cost. c. The Pittsburgh warehouse just increased its order by 1000 units, and Arnoff authorized the Columbus plant to increase its production by 1000 units. Will this production increase lead to an increase or decrease in total shipping costs? Solve for the new optimal solution.

5

Develop a network representation of the problem. production costs. including project type and the consultant’s experience. However. with the optimal solution providing the hours each consultant should be scheduled for each client to maximize the consulting firm’s billings. has some administrative assignments already planned and is available for clients up to a maximum of 140 hours over the next four weeks. New information shows that Avery doesn’t have the experience to be scheduled for client B. Inc. The company has four clients with projects in process. 6 . can be scheduled to work for clients up to a maximum of 160 hours each over the next four weeks. different prices can be charged because of the various industry pricing structures. Formulate the problem as a linear program. slightly different production costs at the two plants and varying transportation cost between the plants and customers make a “sell to the highest bidder” strategy unacceptable. Because the four customers are in different industries.Quantitative Analysis BA 452 Supplemental Questions 6 5. After considering price. Klein’s management faces the problem of deciding how many units it should supply to each customer. what impact does it have on total billings? What is the revised schedule? 6. The rates (dollars per hour) for each consultantclient combination are as follows: Client Consultant A B C D Avery 100 125 115 100 Baker 120 135 115 120 Campbell 155 150 140 130 a. Klein Chemicals. What is the schedule and what is the total billing? c. Klein established the following profit per unit for each plant-customer alternative: Customer Plant D-1 D-2 D-3 Clifton Springs $32 $34 $32 Danville $34 $30 $28 The plant capacities and customer orders are as follows: Plant Capacity (units) Distributor Orders (units) Clifton Springs 5000 D1: 2000 D2: 5000 Danville 3000 D3: 3000 D4: 2000 D-4 $40 $38 How many units should each plant produce for each customer in order to maximize profits? Which customer demands will not be met? Show your network model and linear programming formulation. A third consultant. b. Campbell. If this consulting assignment is not permitted. and transportation costs. Four of Klein’s customers have already placed orders that together exceed the combined capacity of Klein’s two plants. Premier Consulting’s two consultants. Avery and Baker. The estimated hourly requirements for each of the clients over the four-week period are Client Hours A 180 B 75 C 100 D 85 Hourly rates vary for the consultant-client combination and are based on several factors.. produces a special oil-based material that is currently in short supply.

20 Use the transportation model to develop the minimum cost production schedule for the products and machines. Show the linear programming formulation. Plans call for the following number (in thousands) of refrigerators to be produced at each location: Boston 50 Dallas 70 Los Angeles 60 St. The following table gives the accounting department estimates of the profit per unit (shipments will be made in lots of 1000 units): Shipped To Produced At Boston Dallas Los Angeles St. due to varying defect percentages of each product on each machine. Paul. Forbelt Corporation has a one-year contract to supply motors for all refrigerators produced by the Ice Age Corporation. Paul Denver 7 11 8 13 Atlanta 20 17 12 10 Chicago 8 18 13 16 With profit maximization as a criterion. and the unit costs.00 $1. 8.30 $1.90 3 1000 3 $1. All three machines can produce all the products at the same production rate. Ice Age manufactures the refrigerators at four locations around the country: Boston. However. The Ace Manufacturing Company has orders for three similar products: Product Orders (units) A 2000 B 500 C 1200 Three machines are available for the manufacturing operations. 7 . Dallas. Paul 80 Forbelt’s three plants are capable of producing the motors.20 $1.20 $0. Machine capacities for the next week. Develop a network representation of this problem. The plants and production capacities (in thousands) are Denver 100 Atlanta 100 Chicago 150 Because of varying production and transportation costs. and St. b. the profit that Forbelt earns on each lot of 1000 units depends on which plant produced the lot and which destination it was shipped to. Los Angeles. Forbelt’s management wants to determine how many motors should be produced at each plant and how many motors should be shipped from each plant to each destination. are as follows: Machine Capacity (units) Machine Product 1 1500 1 A B C 2 1500 2 $1.00 $1.10 $1. a. Find the optimal solution. the unit costs of the products vary depending on the machine used.Quantitative Analysis BA 452 Supplemental Questions 6 7.40 $1.

Currently.6:00 P.M. Project leaders will be assigned to the three clients. Brad would like to determine an assignment that will minimize total installation costs. b. The following table shows the costs (in hundreds of dollars) for each crew to complete each of the five jobs: Job 1 2 3 4 5 Red 30 44 38 47 31 Crew White 25 32 45 44 25 Blue 23 40 37 39 29 Green 26 38 37 45 28 Brown 26 34 44 43 28 a. A local television station plans to drop four Friday evening programs at the end of the season. 5:00-5:30 P. which aids in tracking of job progress on a large white board. Each crew is identified by a color code. and solve. Scott and Associates. The possible assignments and the estimated completion times in days are as follows: Client Project Leader Jackson Ellis Smith 1 2 3 10 16 32 14 22 40 22 24 34 a. 11.M. 3000 8000 5000 6000 8000 4000 7:00. 4000 5500 8000 5000 6000 7000 Home Improvement World News NASCAR Live Wall Street Today Hollywood Briefings Ramundo & Son 8 . CarpetPlus sells and installs floor covering for commercial buildings. developed a list of six potential replacement programs. Formulate and solve a linear programming model to determine the minimum cost assignment.8:30 P. Steve Botuchis.7:30 P. Formulate the problem as a linear program. What is the total time required? 10. Botuchis asked you to find the assignment of programs to time slots that will maximize total advertising revenue. 5000 7500 8500 7000 7000 6000 5:30. 6000 7000 6500 6500 3000 4500 8:00. is an accounting firm that has three new clients. Based on the different backgrounds and experiences of the leaders. five installation crews are available for assignment. the various leader-client assignments differ in terms of projected completion times.. Brad Sweeney. b. Develop a network representation of the problem. the station manager. Estimates of the advertising revenue (in dollars) that can be expected for each of the new programs in the four vacated time slots are as follows.M. Develop a network representation of this problem.M. Inc. a CarpetPlus account executive. Because the commission Brad will earn depends on the profit CarpetPlus makes. Brad must now assign a CarpetPlus installation crew to each of the five jobs. Mr.Quantitative Analysis BA 452 Supplemental Questions 6 9. was just awarded the contract for five jobs.

if any. Which bids should UES accept. How does this constraint change the assignment and the cost of supplying customer zones? Distribution Centers Plano Nashville Flagstaff Springfield Boulder 13. The following table shows the five distribution centers and cost of supplying each customer zone (in thousands of dollars): Customer Zones Los Chicago Columbus Atlanta Newark Kansas Denver Dallas Angeles City 70 47 22 53 98 21 27 13 75 38 19 58 90 34 40 26 15 78 37 82 111 40 29 32 60 23 8 39 82 36 32 45 45 40 29 75 86 25 11 37 a. the company’s vice president of logistics specified that distribution centers may not be assigned more than three customer zones. are not used? c. In an effort to balance demand and workload at the distribution centers. Cable Company uses a distribution system with five distribution centers and eight customer zones. Which distribution centers.S. After screening potential suppliers. United Express Service (UES) uses large quantities of packaging materials as its four distribution hubs. Each customer zone is assigned a sole source supplier. each customer zone receives all of its cable products from the same distribution center. UES asked each of the six vendors to submit bids to satisfy annual demand at each of its four distribution hubs over the next year. b. Suppose that each distribution center is limited to a maximum of two customer zones. The U. UES identified six vendors that can provide packaging materials that will satisfy its quality standards. Determine the assignment of customer zones to distribution centers that will minimize cost.Quantitative Analysis BA 452 Supplemental Questions 6 12. and which vendors should UES select to supply each distribution hub? Distribution Hub 3 125 155 135 190 140 130 Bidder Martine products Schmidt Materials Miller Containers D&J Burns Larbes Furnishings Lawler Depot 1 190 150 210 170 220 270 2 175 235 225 185 190 200 4 230 220 260 280 240 260 9 . The following table lists the bids received (in thousands of dollars). UES wants to ensure that each of the distribution hubs is serviced by a different vendor.

Suppose that the time statistician 3 needs to complete the job for client B increases to 250 hours. Four core courses need to be covered.2 2. Student evaluations of professors are available from previous terms.6 3. 3 (very good). however. What effect will this change have on the solution? d. Suppose that the time statistician 4 needs to complete the job for client A is increased from 160 to 165 hours. MBA. and cannot be assigned to teach the Ph. 2 (average).2 3. with each professor receiving one of the courses. all four statisticians are busy.Quantitative Analysis BA 452 Supplemental Questions 6 14.D.6 3. and therefore each can handle only one client. and 0 (poor).D. MS.2 MS 3. what staffing assignments should be made? Course MBA 2. The quantitative methods department head at a major Midwestern university will be scheduling faculty to teach courses during the coming autumn term. the differences in time are based on experience and ability of the statisticians.5 Ph. 1 (fair). Client A B C 150 210 270 170 230 220 180 230 225 160 240 230 a. Based on a rating scale of 4 (excellent). the average student evaluations for each professor are shown.0 3.D. Professor D does not have a Ph. b. If the department head makes teaching assignments based on maximizing the student evaluation ratings over all four courses.-level course. Formulate and solve a linear programming model for this problem.8 Professor A B C D UG 2. Suppose that the time statistician 4 needs to complete the job for client A is decreased to 140 hours. The four courses are at the UG.5 - 15. What effect will this change have on the solution? Statistician 1 2 3 4 10 . 3. The following data show the number of hours required for each statistician to complete each job. A market research film’s three clients each requested that the firm conduct a sample survey. Four available statisticians can be assigned to these three projects.D. and Ph.3 3.2 3.5 2.8 3.0 3. Four professors will be assigned to the courses. What effect will this change have on the solution? c.3 3. levels.

00 10. labor strikes or resource availability).80 4.00 1.00 5.00 2.20 2.40 5.20 5. The quantity of Rbase needed by each Hatcher division and the price per gallon charged by each supplier are as follows: Demand Division (1000s of gallons) 1 40 2 45 3 50 4 35 5 45 Price Per Gallons ($) 12.20 12.80 4 3.50 3.20 14.00 2 4. 11 .40 1.70 2.80 0.60 3 2.00 Supplier 1 2 3 4 5 6 The cost per gallon (in dollars) for shipping from each supplier to each division is provided in the following table: Supplier Division 1 2 3 4 5 6 2.40 5. Determine the optimal assignment of suppliers to divisions. All six suppliers can produce Rbase in sufficient quantities to accommodate the needs of each division.40 0.75 1 0. Only six suppliers of Rbase meet Hatcher’s quality control standards.60 3.20 3.30 2. Company policy requires that each division have a separate supplier. compute the total cost of supplying the division’s demand.. a.75 2.g. Hatcher Enterprises uses a chemical called Rbase in production operations at five divisions.60 14.Quantitative Analysis BA 452 Supplemental Questions 6 16. b.60 1.60 5.60 5 Hatcher believes in spreading its business among suppliers so that the company will be less affected by supplier problems (e.15 2.80 6.40 1.00 13.75 2. For each supplier-division combination.80 2.40 2.

The distribution system for the Herman Company consists of three plants. two warehouses. Develop a network representation of this problem. Suppose that shipments between the two warehouses are permitted at $2 per unit and that direct shipments can be made from plant 3 to customer 4 at a cost of $7 per unit. 12 . Formulate a linear programming model of the problem. Develop a network representation of this problem.Quantitative Analysis BA 452 Supplemental Questions 6 17. 18. Formulate a linear programming model of this problem. Plant capacities and shipping costs per unit (in dollars) from each plant to each warehouse are as follows: Warehouse Plant 1 2 Capacity 1 4 7 450 2 8 5 600 3 5 6 380 Customer demand and shipping costs per unit (in dollars) from each warehouse to each customer are Customer Warehouse 1 2 3 4 6 4 8 4 1 3 6 7 7 2 30 300 300 400 Demand a. Solve the linear program to determine the optimal shipping plan. c. c. a. b. Refer to Problem 17. b. Solve the linear program to determine the optimal shipping plan. and four customers.

and Portsmouth. Inc. operates paper plants in Augusta. The plant capacities and distributor demands for the next month are as follows: Plant Augusta Tupper Capacity (units) 300 100 Distributor Boston New York Philadelphia Demand (units) 150 100 150 The unit transportation costs (in dollars) for shipments from the two plants to the two warehouses and from the two warehouses to the three distributors are as follows: a. and Tupper Lake. New Hampshire. Distributors are located in Boston. New York.Quantitative Analysis BA 452 Supplemental Questions 6 19. 13 . Solve the linear program to determine the minimum cost shipping schedule for the problem. Adirondack Paper Mills. Formulate the Adirondack Paper Mills problem as a linear programming problem. Warehouse facilities are located in Albany.. New York. Maine. New York. and Philadelphia. c. Draw the network representation of the Adirondack Paper Mills problem. b.

The Moore & Harman Company is in the business of buying and selling grain. If the company can keep freight costs low. six rail cars at Brazil. Ohio. The company recently purchased three rail cars of grain at Muncie. Which (if any) rail cars of grain must be held at the origin until buyers can be found? 14 . The locations and the amount sold at each location are as follows: All shipments must be routed through either Louisville of Cincinnati. An important aspect of the company’s business is arranging for the purchased grain to be shipped to customers. Twelve carloads of grain have been sold. Indiana. profitability will improve. Indiana. Determine a shipping schedule that will minimize the freight costs necessary to satisfy demand.Quantitative Analysis BA 452 Supplemental Questions 6 20. Shown are the shipping costs per bushel (incents) from the origins to Louisville and Cincinnati and the costs per bushel to ship from Louisville and Cincinnati to the destinations. and five rail cars at Xenia.

Solve the model formulated in part (a) to determine how the cars should be redistributed among the locations. 15 . A positive number by a node indicates an excess supply at the node. b. The following network shows the locations of concern (the nodes) and the cost to move a car between locations. A rental car company has an imbalance of cars at seven of its locations.Quantitative Analysis BA 452 Supplemental Questions 6 21. a. The following linear programming formulation is for a transshipment problem: Show the network representation of this problem. Develop a linear programming model of this problem. 22. and a negative number indicates an excess demand.

Shown here is the Gorman road network with travel time rather than distance. In the original Gorman Construction Company problem. Because some of the roads are highways and others are city streets. Find the shortest route from node 1 to node 7 in the network shown.Quantitative Analysis BA 452 Supplemental Questions 6 23. we found the shortest distance from the office (node 1) to the construction site located at node 6. 24. the shortest-distance routes between the office and the construction site may not necessarily provide the quickest of shortest-time route. Find the shortest route from Gorman’s office to the construction site at node 6 if the objective is to minimize travel time rather than distance. 16 .

and the closest CARD courier is 8 minutes away from location 1.M. Develop a linear programming model that can be used to find the minimum time required to make a delivery from location 1 to location 6.Quantitative Analysis BA 452 Supplemental Questions 6 25. CARD quotes a guaranteed delivery time. b. what is the guaranteed delivery time if the package picked up at location 1 is to be delivered to location 6? 17 . The following network shows the street routes available. Assume that it is now 1:00P. If CARD provides a 20% safety margin in guaranteeing a delivery time. CARD. operates a delivery service in the Cleveland metropolitan area. Cleveland Area Rapid Delivery. CARD promotes its ability to make fast and on-time deliveries anywhere in the metropolitan area. Most of CARD’s business involves rapid delivery of documents and parcels between offices during the business day. CARD just received a request for a pickup at location 1. The numbers above each arc indicate the travel time in minutes between the two locations. How long does it take to make a delivery form location 1 to location6? c. a. When a customer calls with a delivery request.

City Cab Company identified 10 primary pickup and drop locations for cab riders in New York City. When Morgan receives a request for service. With both fast service and minimum travel costs as objectives for Morgan. Note that there are two one-way streets with the direction shown by the arrows. 27. what is the route a driver beginning at location 1 should take to reach location 10? The travel times in minutes are shown on the arcs of the network. it dispatches a truck from Chicago to the city requesting service as soon as possible. Using the following network of roads and streets. it is important that the dispatched truck take the shortest route from Chicago to the specified city. Morgan Trucking Company operates a special pickup and delivery service between Chicago and six other cities located in a four-state area. management would like the cab drivers to take the shortest route between locations whenever possible.Quantitative Analysis BA 452 Supplemental Questions 6 26. Find the shortest-route distance from Chicago to node 6. 18 . Assume that the following network (not drawn to scale) with distances given in miles represents the highway network for this problem. In an effort to minimize travel time and improve customer service and the utilization of the company’s fleet of cabs.

000 vehicles per hour? 19 . If a decision is made to replace the equipment. The arc from node 0 to node 2 represents the decision to keep the current equipment two years and replace it at the end of year 2. Each node indicates a time when a decision is made to keep or replace a firm’s computer equipment. can accommodate the capacities shown: Can the highway system accommodate a north-south flow of 10. Use a shortest-route model to determine the minimum cost equipment replacement policy for the four-year period. The numbers above the arcs indicate the total cost associated with the equipment replacement decisions. operating costs. The five nodes in the following network represent points one year apart over a four-year period. The arc from node 0 to node 1 represents the decision to keep the current equipment one year and replace it at the end of the year. a decision must also be made as to how long the new equipment will be used. New York. trade-in value. These costs include discounted purchase price. 29. The north-south highway system passing through Albany.Quantitative Analysis BA 452 Supplemental Questions 6 28. and maintenance costs.

If the Albany highway system described in Problem 29 has revised flow capacities as shown in the following network. Calls are carried through cable lines and switching nodes. what is the maximal flow in vehicles per hour through the system? How many vehicles per hour must travel over each road (arc) to obtain this maximal flow? 31. 20 . The numbers above each arc show the capacity in thousands of messages that can be transmitted over that branch of the network. To keep up with the volume of information transmitted between origin and destination points. A long-distance telephone company uses a fiber-optic network to transmit phone calls and other information between locations.Quantitative Analysis BA 452 Supplemental Questions 6 30. A portion of the company’s transmission network is shown here. use the network to determine the maximum number of messages that may be sent from a city located at node 1 to a city located at node 7.

the flow capacities vary.000 gallons to location 7? 33. determine the maximal flow in vehicles per hour. For the following highway network system. what is the maximal flow for the system? How long will it take to transmit 100. a. What is your recommendation for the 3-4 arc of the network? 21 .000 gallons? What is the maximal flow for this pipeline system? b. By selectively opening and closing sections of the pipeline network.Quantitative Analysis BA 452 Supplemental Questions 6 32. The High-Price Oil Company owns a pipeline network that is used to convey oil from its source to several storage locations. 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 1000. The highway commission is considering adding highway section 3-4 to permit a flow of 2000 vehicles per hour or. a flow of 3000 vehicles per hour. If a break occurs on line 2-3 and it is closed down. A portion of the network is as follows: Due to the varying pipe sizes. at an additional cost. the firm can supply any of the storage locations.

and so on. Sanders estimates demand for a particular product at 150. how many units are carried in inventory each month. regular production from month 1 used to meet demand in month 2 would cost Sander $50 + $20 = $70 per unit. Sanders Fishing Supply of Naples. where? 22 . What is the maximum flow capacity for the system if the company wishes to transfer as much liquid chemical as possible from location 1 to location 9? How much of the chemical will flow through the section of pipe from node 3 to node 5? 35. Florida. Refer to the Contois Carpets problem for which the network representation is shown in Figure 6. manufactures a variety of fishing equipment that it sells throughout the United States. Because of other commitments and anticipated cost increase in month 3. Suppose that Contois has a beginning inventory of 50 yards of carpet and requires an inventory of 50 yards of carpet and requires an inventory of 100 yards at the end of quarter 4. 250. b. This same month 1 production used to meet demand in month 3 would cosr Sanders $50 + 2($20) = $90 per unit. The following pipe network has pipe flow capacities in gallons per minute as shown. a. (Hint: Use six origin nodes. respectively. For example. Sanders can supply the demand by producing on regular time or overtime. A chemical processing plant has a network of pipes that are used to transfer liquid chemical products from one part of the plant to another. Develop a linear programming model that can be used to schedule regular and overtime production for each of the three months.Quantitative Analysis BA 452 Supplemental Questions 6 34. Develop a linear programming model and solve for optimal solution.) b. What is the production schedule.20. Develop a network representation of this modified problem. Is there any unused production capacity? If so. 36. but the cost is $20 per unit per month. c. the supply for origin node 1 is the maximum that can be produced in month 1 on regular time. and what is the total cost? d. and 300 units. Develop a network representation of this production scheduling problem as a transportation problem. For the next three months. a. the production capacities in units and the production costs per unit are as follows: Inventory may be carried from one month to the next.

Quantitative Analysis BA 452 Supplemental Questions 6 Answers to Supplemental Questions 6 1. Atlanta 2 5000 Phila. 6 6 2 Dallas 3200 1400 1 2 3000 New Orleans 5 7 Columbus 2000 Boston 1400 23 . The network model is shown.

x13. Louis Omaha .t. a. x11 x12 x13 + + x21 + x22 + x11 x21 + x12 x22 + x13 + x11.Des Moines Jefferson City .Des Moines Total Amount 5 15 10 20 Cost 70 135 70 160 435 5x23 ≤ x23 ≤ = = x23 = 30 20 25 15 10 24 . x21. x23.St. x12. Let x11 : Amount shipped from Jefferson City to Des Moines x12 : Amount shipped from Jefferson City to Kansas City • • • 9x12 Min 14x11 + + 7x13 + 8x21 + 10x22 + s. ≥ 0 b.Kansas City Jefferson City . Optimal Solution: Jefferson City .Quantitative Analysis BA 452 Supplemental Questions 6 2. x22.

b. Optimal Solution Southern .Butler Total Cost Amount 200 300 200 200 Cost $ 2000 4500 2400 3000 $11. 10x11 x11 x11 x12 x13 xij ≥ 0 for all i.Hamilton Northwest .Hamilton Southern . The new optimal solution is: Amount 300 300 100 300 Cost $ 3000 4500 1200 4500 $13. a.Hamilton Southern .Hamilton Northwest .Clermont Northwest .t.Clermont Northwest . j + + 20x12 x12 + + 15x13 x13 + x21 + x21 + x22 + x22 + + 12x21 + 15x22 + 18x23 ≤ x23 ≤ = = x23 = 500 400 400 200 300 c.Quantitative Analysis BA 452 Supplemental Questions 6 3. To answer this question the simplest approach is to increase the Butler County demand to 300 and to increase the supply by 100 at both Southern Gas and Northwest Gas.Butler Total Cost From the new solution we see that Tri-County should contract with Southern Gas for the additional 100 units.200 Southern . Let xij = amount shipped from supply node i to demand node j.900 d. Min s. 25 .

1) SEPI + SEMO + SEDE + SELA + SEWA <= 9000 26 . b. The linear programming formulation and optimal solution are shown. The first two letters of the variable name identify the “from” node and the second two letters identify the “to” node.Quantitative Analysis BA 452 Supplemental Questions 6 4. a. LINEAR PROGRAMMING PROBLEM MIN 10SEPI + 20SEMO + 5SEDE + 9SELA + 10SEWA + 2COPI + 10COMO + 8CODE + 30COLA + 6COWA + 1NYPI + 20NYMO + 7NYDE + 10NYLA + 4NYWA S.T.

00000 0.00000 1000.00000 6.00000 -10.00000 0.00000 12.00000 4000. 27 .00000 0.00000 0.00000 0.00000 0.00000 0.00000 1.00000 12.00000 Variable SEPI SEMO SEDE SELA SEWA COPI COMO CODE COLA COWA NYPI NYMO NYDE NYLA NYWA Value 0.00000 0.00000 0.00000 1.00000 4.00000 3000.00000 0.00000 20.00000 3000.00000 11.00000 0.00000 10.00000 0.00000 Constraint 1 2 3 4 5 6 7 8 Slack/Surplus 0.00000 0.00000 Dual Value -1. It is summarized.00000 0.00000 0.00000 1.00000 0.00000 Reduced Cost 10.00000 0.00000 5000.00000 4000.00000 0.00000 0.00000 7.Quantitative Analysis BA 452 Supplemental Questions 6 2) 3) 4) 5) 6) 7) 8) COPI NYPI SEPI SEMO SEDE SELA SEWA + + + + + + + COMO NYMO COPI COMO CODE COLA COWA + + + + + + + CODE NYDE NYPI NYMO NYDE NYLA NYWA + + = = = = = COLA + COWA <= 4000 NYLA + NYWA <= 8000 3000 5000 4000 6000 3000 OPTIMAL SOLUTION Optimal Objective Value 150000.00000 0.00000 1000.00000 30.00000 c.00000 0. The new optimal solution actually shows a decrease of $9000 in shipping cost.00000 0.

Los Angeles Columbus .Washington Units 4000 5000 5000 4000 1000 3000 Cost $ 20.000 4.Denver Seattle .000 45.000 10.Mobile New York .000 50.Quantitative Analysis BA 452 Supplemental Questions 6 Optimal Solution Seattle .000 12.000 28 .Pittsburgh New York .Los Angeles New York .000 Total: $141.

Quantitative Analysis BA 452 Supplemental Questions 6 5. + 100x14 + 120x21 + 150x32 + 140x33 x14 + x22 + x23 + x31 x21 x31 + x22 + x13 x23 + x14 + 135x22 + 115x23 + 130x34 + + + + x24 x32 + x32 + x24 ≤ ≤ x33 + x34 ≤ = = x33 = + x34 = 160 160 140 180 75 100 85 Max 100x11 + 125x12 + 115x13 s. a. j 29 .t. Let xij = number of hours from consultant i assigned to client j. + 120x24 + 155x31 x11 + x12 + x13 x21 x11 x12 + xij ≥ 0 for all i. b.

700 $57.Client B Baker .200 21.725 10.200 21.500 4.Client B Baker .925 Avery .000 11.Client B Avery .Client A Avery .Client D Campbell .Client A Total Billing Hours Assigned 40 100 75 85 140 Billing $ 4.Client D Campbell .Client C Baker .Client C Baker .500 10.Client A Baker .800 4.525 30 .700 $57.000 11. New Optimal Solution Avery .125 10.Client A Total Billing c.Quantitative Analysis BA 452 Supplemental Questions 6 Optimal Solution Hours Assigned 40 100 40 35 85 140 Billing $ 5.

and x34 are the amounts shipped out of the dummy origin.Quantitative Analysis BA 452 Supplemental Questions 6 6. and the optimal solution are shown. j 31 . The variables x31. x32. x11 + x12 + x13 + x14 x21 + x31 + x11 x12 x13 x14 + x21 + x22 + x23 + x24 x32 + + x33 + x31 + x32 + x33 + x34 x22 + x34 x23 + x24 ≤ ≤ ≤ = = = 5000 3000 4000 2000 5000 3000 Dummy 32x11 + 34x12 + 32x13 + 40x14 + 34x21 + 30x22 + 28x23 + 38x24 = 2000 xij ≥ 0 for all i. they do not appear in the objective function since they are given a coefficient of zero. the linear programming formulation.t. 28 38 D3 0 0 4000 Dum 0 0 D4 2000 3000 5000 2000 Note: Dummy origin has supply of 4000.S. Max s. 32 34 32 40 D2 34 30 3000 D. x33. Demand D1 Supply 5000 C. Note that the third constraint corresponds to the dummy origin. The network model.

000 2000 68.D2 Clifton Springs .D1 Danville .Quantitative Analysis BA 452 Supplemental Questions 6 Optimal Solution Clifton Springs .D4 Units Cost 4000 $136.D4 Danville .000 1000 40. 32 .000 Total Cost: $282.000 Customer 2 demand has a shortfall of 1000 Customer 3 demand of 3000 is not satisfied.000 1000 38.

There will be idle capacity for 90 motors at Denver. My answer to this homework 1question 50 Boston will go here. Forbelt should produce 10 motors at Denver.Quantitative Analysis BA 452 Supplemental Questions 6 7. Solution #1 Denver to St. 60 b. Paul: 70 33 . Paul: 10 Atlanta to Boston: 50 Atlanta to Dallas: 50 Chicago to Dallas: 20 Chicago to Los Angeles: 60 Chicago to St. There are alternative optimal solutions. To 7find your answer. and 150 motors at Chicago. Paul 80 13 3 Los Angeles 2 Dallas 70 a. you 1 may want to study the answers to some 11 100 Denver of the similar questions. Forbelt should adopt the same production schedule but a modified shipping schedule. 100 motors at Atlanta. Solution # 2 Denver to St. Paul: 10 Atlanta to Boston: 50 Atlanta to Los Angeles: 50 Chicago to Dallas: 70 Chicago to Los Angeles: 10 Chicago to St. If solution #2 is used. Paul: 70 Total Profit: $4240 If solution #1 is used. 8 13 20 17 100 2 Atlanta 12 10 8 18 3 150 Chicago 16 4 St.

1x3A + x3B + 1.4x2B + 1.t.3x2A + 1. x1A Let = Units of product A on machine 1 x1B = Units of product B on machine 1 • • • x3C = Units of product C on machine 3 Min s.9x1C + 1.Quantitative Analysis BA 452 Supplemental Questions 6 8. 34 .2x2C + 1. The linear programming formulation and optimal solution are shown.2x1B + 0. j Optimal Solution 1-A 1-C 2-A 3-A 3-B Units 300 1200 1200 500 500 Cost $ 300 1080 1560 550 500 Total: $3990 Note: There is an unused capacity of 300 units on machine 2.2x3C x1A + x1B + x1C x2A + x2B + x2C x3A + x3B + x1A x1B x1C + x2A + x2B + x2C + x3A + x3B + ≤ ≤ x3C ≤ = = x3C = 1500 1500 1000 2000 500 1200 xij ≥ 0 for all i. x1A + 1.

Quantitative Analysis BA 452 Supplemental Questions 6 9.t. a. x21 = 1. j Solution x12 = 1. b. x11 + x12 + x13 x21 + x22 + x23 x31 + x32 + x33 x11 + x21 + x31 x12 + x22 + x32 x13 x23 + + x33 xij ≥ 0 for all i. x33 = 1 Total completion time = 64 ≤ ≤ ≤ = = = 1 1 1 1 1 1 35 . Min 10x11 + 16x12 + 32x13 + 14x21 + 22x22 + 40x23 + 22x31 + 24x32 + 34x33 s.

5 Optimal Solution: Green to Job 1 Brown to Job 2 Red to Job 3 Blue to Job 4 White to Job 5 $26 34 38 39 25 $162 Since the data is in hundreds of dollars. 30x11 x11 + 44x12 + x21 + 38x13 x13 + x32 + x51 x31 + x23 + x15 + 47x14 + x23 + x42 + + x32 + x24 + x14 + x33 + x52 x41 + x33 + x25 + 31x15 + x24 + x43 + + x42 + x34 + x15 + x34 + x53 x51 + x43 + x35 + 25x21 + + 28x55 ≤ ≤ ≤ ≤ ≤ = = = = = x12 + + x22 x31 + x41 x21 + + x22 x13 + x14 x25 + x44 + x52 + x44 + x35 + x45 x54 + x55 x11 + x12 x53 + x54 x45 + x55 1 1 1 1 1 1 1 1 1 1 xij ≥ 0. 36 . 5.. i = 1.t.. a. 2.. b.Quantitative Analysis BA 452 Supplemental Questions 6 10.. j = 1.. Min s.200. 2.. the total installation cost for the 5 contracts is $16.

Total expected advertising revenue = $30. one for each program/time slot combination. World News 7:00 – 7:30 p. 37 .m. My answer to this homework question will Optimal Solution: To find your answer. 6 for the potential programs and 4 for the time slots. There are 24 variables.m. NASCAR Live 5:00 – 5:30 may want to studyp. There are 10 constraints.500 This can be formulated as a linear program with a maximization objective function. you go here. of the similar questions. answers to some the Hollywood Briefings 5:30 – 6:00 p.m. Ramundo & Son 8:00 – 8:30 p.m.Quantitative Analysis BA 452 Supplemental Questions 6 11.

Quantitative Analysis BA 452 Supplemental Questions 6 12. The Nashville distribution center is not used. All the distribution centers are used. Dallas Los Angeles Chicago. Columbus. Each distribution center may be assigned up to 3 customer zones. The linear programming model of this problem has 40 variables (one for each combination of distribution center and customer zone). c. Columbus is switched from Springfield to Nashville. Atlanta Newark. It has 13 constraints. a.000 to $227. This is the variation of the assignment problem in which multiple assignments are possible. There are 5 supply (≤ 3) constraints and 8 demand (= 1) constraints. The optimal solution is given below.000. Assignments Kansas City. Denver Total Cost Cost ($1000s) 34 15 70 97 $216 Plano: Flagstaff: Springfield: Boulder: b. 38 . Total cost increases by $11.

2BUG + Max 2.6 3.3 3. Min 190x11 +175x12 + 125x13 + 230x14 + 150x21 + 235x22 + 155x23 + 220x24 + 210x31 + 225x32 + 135x33 +260x34 + 170x41 + 185x42 + 190x43 + 280x44 + 220x51 + 190x52 + 140x53 + 240x54 + 270x61 + 200x62 + 130x63 + 260x64 s. course C to MBA course D to Undergraduate course Max Total Rating 39 Rating 3. AUG ··· CPH DMS + 2.3AMS + 3.3 .8AUG s. For the decision variables. Note that a DPH variable is not created because the assignment is unacceptable. x11 + x12 + x13 + x14 ≤ 1 + x21 + x22 + x23 + x24 ≤ 1 x31 + x32 + x33 + x34 ≤ 1 x41 + x42 + x43 + x44 ≤ 1 x51 + x52 + x53 + x54 ≤ 1 x61 + x62 + x63 + x64 ≤ 1 x11 + x21 + x31 + x41 + x51 + x61 = 1 x12 + x22 + x32 + x42 + x52 + x62 = 1 x13 + x23 + x33 + x43 + x53 + x63 = 1 x14 + x24 + x34 + x44 + x45 + x46 = 1 xij ≥ 0 for all i. we let the first subscript correspond to the supplier and the second subscript correspond to the distribution hub. Let the first letter of each variable name represent the professor and the second two the course.2 3.D. xij = 1 if supplier i is awarded the bid to supply hub j and xij = 0 if supplier i is not awarded the bid to supply hub j. xij. + 2. j Bid 175 220 170 130 695 Optimal Solution Martin – Hub 2 Schmidt Materials – Hub 4 D&J Burns – Hub 1 Lawler Depot – Hub 3 14.2AMB + 3. A linear programming formulation and the optimal solution are given.5DMS ≤ ≤ ≤ ≤ = = = = + AMB BUG + + AMS BMB CUG CUG BMB AMS + + + + + + AUG + BUG AMB + + APH BMS CMB DUG DUG CMB BMS APH + + + + + + BPH CMS DMB DMB CMS BPH + + + + DMS CPH 1 1 1 1 1 1 1 1 All Variables ≥ 0 Optimal Solution: A to MS course B to Ph.t.Quantitative Analysis BA 452 Supplemental Questions 6 13.t. Thus. A linear programming formulation of this problem can be developed as follows.0APH + 3.2 13.

The solution will not change. This is the extra time required for statistician 4 to complete the job for client A. j Optimal Solution: x12 = 1. Note that this occurs because increasing the time for statistician 3 makes statistician 3 an even less attractive candidate for assignment. b. statistician 3 will not be assigned.Quantitative Analysis BA 452 Supplemental Questions 6 15. + To 230x22 your answer. you find + 220x23 + 225x33 180x31 + + 230x32 240x to 230x43 + 160x41 + may want to study the answers 42 + some s. x11 x12 x13 ≤ 1 of the +similar+ questions. x23 = 1. d. The solution will not change. but the total hours required will increase by 5. x x x + + ≤ 1 21 22 x31 + x11 x12 x13 +x21 +x22 +x23 xij ≥ for all i. a. x41 = 1 Total hours required: 590 Note: statistician 3 is not assigned. My150x11 + 210x12to this 13 answer + 270x homework question Min 170x21 will go+ here. 40 .t. but the total time required will decrease by 20 hours. The solution will not change. +x31 +x32 23 x32 + x41 + +x41 +x42 +x33 x33 x42 + ≤ x43 ≤ = = = 1 1 1 1 1 +x43 c.

Division 2 Supplier 2 .000 b. a. The total cost is the sum of the purchase cost and the transportation cost. We show the calculation for Division 1 .000 x $12.Division 5 Supplier 3 .169 41 .Division 3 Supplier 5 . Optimal Solution: Supplier 1 .60) Transportation Cost (40.Division 1 Supplier 6 .Supplier 1 Purchase cost (40.000 110.000 $614.000s) Supplier 1 1 2 Division 3 4 5 865 532 720 830 553 648 775 511 684 850 581 693 900 595 657 930 553 747 614 603 2 660 639 3 534 702 4 680 693 5 590 693 6 630 630 $504.000 x $2. Division 1 .75) Total Cost: Cost Matrix ($1.Quantitative Analysis BA 452 Supplemental Questions 6 16.Division 4 $ 603 648 775 590 553 Total $3.Supplier 1 and present the result for the other Division-Supplier combinations.

Quantitative Analysis BA 452 Supplemental Questions 6 17. & c. 1) 2) 3) 4) 5) 6) 7) 8) 9) X14 X24 X34 X46 X56 X46 X47 X48 X49 + + + + + + + + + X15 X25 X35 X47 X57 X56 X57 X58 X59 <= 450 <= 600 < 380 + X48 + X49 . a.X35 = 0 = 300 = 300 = 300 = 400 42 .T.X25 . The linear programming formulation and solution are shown.X15 . LINEAR PROGRAMMING PROBLEM MIN 4X14 + 7X15 + 8X24 + 5X25 + 5X34 + 6X35 + 6X46 + 4X47 + 8X48 + 4X49 + 3X56 + 6X57 + 7X58 + 7X59 S. Network Model Demand 6 C1 1 P1 4 6 7 4 W1 4 5 5 W2 6 3 6 7 7 5 380 3 P3 8 C3 300 4 8 7 C2 300 300 Supply 450 600 2 P2 8 9 C4 400 b.X24 .X34 = 0 + X58 + X59 .X14 .

00000 Reduced Cost 0.00000 0.00000 400.00000 0.00000 0.00000 600.00000 0.00000 0.00000 0.00000 0.00000 There is an excess capacity of 130 units at plant 3.00000 300.00000 Constraint 1 2 3 4 5 6 7 8 9 Slack/Surplus 0.00000 0.00000 5.00000 3.00000 6.00000 130.00000 9.00000 0.00000 9.00000 9.00000 0.00000 2.00000 0.00000 300.00000 0.00000 250.00000 2.00000 Variable X14 X15 X24 X25 X34 X35 X46 X47 X48 X49 X56 X57 X58 X59 Value 450.00000 Dual Value -1.00000 0.00000 0.00000 -1.00000 0.00000 0.00000 0.00000 0. 43 .00000 0.Quantitative Analysis BA 452 Supplemental Questions 6 OPTIMAL SOLUTION Optimal Objective Value 11850.00000 4.00000 0.00000 0.00000 4.00000 0.00000 0.00000 300.00000 13.

a.T.Quantitative Analysis BA 452 Supplemental Questions 6 18.X14 .X24 . 1) 2) 3) 4) 5) 6) 7) 8) 9) X14 X24 X34 X45 X54 X46 X47 X48 X39 + + + + + + + + + X15 X25 X35 X46 X56 X56 X57 X58 X49 <= 450 <= 600 + X39 <= 380 + X47 + X48 + X49 . The linear programming formulation and optimal solution follow: LINEAR PROGRAMMING PROBLEM MIN 4X14 + 7X15 + 8X24 + 5X25 + 5X34 + 6X35 + 6X46 + 4X47 + 8X48 + 4X49 + 3X56 + 6X57 + 7X58 + 7X59 + 7X39 + 2X45 + 2X54 S.X15 .X54 = 0 + X57 + X58 + X59 . Demand 6 C1 1 P1 4 6 7 4 W1 4 5 2 5 W2 6 7 2 3 6 7 7 5 380 3 P3 8 C3 300 4 8 7 C2 300 300 Supply 450 600 2 P2 8 9 C4 400 b.X25 .X34 .X35 . The new network is shown.&c. Three arcs must be added to the network model in problem 23a.X45 = 0 = 300 = 300 = 300 + X59 = 400 44 .

45 .00000 600.00000 12.00000 4.00000 4.00000 300.00000 0.00000 5.00000 0.00000 4.00000 0.00000 2.00000 0.00000 8.00000 2.00000 2.00000 0.00000 3.00000 0.00000 Reduced Cost 0.00000 -1.00000 Variable X14 X15 X24 X25 X34 X35 X46 X47 X48 X49 X56 X57 X58 X59 X39 X45 X54 Value 320.00000 8.00000 0.00000 0.00000 Dual Value 0.00000 0.00000 0.00000 300.00000 300.00000 1.00000 0.00000 0.00000 The value of the solution here is $630 less than the value of the solution for problem 23.00000 0.00000 20.00000 Constraint 1 2 3 4 5 6 7 8 9 Slack/Surplus 130.00000 0.00000 2.00000 3.00000 0.00000 0.00000 0. There is now excess capacity of 130 units at plant 1.00000 0.00000 380.Quantitative Analysis BA 452 Supplemental Questions 6 OPTIMAL SOLUTION Optimal Objective Value 11220.00000 0.00000 0.00000 0.00000 0.00000 0.00000 0. The new shipping route from plant 3 to customer 4 has helped (x39 = 380).00000 8.00000 0.00000 0.

Quantitative Analysis BA 452 Supplemental Questions 6 19. To find your answer. a. Optimal Solution: Variable x13 x14 x23 x24 x35 x36 x37 x45 x46 x47 Value 50 250 100 0 0 0 150 150 100 0 + x36 + x37 + x45 + x45 + x46 + x46 + x47 + x47 ≤ ≤ = = = = = 300 100 0 0 150 100 150 Objective Function: 4300 46 .x24 x35 + x36 x37 xij ≥ 0 for all i and j c. My answer to this homework question 5 Boston will go here. Min s. 7 NewYork 100 3 100 2 Tupper Lake 4 5 4 Portsmouth 6 10 7 Philadelphia 150 b. 7x13 + 5x14 + 3x23 + 4x24 + 8x35 + 5x36 + 7x37 + 5x45 + 6x46 + 10x47 x13 -x13 x14 + x14 x23 x23 + x24 + x35 . you 150 8 1 3 7 Augusta 300 Albany 5 may want to study the answers to some 5 6 of the similar questions.t.

x25 .x24 .t.Quantitative Analysis BA 452 Supplemental Questions 6 20.x34 .x35 x46 x47 x48 x49 xij ≥ 0 for all i. A linear programming model is Min 8x14 + 6x15 + 3x24 + 8x25 + 9x34 + 3x35 + 44x46 + 34x47 + 34x48 + 32x49 + 57x56 + 35x57 + 28x58 + 24x59 s. j + x46 + x47 + x48 + x49 + + x56 + x56 + x57 + x58 + x57 + x58 + ≤ 3 ≤ 6 ≤ 5 = 0 x59 = 0 = 2 = 4 = 3 x59 = 3 47 .x15 . x14 + x15 x24 + x25 x34 + x35 -x 14 .

48 .Quantitative Analysis BA 452 Supplemental Questions 6 Optimal Solution Units Shipped Muncie to Cincinnati Cincinnati to Concord Brazil to Louisville Louisville to Macon Louisville to Greenwood Xenia to Cincinnati Cincinnati to Chatham Cost 1 3 6 2 4 5 3 6 84 18 88 136 15 72 419 Two rail cars must be held at Muncie until a buyer is found.

j x12 = 0 x53 x15 = 0 x54 x25 = 8 x56 x27 = 0 x67 x31 = 8 x74 x36 = 0 x56 x42 = 3 = = = = = = 5 0 5 0 6 5 Total cost of redistributing cars = $917 49 .Quantitative Analysis BA 452 Supplemental Questions 6 21. xij ≥ 0 for all i.t. x31 x12 x31 + x53 + x54 + x74 x15 x25 + x36 x56 x27 x27 x53 x54 + x15 x67 x74 x25 x36 + x56 x42 x12 x42 = 8 = 5 = 3 = 3 = 2 x67 = 5 = 6 b. 22. a. The negative numbers by nodes indicate the amount of demand at the node. Min 20x12 + 25x15 + 30x25 + 45x27 + 20x31 + 35x36 + 30x42 + 25x53 + 15x54 + 28x56 + 12x67 + 27x74 s. The positive numbers by nodes indicate the amount of supply at that node.

and x46 = 1 Shortest Route 1-2-4-6 Total Time = 63 minutes 50 . x56 = 1 . 1 if the arc from node i to node j is on the shortest route Let xij = 0 otherwise Min 7 x12 + 9 x13 + 18 x14 + 3 x23 + 5 x25 + 3 x32 + 4 x35 + 3 x46 + 5 x52 + 4 x53 + 2 x56 +6 x57 + 2 x65 + 3 x67 s. Use same six constraints for the Gorman shortest route problem as shown in the text. x24 = 1 . Flow Out Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7 Flow In =1 x12 + x13 + x14 x23 + x25 x32 + x35 x46 x52 + x53 + x56 + x57 x65 + x67 − x12 − x32 − x52 − x13 − x23 − x53 − x14 − x25 − x35 − x65 − x46 − x56 + x57 + x67 =0 =0 =0 =0 =0 =1 xij > 0 for all i and j Optimal Solution: x12 = 1 . The linear program has 13 variables for the arcs and 6 constraints for the nodes. Min 40 x12 + 36 x13 + 6 x23 + 6 x32 + 12 x24 + 12 x42 + 25 x26 + 15 x35 + 15 x53 + 8 x45 + 8 x54 + 11 x46 + 23 x56 Optimal Solution: x12 = 1 . and x67 = 1 Shortest Route 1-2-5-6-7 Length = 17 24. The objective function changes to travel time as follows. x25 = 1 .t.Quantitative Analysis BA 452 Supplemental Questions 6 23. Origin – Node 1 Transshipment Nodes 2 to 5 Destination – Node 7 The linear program will have 14 variables for the arcs and 7 constraints for the nodes.

Flow Out Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Flow In =1 x12 + x13 x23 + x24 + x26 x32 + x35 x42 + x45 + x46 + x53 + x54 + x56 − x12 − x32 − x42 − x13 − x23 − x53 − x24 − x54 − x35 − x45 + x26 + x46 + x56 xij > 0 for all I and j =0 =0 =0 =0 =1 b. x24 = 1 . Allowing 8 minutes to get to node 1 and 69 minutes to go from node 1 to node 6. 1 if the arc from node i to node j is on the shortest route Let xij = 0 otherwise Min 35 x12 + 30 x13 + 12 x23 + 18 x24 + 39 x26 + 12 x32 + 15 x35 + 18 x42 + 12 x45 +16x46 +15x53 +12x54 +30x56 s.2(77) = 92 minutes. a. we can guarantee a delivery in 1. 51 . With a 20% safety margin. Guarantee delivery by 2:32 p.t.Quantitative Analysis BA 452 Supplemental Questions 6 25. now.m. and x46 = 1 Shortest Route 1-2-4-6 Total time = 69 minutes c.m. we expect to make the delivery in 77 minutes. Origin – Node 1 Transshipment Nodes 2 to 5 Destination – Node 6 The linear program will have 13 variables for the arcs and 6 constraints for the nodes. It is 1:00 p. Optimal Solution: x12 = 1 .

and x76 = 1 Shortest Route 1-4-7-6 Total Distance = 40 miles 52 . x47 = 1 .Quantitative Analysis BA 452 Supplemental Questions 6 26. Flow Out Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7 Flow In =1 x12 + x13 + x14 x23 + x25 x32 + x34 + x35 + x36 x43 + x47 x52 + x53 + x56 + x57 x74 + x75 + x76 − x12 − x32 − x52 =0 − x13 − x23 − x43 − x53 = 0 − x14 − x34 − x74 =0 − x25 − x35 − x75 =0 + x36 + x56 + x76 =1 − x47 − x57 =0 xij > 0 for all i and j Optimal Solution: x14 = 1 . Origin – Node 1 Transshipment Nodes 2 to 5 and node 7 Destination – Node 6 The linear program will have 18 variables for the arcs and 7 constraints for the nodes.t. 1 if the arc from node i to node j is on the shortest route Let xij = 0 otherwise Min 35 x12 + 30 x13 + 20 x14 + 8 x23 + 12 x25 + 8 x32 + 9 x34 + 10 x35 + 20 x36 +9 x43 + 15 x47 + 12 x52 + 10 x53 + 5 x56 + 20 x57 + 15 x74 + 20 x75 + 5 x76 s.

t. and x70 = 1 Shortest Route 1-5-4-6-7-10 Total Time = 25 minutes 53 . x67 = 1 . Origin – Node 1 Transshipment Nodes 2 to 9 Destination – Node 10 (Identified by the subscript 0) The linear program will have 29 variables for the arcs and 10 constraints for the nodes.Quantitative Analysis BA 452 Supplemental Questions 6 27. x54 = 1 . Flow Out Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7 Node 8 Node 9 Node 10 Flow In =1 x12 + x13 + x14 + x15 x23 + x27 x32 + x36 x43 + x45 + x46 x54 + x59 x63 + x64 + x67 + x68 + x69 x72 + x76 + x78 + x70 − x12 − x32 − x72 − x13 − x23 − x43 − x63 − x14 − x54 − x64 − x15 − x45 − x95 =0 =0 =0 =0 − x36 − x46 − x76 − x86 − x96 = 0 − x27 − x67 =0 x86 + x89 + x80 − x68 − x78 − x98 =0 x95 + x96 + x98 + x90 − x59 − x69 − x89 =0 + x70 + x80 + x90 =1 xij > 0 for all i and j Optimal Solution: x15 = 1 . x46 = 1 . 1 if the arc from node i to node j is on the shortest route Let xij = 0 otherwise Min 8 x12 + 13 x13 + 15 x14 + 10 x15 + 5 x23 + 15 x27 + 5 x32 + 5 x36 + 2 x43 + 4 x45 +3 x46 + 4 x54 + 12 x59 + 5 x63 + 3 x64 + 4 x67 + 2 x68 + 5 x69 + 15 x72 + 4 x76 +2 x78 + 4 x70 + 2 x86 + 5 x89 + 7 x80 + 12 x95 + 5 x96 + 5 x98 + 5 x90 s.

1 if the arc from node i to node j is on the minimum cost route Let xij = 0 otherwise Min 600 x01 + 1000 x02 + 2000 x03 + 2800 x04 + 500 x12 + 1400 x13 + 2100 x14 +800 x23 + 1600 x24 + 700 x34 s. and x34 = 1 Shortest Route 0-2-3-4 Total Cost = $2500 54 .Quantitative Analysis BA 452 Supplemental Questions 6 28. Origin – Node 0 Transshipment Nodes 1 to 3 Destination – Node 4 The linear program will have 10 variables for the arcs and 5 constraints for the nodes.t. Flow Out Node 0 Node 1 Node 2 Node 3 Node 4 Flow In =1 x01 + x02 + x03 + x04 x12 + x13 + x14 x23 + x24 x34 − x01 =0 =0 =0 =1 − x02 − x12 − x03 − x13 − x23 − x04 − x14 − x24 − x34 xij > 0 for all i and j Optimal Solution: x02 = 1 . x23 = 1 .

Quantitative Analysis BA 452 Supplemental Questions 6 29.x24 . The capacitated transshipment problem to solve is given: Max x61 s.x34 . x12 + x24 + x34 + x42 + x54 + x61 - x13 + x25 x36 x43 + x56 x36 + x14 x12 x13 x45 + x25 x46 - x61 = 0 x42 = 0 x43 = 0 x46 . j 3 2 2 3 4 4 3 2 2 1 1 3 6 5 4 Maximum Flow 9.x14 . 55 .t.000 Vehicles Per Hour 1 The system cannot accommodate a flow of 10.x54 = 0 x45 =0 x56 =0 x14 ≤ 3 x45 ≤ 1 x46 ≤ 3 x12 ≤ 2 x24 ≤ 1 x34 ≤ 3 x42 ≤ 1 x54 ≤ 1 x13 ≤ 6 x25 ≤ 4 x36 ≤ 2 x43 ≤ 3 x56 ≤ 6 xij ≥ 0 for all i.000 vehicles per hour.

The maximum number of messages that may be sent is 10.000 gallons per hour. 56 .000.000 unit/hour capacity is recommended for this arc. 33.Quantitative Analysis BA 452 Supplemental Questions 6 30. total system flow is increased to 8. 4 2 3 3 4 5 3 2 1 2 3 6 5 6 1 11.000 vehicles/hour. 34. b.000 unit/hour flow capacity.000 vehicles/hour.000 vehicles/hour.000 units/hour will also increase system to 8. Five gallons will flow from node 3 to node 5. With arc 3-4 at a 3.1 hours. 11. Thus a 2. 10. Increasing arc 3-4 to 2. Current Max Flow = 6. Maximal Flow = 23 gallons / minute. a.000 gallons per hour or 10 hours Flow reduced to 9. 32.000 3 31.

25x56 + 0. Let node 9 be an ending inventory node with a demand of 100 and an arc connecting node 8 (period 4 demand to it). a.25x89 = ≤ ≤ ≤ ≤ = = = = = 50 600 300 500 400 400 500 400 400 100 x15 x26 x37 x48 x05 + x15 x26 x37 x48 xij ≥ 0 for all i and j + x56 x56 + x67 x67 + x78 x78 - x89 x89 Optimal Solution: x05 = 50 x15 = 600 x26 = 250 x37 = 500 x48 = 400 x56 = 250 x67 = 0 x78 = 100 x89 = 100 Total Cost = $5262. Modify the problem by adding two nodes and two arcs.50 57 . x05 b. Min s. + 2x15 + 5x26 + 3x37 + 3x48 + 0.25x78 + 0.Quantitative Analysis BA 452 Supplemental Questions 6 35.25x67 + 0.t. Let node 0 be a beginning inventory node with a supply of 50 and an arc connecting it to node 5 (period 1 demand).

O2. R1D1 is amount of regular time production available to satisfy demand in month 1. D2. 3 Using these 9 nodes. 58 . D1D2 is the amount of inventory carried over from month 1 to month 2. MIN 50R1D1 + 80O1D1 + 20D1D2 + 50R2D2 + 80O2D2 + 20D2D3 + 60R3D3 + 100O3D3 S. Let R1. 3 represent overtime production in months 1.T. O3 D1. For instance. b. 2. 2. 3 represent demand in months 1.Quantitative Analysis BA 452 Supplemental Questions 6 36. R2. Use the following notation to define the variables: first two letters designates the "from node" and the second two letters designates the "to node" of the arc. D3 represent regular time production in months 1. O1D1 is amount of overtime production in month 1 available to satisfy demand in month 1. a. 2. and so on. R3 O1. a network model is shown.

000 25. Thus.000 150. d. 59 . R1D1 O1D1 R2D2 O2D2 R3D3 O3D3 R1D1 R2D2 R3D3 ≤ ≤ ≤ ≤ ≤ ≤ + + + 275 100 200 50 100 50 O1D1 . The values of the slack variables for constraints 1 through 6 represent unused capacity.000 200.750 Note: Slack variable for constraint 2 = 75.Quantitative Analysis BA 452 Supplemental Questions 6 1) 2) 3) 4) 5) 6) 7) 8) 9) c.000 50.D2D3 = 250 O3D3 + D2D3 = 300 Optimal Solution: Value --------------275. its value is 75.000 100.000 150. The only nonzero slack variable is for constraint 2.D1D2 = 150 O2D2 + D1D2 .000 50.000 Variable -------------R1D1 O1D1 D1D2 R2D2 O2D2 D2D3 R3D3 O3D3 Value = $46. there are 75 units of unused overtime capacity in month 1.

Sign up to vote on this title

UsefulNot useful- Chapter 2
- Qs Up Questions 9
- Solutions Chap 1
- Solutions Supp C-Instructor Manual
- Pre Final Burst Exercise
- Assignment
- maximization problem
- Operational Research
- OR
- Ex 04 Inventory Management
- WES
- programhw
- Network Design Problems
- Management Scientist User's Guide
- Decision Analysis
- Cases
- Solutions
- Transportation Assignment 2
- Production Strategy
- TRANsSHIPMENT PROBLEM
- Hart Venture Capital
- Queueing Problems
- PBL g16 Final
- Solution Manual for Managerial Decision Modeling With Spreadsheets 3rd Edition by Balakrishnan
- Property Purchase Strategy - Managerial Report
- Linear Programming Questions With Solutions1 2
- Solution to Topic 2 LP
- Merck & Company - Evaluating a Drug Licensing Opportunity - Pgp 2012
- Demand Forecasting Problems
- Inter Acc 12ed Test.bank
- Ch6.Pro8.Solution

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd