求解多目标非线性规划的目标迫降法

本文提出了求解多目标非线性规划问题的一种新方法－目标迫降法。该方法实质上是一种人机对话算法。决策者可以根据计算结果迫降目标函数或改变当前解的位置，从而直接控制寻优过程。本方法对初始解的选择没有任何限制，所需的信息量少，可以较显著地节省计算机内存和计算时间，因而是一种方便、实用的方法。

The Objective-forced-reduction Method for SolvingNonlinear Multiobjective Programming

n this papor ,a new inethed-objective-forced-reduction methed for solving nonliear multiojec-tive programmmg has been proposed. It is in fact a man-machine interaction alsorithm , the decision-mak-er may force the objective fuction to the reduced or chanse the location of the prasent solution accordingto the talculated results,so as to control the searching process directly. ThLs methed has no restriction inchasing initial point ,and needs less inforniations ,so that it can save stcrewnits in computer and comput-ing time remarkably , therefore ,it is a converuent and practicamble methed for egnineering application.