Exam 10: Distribution Network Models

Canning Transport is to move goods from three factories to three distribution centers.Information about the move is given below.Give the network model and the linear programming model for this problem. ​ Source Supply Destination Demand 200 50 100 125 150 125 Shipping costs are: ​

A dummy origin in a transportation problem is used when supply exceeds demand.

In a transportation problem with total supply equal to total demand,if there are four origins and seven destinations,and there is a unique optimal solution,the optimal solution will utilize 11 shipping routes.

Show both the network and the linear programming formulation for this assignment problem. ​ ​

​How is the shortest-route problem like the transshipment problem?

Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city.When represented with a network,

Which of the following is not true regarding an LP model of the assignment problem?

The shortest-route problem finds the shortest-route

In the general assignment problem,one agent can be assigned to several tasks.

Whenever total supply is less than total demand in a transportation problem,the LP model does not determine how the unsatisfied demand is handled.

Consider the following shortest-route problem involving six cities with the distances given.Draw the network for this problem and formulate the LP for finding the shortest distance from City 1 to City 6. Path Distance 1 to 2 3 1 to 3 2 2 to 4 4 2 to 5 5 3 to 4 3 3 to 5 7 4 to 6 6 5 to 6 2

The objective of the transportation problem is to

​How is the assignment linear program different from the transportation model?

The parts of a network that represent the origins are

A professor has been contacted by four not-for-profit agencies that are willing to work with student consulting teams.The agencies need help with such things as budgeting,information systems,coordinating volunteers,and forecasting.Although each of the four student teams could work with any of the agencies,the professor feels that there is a difference in the amount of time it would take each group to solve each problem.The professor's estimate of the time,in days,is given in the table below.Use the computer solution to see which team works with which project. ASSIGNMENT PROBLEM ************************

The assignment problem is a special case of the transportation problem in which all supply and demand values equal one.

Peaches are to be transported from three orchard regions to two canneries.Intermediate stops at a consolidation station are possible. ​ Orchard Supply Station Cannery Capacity Riverside 1200 Waterford Sanderson 2500 Sunny Slope 1500 Northside Millville 3000 Old Farm 2000 Shipment costs are shown in the table below.Where no cost is given,shipments are not possible.Where costs are shown,shipments are possible in either direction.Draw the network model for this problem. Riverside 1 5 3 Sunny Side 4 5 Old Farm 6 3 Waterford 2 2 4 Northside 5 9 Sanderson 2 Millville

Draw the network for this assignment problem. Min 10+12+15+25+11+14+19+32 +18+21+23+29+15+20+26+28 s.t. +++=1 +++=1 +++=1 +++=1 +++=1 +++=1 ++C+=1 +++=1

Consider a shortest route problem in which a bank courier must travel between branches and the main operations center.When represented with a network,

The network below shows the flows possible between pairs of six locations.Formulate an LP to find the maximal flow possible from Node 1 to Node 6. ​