Fuzzy Transportation Problem by Using Triangular, Pentagonal and Heptagonal Fuzzy Numbers With Lagrange's Polynomial to Approximate Fuzzy Cost for Nonagon and Hendecagon

The transportation problem is a main branch of operational research and its main objective is to transport a single uniform good which are initially stored at several origins to different destinations in such a way that the total transportation cost is minimum. In real life applications, available supply and forecast demand, are often fuzzy because some information is incomplete or unavailable. In this article, the authors have converted the crisp transportation problem into the fuzzy transportation problem by using various types of fuzzy numbers such as triangular, pentagonal, and heptagonal fuzzy numbers. This article compares the minimum fuzzy transportation cost obtained from the different method and in the last section, the authors introduce the Lagrange's polynomial to determine the approximate fuzzy transportation cost for the nanogon (n = 9) and hendecagon (n = 11) fuzzy numbers.