J4

Previous Articles     Next Articles

Homotopy-interior Point Algorithm for Solving Set of Effective Solutions of Double-objective Convex Programming

YANG Yi-hua1, LV Xian-rui1, LIU Qing-huai1, ZHENG Zhi-ying2   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China; 2. Educational and Technical Centre, Beihua University, Jilin 132000, Jilin Province, China
  • Received:2005-04-11 Revised:1900-01-01 Online:2006-01-26 Published:2006-01-26
  • Contact: LV Xian-rui

Abstract: We have solved double-objective convex programming by means of homotopy-interior point algorithm. Not only the efficient(weak efficient) solutions but also the set of all efficient(weak efficient)solutions can be obtained by this method. We have also proved the global convergence of this homotopy-interior point algorithm. Moreover, the results of the numeric examples show that this method is feasible and effective.

Key words: multi-objective convex programming, double-objective convex programing, efficient solution, weak efficient solution

CLC Number: 

  • O221