Professional Documents
Culture Documents
5-1. The transportation model is an example of decision making under certainty since the costs of each
shipping route, the demand at each destination, and the supply at each source are all assumed to be known
with certainty.
5-2. A balanced transportation problem is one in which total demand (from all destinations) is exactly equal
to total supply (from all sources). If a problem is unbalanced, either the demand or the supply constraints
must be inequalities.
5-3. The enumeration method is not a practical means of solving 5 x 5 or 7 x 7 problems because of the
number of possible assignments to be considered. In the 5 x 5 case, there are 5! = (5 x 4 x 3 x 2 x 1) = 120
alternatives that need to be evaluated. In the 7 x 7 case, there are 7! = 5,040 alternatives.
5-4. The minimal-spanning model is one that will find the best way to connect all the nodes in a network
together while minimizing the total distance between nodes or the total cost of connecting the nodes
together. A number of decision modeling problems can be solved using this model: an example was given
connecting water and power to a real estate development project. This model can also be used to determine
the best way to deliver cable TV to households, connect computers on a computer network, install an oil
pipeline, develop a natural gas network, and more.
5-5. The maximal-flow model can be used to determine the maximum number of cars that can flow through
a road system, the number of gallons of chemicals that can flow through a chemical processing plant, the
barrels of oil that can go through a pipeline network, the number of people that can use public transportation
to get to work, the number of pieces of mail that can go through a mail service, and more. Any time that
material or items flow through a network, the maximal-flow model can be used.
5-6. The shortest-path model can be used to find the best way to install a phone cable between two major
cities. Any time items must be moved from one place to another or something, like a cable, must be used
to connect two points, the shortest-path model can be used.
5-7. A flow balance constraint calculates the net flow at a node (that is, the difference between the total
flow on all arcs entering the node and the total flow on all arcs leaving the node). At each source node, the
net flow is expressed as a negative quantity, and represents the amount of flow created at the node. At each
destination node, the net flow is expressed as a positive quantity, and represents the amount of flow
consumed at the node. At each pure transshipment node, the net flow is zero.
5-8. To set up a maximal-flow problem as an LP problem, we create a unidirectional dummy arc going
from the destination node to the source node, and set the capacity of this arc at infinity.
5-9. For many network models, the number of arcs (each of which corresponds to a decision variables)
could be quite large. It may therefore be convenient to model these problems in Excel in such a way that
decision variables are in a tabular form. For example, rows in the table could denote starting nodes for the
arcs, and columns could denote ending nodes.
5-10. To specify the entire table as the Changing Cells in Solver for a maximal-flow network model, we
assign a capacity of zero for all arcs that do not actually exist. This will prevent any flow on those arcs.
5-11. To specify the entire table as the Changing Cells in Solver for a shortest-path network model, we
assign a unit flow cost of infinity (or some arbitrarily high number) for all arcs that do not actually exist.
This will prevent any flow on those arcs.
Another random document with
no related content on Scribd:
1.F.3, the Project Gutenberg Literary Archive Foundation, the owner
of the Project Gutenberg™ trademark, and any other party
distributing a Project Gutenberg™ electronic work under this
agreement, disclaim all liability to you for damages, costs and
expenses, including legal fees. YOU AGREE THAT YOU HAVE NO
REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF
WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE
FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.
1.F.4. Except for the limited right of replacement or refund set forth in
paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO
OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.
Please check the Project Gutenberg web pages for current donation
methods and addresses. Donations are accepted in a number of
other ways including checks, online payments and credit card
donations. To donate, please visit: www.gutenberg.org/donate.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.