Possibilistic linear programming in blending and transportation planning problem

Abstract

This paper presents a possibilistic linear programming model for solving the blending and multi-mode, multi-period distribution planning problem with imprecise transportation, blending and storage costs. The solution procedure uses the strategy of simultaneously minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining lower total costs, minimizing the risk of obtaining higher total costs. An illustration with a data set from a realistic situation is included to demonstrate the effectiveness of the proposed model. © Springer-Verlag Berlin Heidelberg 2007.