期刊文献+

多目标凸规划问题有效解集的求法 被引量:1

Method for Solving Efficient Solutions Set of Multi-objective Convex Programming
下载PDF
导出
摘要 利用组合同伦内点法研究了多目标凸规划的求解问题,得到了多目标凸规划问题的有效解集,证明了同伦内点算法的全局收敛性.数值例子表明此算法是可行并且有效的. We solve multi-objective convex programming problem by means of homotopy interior point algorithm. The set of efficient solutions can be obtained by this method. We also prove the global convergence of homotopy interior point algorithm. Moreover, the results of the numeric examples show that this method is feasible and effective.
出处 《北华大学学报(自然科学版)》 CAS 2015年第6期701-704,共4页 Journal of Beihua University(Natural Science)
基金 国家自然科学基金项目(11171003) 教育部科学技术研究重点项目(211039) 吉林省教育厅科学技术研究项目(2015156)
关键词 多目标凸规划问题 同伦内点算法 有效解集 multi-objective convex programming problem homotopy interior algorithm efficient solution set
  • 相关文献

参考文献8

  • 1Kellogg R B,Li T Y, Yorke J A. A constructive proof the Brouwer fixed-point theorem and computational results [ J ]. SIAM J Numer Analysis, 1976,18:473-483.
  • 2S Smale. A convergent process of price adjustment and global Newton method [J]. J Math Econom, 1976,3:1-14.
  • 3Chow S N,Mallet-Paret J, York J A. Finding zero of maps : Homotopy methods that are constructive with probability one [ J ] Math Comput, 1978,32:887-899.
  • 4Song W, Yap G M. Homotopy method for a general muhiobjeetive programming problem [ J ]. J Optim Theory App1,2008,138 139-153.
  • 5X Zhao ,S G Zhang, Q H Liu. Homotopy interior-point method for a general multi-objective programming problem[ J ]. Journal of Applied Mathematics ,2012, ID 497345.
  • 6X Zhao,S G Zhang, Y T Yang, et al. Homotopy method for a general multi-objective programming problem under generalized quasi-normal cone condition[ J]. Abstract and Applied Analysis,2012,ID 591612.
  • 7Zhang Z S. Introduction to differential topology[ M]. Beijing: Beijing University Press,2002.
  • 8Naber G L. Topological methods in euclidean space[ M]. England:Cambridge University Press, 1980.

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部