Consider the following transshipment network for finding the shortest route from node 1 to node 7.Mins.t.Node 1 FlowsNode 2 FlowsNode 3 FlowsNode 4 FlowsNode 5 Flows(a) Formulate a linear programming model of the problem. (Express your answers using Xi where each X;; is either 0 or 1 for the arc from node i to node j.)Node 6 FlowsNode 7 Flows9For all X₁, = 0, 1.18w34567 (b) Find the shortest route from node 1 to node 7 in the network shown. (Enter your answers as a comma-separated list.)path= 1,7

A transhipment problem is given below:

Answered: Consider the following transshipment…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section5.4: Other Logistics Models

Problem 24P

See similar textbooks

Similar questions

Draw the network for this transportation problem. (Let xij represent the flow from node i to node j.) Min 2x13 + 4x14 + 6x15 + 8x23 + 11x24 + 9x25 s.t. x13 + x14 + x15 ≤ 500 x23 + x24 + x25 ≤ 400 x13 + x23 = 300 x14 + x24 = 300 x15 + x25 = 300 xij ≥ 0
Maximal Flow a. Write the linear program for this problem. b. Create a spreadsheet model to find the maximal flow from node 1 to 6
In the original Gorman Construction Company problem, we found the shortest distance from the office (node 1) to the construction site located at node 6. Because some of the roads are highways and others are city streets, the shortest-distance routes between the office and the construction site may not necessarily provide the quickest or shortest-time route. Shown here is the Gorman road network with travel time rather than distance. 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.
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
9-43. Northwest University is in the process of complet-ing a computer bus network that will connect com-puter facilities throughout the university. The prime objective is to string a main cable from one endof the campus to the other (nodes 1–25) throughunderground conduits. These conduits are shownin the network below; the distance between them isin hundreds of feet. Fortunately, these undergroundconduits have remaining capacity through which thebus cable can be placed.(a) Given the network for this problem, how long (inhundreds of feet) is the shortest route from node1 to node 25?(b) In addition to the computer bus network, a newphone system is also being planned. The phonesystem would use the same underground conduits. If the phone system were installed, the follow-ing paths along the conduit would be at capacity and would not be available for the computer busnetwork: 6–11, 7–12, and 17–20. What changes(if any) would you have to make to the pathused for the computer bus if the phone…
NEED ALL 1. Nodes with only outflows (total outflows <= capcity) 2. Nodes with only inflows (total inflows >= demand) 3. Nodes with both outflows and inflows (total outflows = total inflows) 4. Network structure and flows (List of arcs in the network by (Origin, Destination) 5. Objective to minimize
a. set up the transportation tableau for this problem, determine the initial solution using VAM and compute total cost b. solve using MODI c. are there multiple optimal solition? explain, if there are alternative solution, identify them d. formulate this problem as a linear programming model
Consider above problem. Suppose that the weight of facility 2 is 20. Applying the median method, it can be verified that the optimal location is (10, 10) - the centroid of department 2, where immovable structures exist. It is now desired to find a feasible and “near-optimal” location using the contour line method.
Continuing the previous problem, suppose again thatall arcs go in both directions, but suppose Maude’sobjective is to find the shortest path from node 1 tonode 7 (not node 10). Modify the spreadsheet modelappropriately and solve.
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.
Suppose the company has received a proposal for setting up another warehouse(Warehouse E) with a capacity of 900 units. The location of the warehouse is such thatthe unit costs of transporting to the six cities are as follows: Hyderabad–45, Mysore–75, Chennai–30, Kochi–65, Pune–90 and Vizag–80. The company would like to knowhow the allocation will change if the warehouse is made operational and the likely costimpact on the operation of the system. After balancing above table by which method we should solve this problem
A truck driver has to deliver a load of lumber to oneof two construction sites, which are, respectively, 27 and 33 miles from the lumberyard, but he has misplaced theorder telling him where the load of lumber should go. The two construction sites are 12 miles apart, and, to compli-cate matters, the telephone at the lumberyard is out of order. Where should he go first if he wants to minimizethe distance he can expect to drive and he feels that(a) the odds are 5 to 1 that the lumber should go to theconstruction site that is 33 miles from the lumberyard;(b) the odds are 2 to 1 that the lumber should go to theconstruction site that is 33 miles from the lumberyard;(c) the odds are 3 to 1 that the lumber should go to theconstruction site that is 33 miles

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS