求解一类凸多目标规划最小弱有效解的填充函数法  

A Filled Function Method of Finding Weak Efficient Mi-nimizer for Convex Multi-Objective Optimization

作　　者：张莹[1] 徐应涛[1] 

机构地区：[1]浙江师范大学数理与信息工程学院,金华

出　　处：《理论数学》2011年第2期149-155,共7页Pure Mathematics

基　　金：国家自然科学基金资助项目(No.11001248)。

摘　　要：针对一类目标函数为凸向量值函数且约束为箱子集的多目标规划,先利用线性加权和法将其转化为非凸单目标规划,再利用填充函数法求得该单目标规划的全局最优解,从而得到原规划的最小弱有效解。To a kind of multi-objective optimization problem, which objective function is convex vector function and which constraints are box sets, firstly we use linear weighted method to turn it into nonconvex single-objective optimization problem, secondly we get the global minimizer of the single-objective optimi-zation problem by implying the filled function method, then we attain the weak efficient minimizer of the prime multi-objective optimization problem.

关 键 词：运筹学 多目标规划 填充函数 局部极小点 全局极小点 

分 类 号：O22[理学—运筹学与控制论]