|
|
 |
|
Network
Flow Programming
 |
 |
|
Network
Flow
|
|
|
|
|
|
Network
Flow Programming
|
|
|
 |
The term network flow program describes a
type of model that is a special case of the more general
linear program. The class of network flow programs includes
such problems as the transportation problem, the assignment
problem, the shortest path problem, the maximum flow problem,
the pure minimum cost flow problem, and the generalized
minimum cost flow problem. It is an important class because
many aspects of actual situations are readily recognized
as networks and the representation of the model is much
more compact than the general linear program. When a situation
can be entirely modeled as a network, very efficient algorithms
exist for the solution of the optimization problem, many
times more efficient than linear programming in the utilization
of computer time and space resources. Network models are
constructed by the Math
Programming add-in and may be solved by either the Excel
Solver, Jensen
LP/IP Solver or the Jensen
Network Solver. |
|
|
