Exam 24: Transportation Models

A transportation problem has 10 origins and 32 destinations.How many possible routes are there for this problem? What is the maximum number of routes that will be used in the optimal solution?

When using the stepping-stone method for a minimization problem,the number of units that reallocates corresponds to the smallest number found in the cells containing minus signs.

A transportation model uses no more than 5% of its cells.If the number of destinations is 1000,determine the number of sources in the model.

For the transportation problem below,construct an initial feasible solution using the intuitive method.

A manufacturer of semiconductor "wafers" has been attempting to convert its operations to practices more in keeping with JIT principles.The firm is now paying much more attention to the transit time between one processing stage and the next.The plant has a somewhat haphazard pattern of machine locations,partly because the machines were purchased and installed at different times,partly from a shortage of floor space,and partly from previous experiments with work cells.The bottom line is this: there are four machines that perform a certain processing phase,and three machines that perform the next phase.All units of a large class of wafers go through these two phases.The table below displays the transit time,in minutes,from each machine of the first phase to each machine of the second.Machine 3 is not really 100 minutes away from machine B;the company has prohibited that combination because of quality problems associated with that specific pairing.Supply and demand quantities are in wafers processed per week.Develop a transit time minimizing solution for this firm.What is the total transit time of this solution? Which machines are fully utilized? Which machines have some capacity unused or requirements unfilled? Was the prohibition on the 3-B combination honored?

The number of routes filled by a solution to a transportation problem is no larger than ________.

A transportation problem has 4 origins and 2 destinations.The optimal solution of this problem will fill no more than ________ cells with quantities to be shipped.

The stepping-stone method:

When using the stepping-stone method,the closed path sometimes has the shape of a triangle as diagonal moves are permitted.