【摘要】 针对一类组合优化问题中多维 0 -1背包问题 (MKP) ,给出一种能减少求解难度的方法 :不等式单约束生成法 ;定义了MKP的紧约束概念 ,指出MKP也是一个NP -难问题 ;提出了一种代替多约束组的计算方法 ,并证明了经过替换后所得到的新问题与原问题在解精度上的等价性 .更多还原

【Abstract】 In this paper, it lodged a method of reducing the solving difficulty--the creative method of non-equivalence single restrict, aim at a kind of combination and optimize problem-multi-dimension 0-1 knapsack problem(also called the NP-hard problem). It defined the tightness restrictive conception of this problem, and lodged a calculation method of replacing a restrict group with a single restrict condition. It proved the equivalence property of solution precision between original problem and new problem that be replaced.更多还原