A Solution Procedure for Minimum Convex-Cost Network Flow Problems

§ Stamford University Bangladesh

Send Message

To: Author

A Solution Procedure for Minimum Convex-Cost Network Flow Problems

Article Fingerprint

ReserarchID

3Y6AB

A Solution Procedure for Minimum Convex-Cost Network Flow Problems Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

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.

References

5 Cites in Article
  1. 1. Mokhtar Bazaraa,Hanif Sherali,C Shetty (2006). Nonlinear Programming. Nonlinear Programming
  2. 2. W Hisa (1975). Decomposition of the Convex Simplex Method. Journal of Optimization Theory and Application, 16(5/6), 399-407.
  3. 3. W Hsia (1973). Decomposition in Nonlinear Programming. Decomposition Techniques in Mathematical Programming, 187-242.
  4. 4. I Zangwill (1967). The Convex Simplex Method. Management Science, 14(3), 221-238.
  5. 5. (2012). A Solution Procedure for Minimum Convex-Cost Network Flow Problems. A Solution Procedure for Minimum Convex-Cost Network Flow Problems, 30

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. Dewan Ferdous Wahid, Farjana Habiba, Ganesh Chandra Ray. 2012. "A Solution Procedure for Minimum Convex-Cost Network Flow Problems". Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 12 (GJSFR Volume 12 Issue F10).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords
Classification
GJSFR-F Classification MSC 2010: 91B32
Version of record

v1.2

Issue date
September 3, 2012

Language
English
Order Article Reprint
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 1.7K
Total Downloads: 125
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Solution Procedure for Minimum Convex-Cost Network Flow Problems

Dr. Wahid
Dr. Wahid Stamford University Bangladesh
Farjana Habiba
Farjana Habiba
Ganesh Ray
Ganesh Ray