Moolman, W. H. (2020) The Maximum Flow and Minimum Cost–Maximum Flow Problems: Computing and Applications. Asian Journal of Probability and Statistics, 7 (3). pp. 28-57. ISSN 2582-0230
![[thumbnail of Moolman732020AJPAS55184.pdf]](http://journal.article2publish.com/style/images/fileicons/text.png)
Moolman732020AJPAS55184.pdf - Published Version
Download (922kB)
Abstract
The maximum flow and minimum cost-maximum flow problems are both concerned with determining flows through a network between a source and a destination. Both these problems can be formulated as linear programming problems. When given information about a network (network flow diagram, capacities, costs), computing enables one to arrive at a solution to the problem. Once the solution becomes available, it has to be applied to a real world problem. The use of the following computer software in solving these problems will be discussed: R (several packages and functions), specially written Pascal programs and Excel SOLVER. The minimum cost-maximum flow solutions to the following problems will also be discussed: maximum flow, minimum cost-maximum flow, transportation problem, assignment problem, shortest path problem, caterer problem.
Item Type: | Article |
---|---|
Subjects: | Universal Eprints > Mathematical Science |
Depositing User: | Managing Editor |
Date Deposited: | 18 Mar 2023 06:57 |
Last Modified: | 02 Mar 2024 04:15 |
URI: | http://journal.article2publish.com/id/eprint/1533 |