Introduction - If you have any usage issues, please Google them yourself
To solve the multi2vendor selection p roblem in a multi2p roduct supp ly chain, an
op timization mode was constructed with the lowest composite cost taken as the objective function and
with necessary constraints. A decomposing algorithm was used to overcome the difficulty in solving the
model. The original model was transformed into an integer p rogramming model. Based on different
iteration p rocedure, two algorithms were p resented. The model and algorithms were app lied in a
numeral examp le, and an op timized assignment of the p roducts was obtained. The p roposed method
overcomes the limitation in the conventional vendor evaluation models where only single p roduct or
single vendor is considered.