摘要
把多目标规划问题转化为单目标规划问题,利用强伪不变凸函数和强拟不变凸函数,得出了在K-T条件下多目标规划问题(VP)(弱)有效解存在的存在性定理,并给出了相应的证明.
Through transformation of multi-objective programming problem into a single-objective programming problem and by use of strong pseudo-invariant convex function and strong quasi-invariant convex function, an efficient-solution existence theorem for the multi-objective programming problem（VP） under the Kuhn-Tucher condition is obtained and proven valid.
出处
《内江师范学院学报》
2009年第10期30-32,共3页
Journal of Neijiang Normal University
关键词
强伪不变凸函数
强拟不变凸函数
多目标规划
strong pseudo-invariant convex function
strong quasi-invariant convex function
multi-objective programming
