A New Algorithm for Bottleneck Transportation Problem

Abstract

We have considered Bottleneck Transportation problem. These problem has significant importance in military operation and catastrophe situation, in both cases time factor very important for supplying amenities/ essential commodities to the destination point. Bottleneck Transportation Problem mathematically formulated with usual type of transportation constraints. We have designed an algorithm to find the optimal solution, numerical examples are illustrated and comparative study has been given. The paper has significant implication in other verity of Linear Programming Problem, for example minimax and maximin assigned problems. It has also significant implication in present day e-commerce, cargo loading and delivery in air transport.