A network of railway lines connects the main lines entering and leaving a city. Speed limits, track reconstruction, and train length restrictions lead to the flow diagram below, where the numbers represent how many cars can pass per hour. Formulate an LP to find the maximal flow in cars per hour from Node 1 to Node F. Create your LP in Trab #9 1 500 300 5 2 600 400 300 400 300 3 6 7 150 200 4 500 350 200 400 300 8 9 300 600 450 500 F

A network of railway lines connects the main lines entering and leaving a city. Speed limits, track reconstruction, and train length restrictions lead to the flow diagram below, where the numbers represent how many cars can pass per hour. Formulate an LP to find the maximal flow in cars per hour from Node 1 to Node F. Create your LP in Trab #9 1 500 300 5 2 600 400 300 400 300 3 6 7 150 200 4 500 350 200 400 300 8 9 300 600 450 500 F

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

The objective of a maximum flow problem is to maximize the total profit generated by sending flow through a network. True or False?.
The director of Burtonsville Civil Defense Agency has been ordered to draw up a disaster plan for assigning casualties to hospitals in the event of a serious earthquake. For simplicity, we will assume that causalities will occur at two points in the city and will be transported to three hospitals. It is estimated that there will be 300 casualties at point A and 200 at point B. Travel times to hospitals 1, 2, and 3 are 25, 15, and 10 minutes, respectively; from point B they are 20, 5, and 15 minutes. Hospital capacities for emergency cases are 250, 150, and 150 patients. How should the victims be assigned to hospitals to minimize the total time lost in transporting them? Disaster Point Hospital Total Casualties 1 2 3 A 25 15 10 300 B 20 5 15 200 Maximum Capacity 250 150 150 Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You…
Show your step-by-step process using THE SPECIAL PURPOSE LINEAR PROGRAMMING: MODI TRANSPORTATION METHOD to solve this problem. XYZ Incorporated has received a contract to supply gravel to three new road projects located at three different locations. Project A needs 174 truckloads, Project B needs 204 truckloads, and Project C needs 143 truckloads. The company has three gravel warehouses located in three different places. Warehouse 1 has 158 truckloads available, warehouse 2 has 184, and warehouse 3 has 179. The cost of transportation from the warehouse to the projects are: from warehouse 1 to Projects A, B, C = Php 4, Php 8, Php 8 per truckload respectively. From warehouse 2 to Projects A, B, C = Php 16, Php 24, Php 16 per truckload respectively. From warehouse 3 to Projects A, B, C = Php 8, Php 16, Php 24 per truckload respectively. The objective is to design a plan of distribution that will Minimize the cost of transportation.
Jim Jones manufactures inexpensive set-it-up-yourself furniture for students. He currently makes two products – bookcases and tables. Each bookcase contributes $24 to profit, and each table, $20. Each product passes through two manufacturing points, cutting and finishing. Bookcases take 4 hours a unit in cutting and 4 hours in finishing. Tables require 3 hours a unit in cutting and 5 in finishing. There are currently 40 hours available in cutting and 50 in finishing. Determine the optimum solution. Use graphic linear programming to find the product mix that produces the maximum profit for Jim.
Solve the following problems using Excel Solver or R Studio. If the network on the left will be represented as a matrix in an MS Excel spreadsheet on the right, identify the specific cell inthe spreadsheet where will each arc weight should be plotted.
The starting node of the shortest path problem has a supply out flow value of -1 in the LP model. True False (Don't hand writing solution)
Suppose the total flow into a node of a network isrestricted to 10 units or less. How can we represent thisrestriction via an arc capacity constraint? (This still allowsus to use the Ford–Fulkerson method to find the maximumflow.)
The Green Cab Company has a taxi waiting ateach of four cabstands in Evanston, Illinois. Four customershave called and requested service. The distances, in miles, fromthe waiting taxis to the customers are given in the followingtable. Find the optimal assignment of taxis to customers so asto minimize total driving distances to the customers.
. A refiner in city Q serves four customers near city W and maintains consignment inventory (owned by the refiner) at each location. Currently, the refiner uses TL (truckload) transportation to deliver separately to each customer. Each truck costs $(759) plus $(309) per stop. The refiner is considering aggregating deliveries to city W on a single truck. The demand of the first customer is 75 tons a year, the demand of the second customer is 30 tons per year, and the demand of the third and fourth customers is 10 tons per year. The product cost is $8,000 per ton, and it uses a holding cost of (24)%. The truck capacity is 20 tons. a. What is the optimal delivery policy to each customer if the refiner ships separately to each of them? What is the annual total inventory-related cost? b. What is the optimal delivery policy to each customer if the refiner aggregates shipments to each of the four customers on every truck that goes to city W? What is the annual total inventory-related cost?…
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…
Tech, with a student population of 30,000, is located in a small college town in Virginia. DirectCast Cable TV has a small service staff that is sufficient to handle installations and TV hookups for almost the entire year. However, for the month-long period right before and during the beginning of fall semester in August, when all the students return, the cable TV service is overwhelmed and must bring in an additional 14 technicians from other company offices. The DirectCast offices in the following seven cities have available service technicians to loan, as shown: City Available Technicians Distance (mi.) Cost ($) Richmond 4 211 3,400 Charlotte 3 173 3,920 Atlanta 5 410 4,760 Greensboro 2 152 3,560 DC 6 263 4,980 Nashville 3 414 4,050 Norfolk 2 302 3,240 This table also shows the distances (in miles) from the cities to the town where Tech is located, and the cost for relocating a technician for 1…
Find Optimal solution for this example (loop) ? ( NOT Initial basic feasible solution )