A Solution Procedure for Minimum Convex-Cost Network Flow Problems

1
Dr. Dewan Ferdous Wahid
Dr. Dewan Ferdous Wahid
2
Farjana Habiba
Farjana Habiba
3
Ganesh Chandra Ray
Ganesh Chandra Ray
1 Stamford University Bangladesh

Send Message

To: Author

GJSFR Volume 12 Issue F10

Article Fingerprint

ReserarchID

3Y6AB

A Solution Procedure for Minimum Convex-Cost Network Flow Problems Banner
  • 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

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.

5 Cites in Articles

References

  1. Mokhtar Bazaraa,Hanif Sherali,C Shetty (2006). Nonlinear Programming.
  2. W Hisa (1975). Decomposition of the Convex Simplex Method.
  3. W Hsia (1973). Decomposition in Nonlinear Programming.
  4. I Zangwill (1967). The Convex Simplex Method.
  5. (2012). A Solution Procedure for Minimum Convex-Cost Network Flow Problems.

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.

Dr. Dewan Ferdous Wahid. 2012. \u201cA Solution Procedure for Minimum Convex-Cost Network Flow Problems\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 12 (GJSFR Volume 12 Issue F10): .

Download Citation

Issue Cover
GJSFR Volume 12 Issue F10
Pg. 23- 30
Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Classification
Not Found
Version of record

v1.2

Issue date

September 3, 2012

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 5133
Total Downloads: 2610
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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. Dewan Ferdous Wahid
Dr. Dewan Ferdous Wahid Stamford University Bangladesh
Farjana Habiba
Farjana Habiba
Ganesh Chandra Ray
Ganesh Chandra Ray

Research Journals