求解多层规划问题的新方法研究

New Methods for Solving the Multi-level Programming Problem

在考虑普通多层规划模型求解困难及多层规划与多目标规划异同点的基础上,将求解多目标规划的方法引入到解决多层规划问题当中,为了真实反眏系统的递阶层次结构关系,根据各层之间及同层次之间各目标函数的相对重要性,对各层及同层各目标函数赋予相应的权重,最后提出了解决多层规划问题的两种新方法——理想点和线性加权和法,并通过算例证明其简单性及有效性。

Considering the difficulties of dissolving the common multi-level programming （MLP）model and the similarities and differences between MLP and MOP（multi-objective programming） , the authors put the further minimum distance method and the linear weighted method of MOP into solving the multi-level programming problem（MLPP）.Because of the hiberarchy structure of systems and according to the corresponding importance of objective function among multi-level or one level,the authors also give the corresponding weight of the objective functions and put forward two new methods for soliving MLPP-the further minimum distance method and the linear weighted method.Finally two numerical examples are given to illustrate the simpleness and validity of these two methods.