Joint efficient ordering method for group multiobjective programming

This paper introduces the concepts of individual efficient pair and group efficient pair for each alternative in group multiobjective programming, and corresponding to these concepts defines the concepts of individual joint efficient preference and group joint efficient preference, respectively. Based on the fundamental properties of the mapping from individual joint efficient preference to group joint efficient preference and group efficient number of alternative, a method of ordering alternatives for group multiobjective programming problems is given.     

多目标规划最弱有效解集的结构

本文对多目标规划问题的最弱有效解集在结构上进行了探讨,得到了两个重要性质。     

序线性拓扑空间中非凸多目标规划成立弱鞍点准则的几个条件

在序线性拓扑空间中，我们讨论了一类非凸多目标规划问题，得到了与弱有效解相关联的弱鞍点存在性（即成立弱鞍点准则）的几个必要且充分条件和充分条件。我们所获得的结果推广了已知的一些结果。     

An Interactive Two-Level Multiobjective Decision Method

In view of two-level multiobjective decision making problem, and employing satisfactoriness of     

非线性约束的半无限多目标规划离散型算法偏差估计

讨论一类具有非线性约束的半无限多目标规划离散型算法的偏差估计并给出相应的计算公式．     

Order Structure Analysis（OSA） for the Optimal Solutions of Multiple Objective Mathematical Programming

ＯｒｄｅｒＳｔｒｕｃｔｕｒｅＡｎａｌｙｓｉｓ（ＯＳＡ）ｆｏｒｔｈｅＯｐｔｉｍａｌＳｏｌｕｔｉｏｎｓｏｆＭｕｌｔｉｐｌｅＯｂｊｅｃｔｉｖｅＭａｔｈｅｍａｔｉｃａｌＰｒｏｇｒａｍｍｉｎｇＦＥＮＧＪｕｎｗｅｎ（ＳｏｆｔＳｃｉｅｎｃｅＲｅｓｅａｒｃｈＩｎｓｔ...     

τ约束服务系统一类多目标排序问题

本文提出一类τ约束服务系统多目标排序问题，给出了最优排序方法     

The Interactive Method: A New Approach to Solving a Kind of Mixed Integer Programming

Porduction planning often comes up in the form of programming problems with continuous variables, where investment project planing usually reduces to zero-one programming. Combination of the choices of investment projects with the existent production capacity, therefore, yields mixed integer programming. With this background, this paper provides a new approach to solving mixed integer programming problems by combining the man-machine interactive method for multiobjective programming with graphics generating techniques.     

多目标规划的惩罚函数法

分析本文引用极限集的概念建立了多目标规划的惩罚函数法,并对该方法进行了收敛性分析,文章最后给出了数值计算的例子.     

多目标线性规划的一种矩阵对策方法

提出了一种求解多目标线性规划问题的人机对话方法，其基本原理与ＳＴＥＭ方法大致相同，但采用了两人零和混合对策思想确定Ｔｃｈｅｂｙｃｈｅｖ距离中的相对权重，使权重的确定方法较传统的机械式相对固定权重确定方法更为合理