Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A New Procedure to get Minimal Cost in Transportation Problems

P. Sumathi1, C.V. Sathiya Bama1
1Department of Mathematics Bharath Institute of Higher Education and Research Chennai – 600073, Tamilnadu, India.
  • Published: 25/02/2020

Abstract

Transportation Problem (TP) is the exceptional case to obtain the minimum cost. A new hypothesis is discussed for getting minimal cost in transportation problem in this paper and also Vogel’s Approximation Method (VAM) and MODI method are analyzed with the proposed method. This approach is examined with various numerical illustrations.

Keywords: Transportation Problem, Initial Basic Feasible Solution (IBFS), Minimal Cost
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
P. Sumathi, C.V. Sathiya Bama. A New Procedure to get Minimal Cost in Transportation Problems[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 112. -. DOI: .