摘要
本文利用微分方程对一般多目标优化问题及其约束条件进行了讨论,指出在一定条件下,从问题(1)的任一可行解的某邻域内出发,沿微分方程组(3)的轨线,关于部分变元总收敛到问题(1)的可行解。
In reference[2],a new method is presented for fiuding the pareto points of the multi-ob- jective programming.Moreover,the discussion about general the M.O.P and its constraints is continued by the differential equations in this paper.It is proved that the solutions starting from the neighborhood of a feasible point converge to a feasible point.
出处
《重庆邮电学院学报(自然科学版)》
1993年第2期67-71,共5页
Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)