基于价格竞争的最优定价策略与供应链的协调方法

本文研究了一个生产商和多个有价格竞争的零售商组成的供应链问题,运用二层规划和博弈论中合作博弈与非合作博弈的理论与方法,得到了核心企业的最优定价策略,并给出整条供应链的完全协调策略.     

多目标模糊系数规划

在单目标模糊系数规划的理论基础上，对多目标模糊系数规划进行讨论，在以目标间的协调程度尽可能大为最优性条件的要求下提出多目标模糊系数规划最优解的定义，并给出一种可行的求解方法。     

基于子结构法构造用非协调元解椭圆型问题的预处理器（II）

基于子结构法构造用非协调元解椭圆型问题的预处理器（ＩＩ）顾金生，胡显承（清华大学应用数学系）李岷珊（北方交通大学数学系）ＴＨＥＣＯＮＳＴＲＵＣＴＩＯＮＯＦＰＲＥＣＯＮＤＩＴＩＯＮＥＲＳＦＯＲＥＬＬＩＰＴＩＣＰＲＯＢＬＥＭＳＤＩＳＣＲＥＴＩＺＥＤＢＹＮ...     

复合系统及其协调的一般理论

章给出了复合系统的定量描述,对复合系统及其协调机理进行了系统分析,并建立了复合系统协调管理的概念模型,该模型已用于经济-资源-环境复合系统的协调分析和设计中。     

交通运输系统协调发展理论与模型研究

提出了交通运输系统协调度的评价分析模型.从系统论的观点出发,提出了交通运输系统协调理论的概念,探讨了交通运输系统随时间而不断演化变迁的规律,给出了交通运输系统协调发展基本步骤;并根据协调学原理,讨论了交通运输系统的协调性问题,提出了系统协调发展模型,对交通运输子系统内部及子系统之间及系统整体的协调发展问题进行了研究,探讨了交通运输可持续发展的系统协调管理过程,为进一步研究交通运输系统的可持续发展奠定了基础.     

非线性耦合标量场方程显式解析解的研究

利用两种不同的变换,获得了一类非线性耦合标量场方程的若干类型的精确解析解,其中包括孤子解,奇性孤波解和三角函数解,从而丰富了方程解的内容,这些结论可以应用于其它的非线性方程,此外还纠正了一些文献的部分结论。     

三元三次不定方程ax^(2)+by^(2)+cz^(2)=dxyz-1基础解的进一步研究

关于三元三次不定方程的研究,是不定方程研究中的重要课题,有许多尚未解决的问题.讨论了不定方程ax^(2)+by^(2)+cz^(2)=dxyz-1的基础解,其中(a,b,c)=1,a,b,c均为d的因子.利用文献中的方法,运用二元二次型理论和初等数论的结果,求出了该不定方程的所有基础解.     

Poincaré方程的线性差耦合系统

该文对Poincare方程的线性差耦合系统的同相解及反相解进行研究,得到了同相解稳定的参数区域,并在对角线性差耦合的情形下.对其反相解的存在性及稳定性进行了完整的分析,改进了文[1]的结果.     

关于运输问题最优解的进一步讨论

首先给出了运输问题最优解的相关概念,将最优解扩展到广义范畴,提出狭义多重最优解和广义多重最优解的概念及其区别.然后给出了惟一最优解、多重最优解、广义有限多重最优解、广义无限多重最优解的判定定理及其证明过程.最后推导出了狭义有限多重最优解个数下限和广义有限多重最优解个数上限的计算公式,并举例验证了结论的正确性.     

区间数线性规划问题的解法

基于区间数与实数之间的关系,提出了区间数线性规划的激进最优解,保守最优解的定义.利用约束集之间以及目标函数值之间的关系,在原有区间数线性规划的基础之上,给出了两个求解激进最优解、保守最优解的方法.数值例子验证了该方法的有效性和可行性.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

Noninferior Nash Strategies for Multi-Team Systems

This paper is concerned with the optimization of systems that are controlled by several teams of decision makers. The decision makers within each team cooperate for the benefit of their team. On the other hand, the teams compete among themselves in order to achieve an objective that relates to the overall performance of the system. An approach that merges concepts from team theory and game theory for dealing with such systems and a solution called the noninferior Nash strategy are introduced. This multi-team solution provides a new framework for analyzing hierarchically controlled systems so as to address complicated coordination problems among the decision makers. The properties of the noninferior Nash solution in static multi-team systems are investigated and necessary conditions for its existence are derived. Analytical expressions for the noninferior Nash strategies are derived for a class of linear-quadratic static multi-team games. In order to deal with the issue of nonuniqueness of the solution, the concept of a noninferior Nash strategy with a team leader is introduced. Several examples are presented to illustrate the results.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

一类基于OWA算子的组合预测模型及其性质

本文引进近年来提出的有序加权平均（OWA）算子，建立新的组合预测模型。首先指出最大绝对误差最小化的组合预测模型是其特例，并给出其线性规划的求解方法；然后对该模型提出非劣性组合预测、预测方法优超，冗余度等新概念；最后探讨了非劣性组合预测以及冗余预测方法的存在性，并给出冗余信息的判定定理。     

Approach to group decision making based on determining the weights of experts by using projection method

The aim of this paper is to present a new approach for determining weights of experts in the group decision making problems. Group decision making has become a very active research field over the last decade. Especially, the investigation to determine weights of experts for group decision making has attracted great interests from researchers recently and some approaches have been developed. In this paper, the weights of experts are determined in the group decision environment via projection method. First of all, the average decision of all individual decisions is defined as the ideal decision. After that, the weight of expert is determined by the projection of individual decision on the ideal decision. By using the weights of experts, all individual decisions are aggregate into a collective decision. Then an ideal solution of alternatives of the collective decision, expressed by a vector, is determined. Further, the preference order of alternatives are ranked in accordance with the projections of alternatives on the ideal solution. Comparisons with an extended TOPSIS method are also made. Finally, an example is provided to illustrate the developed approach.     

群体决策问题的一种最优均衡解

本文引进了群体决策问题的一个最优解概念—s~*-最优均衡解,s~*-最优均衡解可以作为群体决策问题的一种解,它的实际意义是为所有的决策者找到一个最优解。我们证明了求解s~*-最优均衡解等价于求解一个相应的单目标优化问题,且在一定条件下s~*-最优均衡解总是存在的。我们也讨论按比例分配的s~*-最优均衡解问题。本文为解决群体决策问题提供了一种新的途径。     

多指标决策的较多最优方案与较多非劣方案

本文介绍了由比较因素决定的较多序与方案的比较因子，并在较多序的基础上定义了较多最优方案与非劣方案．同时对其存在性、控制结构集、几何条件、局部较多最优方案与非劣方案及其存在性、算法等进行了讨论．     

New approach for nonseparable dynamic programming problems

A general class of nonseparable dynamic problems is studied in a dynamic programming framework by introducingkth-order separability. The solution approach uses multiobjective dynamic programming as a separation strategy forkth-order separable dynamic problems. The theoretical grounding on which the optimal solution of the original nonseparable dynamic problem can be attained by a noninferior solution of the corresponding multiobjective dynamic programming problem is established. The relationship between the overall optimal Lagrangian multipliers and the stage-optimal Lagrangian multipliers and the relationship between the overall weighting vector and the stage weighting vector are explored, providing the basis for identifying the optimal solution of the original nonseparable problem from among the set of noninferior solutions generated by the envelope approach.This work was supported in part by NSF Grant No. CES-86-17984. The authors appreciate the comments from Dr. V. Chankong and the editorial work by Mrs. V. Benade and Dr. S. Hitchcock.