说明：  为解决供应链中多品种供应的多供应商选择问题,建立了以供应综合成本最低为目标函数、满足多个约 束条件的组合优化模型. 为解决求解的困难,采用变换分解算法,将原模型转换为整数规划问题. 根据不同迭代 方式,给出了2种基本运算步骤1在算例中运用模型和算法,得到了多物资供应环境下多供应商的最优任务分 派1新方法克服了常规供应商的选择评价方法只针对单一物资供应过程和面向单一供应商选择过程的局限性.
(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.)