Application of Bounded Variable Simplex Algorithm in Solving Maximal Flow Model

Authors

  • Sohana Jahan
  • Marzia Yesmin
  • Fatima Tuj Jahra

Keywords:

Maximal Flow Model, Bounded Variable simplex method

Abstract

In this paper, A comparative study is made on the determination of maximum flow in a network by Maximal Flow Algorithm and Bounded Variable Simplex Method. We have introduced a technique to find the route of a flow in any iteration of the bounded variable simplex algorithm.

Downloads

Issue

Vol. 61 No. 1 (2013)

Section

Articles