A Solution Procedure for Minimum Convex-Cost Network Flow Problems

Authors

  • Dr. Dewan Ferdous Wahid

  • Farjana Habiba

  • Ganesh Chandra Ray

Convex, Convex Simplex Method, directed network, Karush-Kuhn-Tucker conditions, Network Flow, Network Simplex Method, node-arc-incidence matrix

Abstract

This paper presents a procedure to solve Minimum Convex-Cost Network Flow Problems (MC-CNFP). This solution algorithm is constructed on the concepts of Network Simplex Method (NSM) for minimum cost network flow problem, Convex Simplex Method (CSM) of Zangwill, the decomposition of convex simplex method and non-linear transformation problem.

Downloads

How to Cite

A Solution Procedure for Minimum Convex-Cost Network Flow Problems. (2012). Global Journal of Science Frontier Research, 12(F10), 23-30. https://journalofscience.org/index.php/GJSFR/article/view/100375

 

References

Mokhtar Bazaraa, Hanif Sherali, C Shetty (2006) Nonlinear Programming.

W Hisa (1975) Decomposition of the Convex Simplex Method. 16(5/6), 399-407.

W Hsia (1973) Decomposition in Nonlinear Programming. 187-242.

I Zangwill (1967) The Convex Simplex Method. 14(3), 221-238.

(2012) A Solution Procedure for Minimum Convex-Cost Network Flow Problems. 30.

A Solution Procedure for Minimum Convex-Cost Network Flow Problems

Published

2012-09-03

Issue

Vol. 12 No. F10 (2012): GJSFR-F Mathematics: Volume 12 Issue F10

Section

Articles

License

Copyright (c) 2012 Authors and Global Journals Private Limited

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

A Solution Procedure for Minimum Convex-Cost Network Flow Problems. (2012). Global Journal of Science Frontier Research, 12(F10), 23-30. https://journalofscience.org/index.php/GJSFR/article/view/100375