Chapter 06 – Network Optimization Problems
6-1
1. Network representations can be used for financial planning.
2. A network representation is a very specific conceptual aid and is only used in special
cases.
3. All network optimization problems actually are special types of linear programming
problems.
4. Minimum cost flow problems are the special type of linear programming problem referred
to as distribution-network problems.
5. A minimum cost flow problem may be summarized by drawing a network only after
writing out the full formulation.
6. The model for any minimum cost flow problem is represented by a network with flow
passing through it.
Chapter 06 – Network Optimization Problems
29. A network model showing the geographical layout of the problem is the usual way to
represent a shortest path problem.
30. Shortest path problems are concerned with finding the shortest route through a network
31. In a shortest path problem, the lines connecting the nodes are referred to as arcs.
32. In a shortest path problem there are no arcs permitted, only links.
33. A shortest path problem is required to have only a single destination.
34. When reformulating a shortest path problem as a minimum cost flow problem, each link
should be replaced by a pair of arcs pointing in opposite directions.
Multiple Choice Questions
35. Network representations can be used for the following problems:
