Study Of The Primal-Dual Interior-Point Algorithm For Optimization Problem And Application In The Area Of Venture Investment

This paper is based on a detailed study and development concerning the Primal-Dual Interior-Point Algorithm by a project named Asset Allocation for Global Active Operations which I participate in at certain MultiNational Corporation. The Primal-Dual Interior-Point Algorithm is one of the high-efficiency algorithm for solution of large-scale linear optimization problems. It in a more excellent way solves the problem that computational efficiency would become very lower by simplex when the variants are increased quickly. The purpose of this paper is to prove the excellent computed performance of Primal-Dual Interior-Point Algorithm, and apply it in the area of Venture Investment. Consequently, this paper would provide a reference for the application in other areas of this algorithm. Above all, this paper contrasts the simplex and Primal-Dual Interior-Point Algorithm, and shows the character of Primal-Dual Interior-Point Algorithm, and proves that the time complexity of this Algorithm is polynomial time, and then the convergence of the algorithm is proved. Secondly, based on Asset Allocation for Global Active Operations, experiments are designed, and detailed analysis to the experimental results is given by means of computed efficiency and exactness of investment, in which the advantage of this algorithm is showed. Finally, according to the bottleneck of Primal-Dual Interior-Point Algorithm, corresponding solution is given. And the application of this algorithm in the future is prospected.