讨论从m个公司中选出k(0〈k〈min{m,n})个公司去投资n个项目中的k项使总收益最大的非均衡投资问题,证明了增加反点数目与非均衡投资问题系数矩阵的维数之间的关系,及反点所具有的相关性质和重要结论。提出了解决非均衡投资收益极大指派问题的反点算法,此算法通过增加反点,提高非均衡投资问题系数矩阵的维数,从而使讨论的问题变得容易处理。与传统的解决非均衡投资收益指派问题的匈牙利法相比有较大改进。为解决非均衡投资极大指派问题提供了新思路、新方法。同时,将提出的算法应用于5个公司和4个投资项目的非均衡投资问题,实验结果验证了所提出方法的科学性和有效性。
In this paper,we discuss the maximum of total income investment assignment problem in which the real assigned companies are less than or equal to both the total projects and the total companies.The relationship between the number of increasing reserve points and the dimension of coefficient matrix has been proved and some properties and conclusions have been presented.We proposed the reserve points algorithm to solve the imbalance income investment assignment problem.It becomes easy when increase the reserve points and improve the dimension of coefficient matrix.There are significant improvements comparing with traditional Hungary algorithm.The proposed method provides a new idea for imbalance income investment assignment problem.At the same time,we demonstrate the quality of proposed method by using real-world data of five companies and four investment projects.The obtaining experimental results qualify the effectiveness of the proposed approach.