A Multi-objective Interval Programming Approach for Vendor Selection Problem in a Supply Chain

摘要

Effect of information uncertainty in solving a Vendor Selection Problem (VSP) poses some difficulty that is addressed in this paper. VSP is modeled as a multi-objective mixed integer programming problem with interval objective coefficients. For decision maker's preference, the uncertain parameters of the objectives are represented between the intervals, by the left limit, the right limit, the center and the width of an interval. The solution of the model is given as the pareto optimal solution, which provides the quota allocation to the selected vendors against the worst case and the average case respectively. An illustrative example is included to demonstrate the effectiveness of the proposed model.