摘要
本文给出一个由决策群体求解带有非线性约束的多目标凸规划问题的交互规划算法.此法通过决策群体与分析者之间以及各决策者之间的交互,最终得到群体满意的有效解.本文还证明了这一算法的收敛性定理.
The paper gives a intercture method solving multiobjective convex programming with nonlinere constration by a decision making group.Through the interaction with the group and the analysis and the interction with decision makers,this method can final obtain the pareto efficient solution sutisfied by the group.The paper also has proved the convergence theorem of the method
关键词
多目标凸规划
决策群体
交互规划
有效解
multiobjective convex programming
decision making group
interactive programming
efficient solution
weak efficient solution.
