【摘要】 讨论了不可微多目标规划的最优点与集值映射不动点之间的关系。给出了最优点的必要条件是某个集值映射的Ｋａｋｕｔａｎｉ不动点，以及这个集值映射的Ｋａｋｕｔａｎｉ不动点是最优点的充分条件的结果。从而为用不动点算法求解不可微多目标规划问题打下了理论基础。更多还原

【Abstract】 It is shown that it is feasible to solve a nondifferentiable programming problem with thefixed point algorithm, the principle and method of using the fixed point algorithm to solve anondifferentiable multiobjective programming problem are discussed. The relationship be-tween the optimal point of a nondifferentiable multiobjective programming problem and theKakutani’ s fixed point of a certain set-valued mapping is worked out. The necessary condi-tion for an optimal solution is given. Some sufficient conditions for giving the optimal pointof a nondifferentiable multiobjective programming problem are also presented.更多还原