Exam 6: Distribution and Network Models

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.

In a transportation problem,excess supply will appear as slack in the linear programming solution.

If a transportation problem has four origins and five destinations,the LP formulation of the problem will have nine constraints.

Write the linear program for this transshipment problem.

Draw the network for this transportation problem.

The network flows into and out of demand nodes are what makes the production and inventory application modeled in the textbook a

Consider the network below.Formulate the LP for finding the shortest-route path from node 1 to node 7.​

If a transportation problem has four origins and five destinations,the LP formulation of the problem will have

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

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

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.​

A foreman is trying to assign crews to produce the maximum number of parts per hour of a certain product.He has three crews and four possible work centers.The estimated number of parts per hour for each crew at each work center is summarized below.Solve for the optimal assignment of crews to work centers.

The difference between the transportation and assignment problems is that

Constraints in a transshipment problem

The maximal flow problem can be formulated as a capacitated transshipment problem and determines the maximum amount of flow (such as messages,vehicles,fluid,etc.)that can enter and exit a network system in a given period of time.

A transportation problem with three sources and four destinations will have seven variables in the objective function.

After some special presentations,the employees of AV Center have to move projectors back to classrooms.The table below indicates the buildings where the projectors are now (the sources),where they need to go (the destinations),and a measure of the distance between sites. ​

Flow in a transportation network is limited to one direction.

In a transshipment problem,shipments

Transshipment problems allow shipments both in and out of some nodes,while transportation problems do not.