LIMITATION AND MODIFICATION: ON A COST PIPELINE TRADE-OFF IN A TRANSPORTATION PROBLEM

Abstract

The present paper attempts to foreground a modified approach to the algorithm as conceived by Sharma et al. [1] in the paper entitled ’A cost and pipeline trade-off in a transportation problem’. In 2013, Sharma et al. [1] came up with an idea of pivotal time and consequentially evolved a convergent algorithm to determine cost pipeline trade off pairs corresponding to the chosen pivotal time. We have observed one limitation of the proposed algorithm which directly affects the global minimum character of the pipeline. In the present paper, we suggest a modification of the limitation found in the procedural formulation developed by Sharma et al. [1].

Keywords: Transportation problem, Combinatorial optimization, Bottleneck transportation problem, Bi-criteria transportation problem, Efficient points.