虚拟企业管理中的伙伴选择问题:模型与理论分析  

On Partner Selection Problem in the Virtual Enterprise Management: Model and Theoretical Analysis

作　　者：李乃成[1] 靖稳峰[1] 徐宗本[1] 

机构地区：[1]西安交通大学理学院,西安710049

出　　处：《运筹学学报》2005年第2期68-74,共7页Operations Research Transactions

摘　　要：本文建立了虚拟企业伙伴选择问题的整数规划模型,并从理论上证明了该类问题正规解的存在性.所获结果对于该类问题的研究与求解提供了可靠的理论依据,并将建立的模型和所得结论应用到一个工程实际问题,采用遗传算法求解,取得了满意的计算结果.In this paper, an integer programming model is proposed on partner selection problem (PSP) in virtual enterprise management. It is proved that there exists a normal solution to the PSP. The result obtained provides the reliable model and theoretical basis to the analysis and computation of a concrete PSP. By applying the model established to a practical project, a satisfactory computing result is acquired by using the genetic algorithm.

关 键 词：选择问题 企业管理 伙伴 整数规划模型 解的存在性 虚拟企业 实际问题 遗传算法 计算结果 求解 正规 

分 类 号：O175.15[理学—数学] TP301.6[理学—基础数学]