ISSN: 2995-5823

Volume 1, Number 1 (2016)

Year Launched: 2016

Journal Menu

■ About The Journal

■ Aims & Scope

■ Editorial Board

■ Article Processing Charge

■ Archive

Previous Issues

■ Volume 9, Number 2 (2024)

■ Volume 9, Number 1 (2024)

■ Volume 8, Number 5 (2023)

■ Volume 8, Number 4 (2023)

■ Volume 8, Number 3 (2023)

■ Volume 8, Number 2 (2023)

■ Volume 8, Number 1 (2023)

■ Volume 7, Number 6 (2022)

■ Volume 7, Number 5 (2022)

■ Volume 7, Number 4 (2022)

■ Volume 7, Number 3 (2022)

■ Volume 7, Number 2 (2022)

■ Volume 7, Number 1 (2022)

■ Volume 6, Number 6 (2021)

■ Volume 6, Number 5 (2021)

■ Volume 6, Number 4 (2021)

■ Volume 6, Number 3 (2021)

■ Volume 6, Number 2 (2021)

■ Volume 6, Number 1 (2021)

■ Volume 5, Number 5 (2020)

■ Volume 5, Number 4 (2020)

■ Volume 5, Number 3 (2020)

■ Volume 5, Number 2 (2020)

■ Volume 5, Number 1 (2020)

■ Volume 4, Number 6 (2019)

■ Volume 4, Number 5 (2019)

■ Volume 4, Number 4 (2019)

■ Volume 4, Number 3 (2019)

■ Volume 4, Number 2 (2019)

■ Volume 4, Number 1 (2019)

■ Volume 3, Number 3 (2018)

■ Volume 3, Number 2 (2018)

■ Volume 3, Number 1 (2018)

■ Volume 2, Number 3 (2017)

■ Volume 2, Number 2 (2017)

■ Volume 2, Number 1 (2017)

■ Volume 1, Number 2 (2016)

■ Volume 1, Number 1 (2016)

On out of kilter algorithm

Volume 1, Issue 1, October 2016 | PP. 140-144 | PDF (371 K) | Pub. Date: November 17, 2016
DOI: 457 Downloads 4766 Views

Author(s)

Dariush Akbarian, Department of Mathematics, Arak Branch, Islamic Azad University, Arak, Iran

Abstract
The out-of-kilter algorithm is one of the basic algorithms that solve the minimum cost flow problem. The aim of this paper is to shows that if the dual of out of kilter formulation has optimal solution then it has integer optimal solution too

Keywords
Network flow, Minimum cost network flow

Cite this paper
Dariush Akbarian, On out of kilter algorithm , SCIREA Journal of Mathematics. Volume 1, Issue 1, October 2016 | PP. 140-144.

References

[ 1 ]	D.R. Fulkerson, ”An out-of-kilter method for solving minimal cost flow problems”, Journal of the Society for Industrial and Applied Mathemetics,. 9, 18-27. 1961.
[ 2 ]	L.R. Ford, Jr. and D. Fulkerson, Flows in networks (Princeton University Press, Princeton,N.J., 1962) pp. 194.
[ 3 ]	W.L. Price, Graphs and networks: An introduction (Auerbach, Princeton, N.J., 1971).
[ 4 ]	M. Bazaraa, C.M. Shetty, Linear Programmingand Network Flows, John Wiley & Sons,