| 求解一般凸多目标规划最小弱有效解的组合同伦内点方法 |
| |
| 引用本文： | 安玉伟,刘庆怀.求解一般凸多目标规划最小弱有效解的组合同伦内点方法[J].黑龙江科技学院学报,2002,12(2):31-34. |
| |
| 作者姓名： | 安玉伟 刘庆怀 |
| |
| 作者单位： | 1. 黑龙江科技学院基础部,黑龙江鸡西,158105
2. 吉林大学数学系,吉林长春,130025 |
| |
| 基金项目： | 国家自然科学基金资助项目(19771043) |
| |
| 摘 要： | 构造求解一般凸多目标规划等价的单目标规划K-K-T点的同伦方程,在M-F约束规定及外法锥条件下,证明了几乎对多目标规划可行域的任一内点,同伦方程可产生一条光滑、有界的同伦路径,并证明了数值追踪同伦路径将得到一般凸多目标规划最小弱有效解。
|
| 关 键 词： | 多目标规划 同伦方法 内点法 |
| 文章编号： | 1671-0118(2002)02-0031-04 |
Combined Homotopy Interior Point Method of Solving Minimal Weak Efficient Solution for General Convex Multi-objective Programming |
| |
| AN Yuwei,LIU Qinghuai.Combined Homotopy Interior Point Method of Solving Minimal Weak Efficient Solution for General Convex Multi-objective Programming[J].Journal of Heilongjiang Institute of Science and Technology,2002,12(2):31-34. |
| |
| Authors: | AN Yuwei LIU Qinghuai |
| |
| Abstract: | In this paper, a homotopy equation has been constructed for getting the K-K-T point of the single objective programming, which is equivalent to the general convex multi-objective programming. As proved in the paper, a smooth and bounded homotopy path can be generated by the homotopy equation for almost every interior point of the feasible region of multi-objective programming, and numerical trace homotopy path can lead to a minimal weak efficient solution for convex multi-objective programming, under M-F constricted qualification and normal cone condition. |
| |
| Keywords: | multi-objective programming homotopy method interior point method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
