区间直觉模糊集的模糊熵群决策方法

针对专家权重未知、专家判断信息以区间直觉模糊集给出的多属性群决策问题,提出了一种新的模糊熵决策方法。通过定义区间直觉模糊集的模糊熵判断专家信息的模糊程度,进而确定每位专家的权重;然后计算备选方案距理想方案和负理想方案的模糊交叉熵距离,得到每个专家对方案的排序;再分别利用加权算术算子和加权几何算子集结专家的排序结果,得到专家群体对方案的排序。实例分析验证了方法的有效性。     

田径竞赛编排中的两个数学模型

佟毅．田径竞赛编排中的两个数学模型．数理统计与管理，１９９８，１７（４），１～３．研究了田径比赛竞赛编排中的两个数学模型。随机排序矩阵模型主要应用于竞赛分组的编排工作；多轨搜索模型主要应用于竞赛日程的编排工作。     

一种基于不同风险偏好投资多目标决策模型及解法

建立了风险投资的多目标决策模型，分别采用线性加权法、TOPSIS法和密切值法，对不同风险偏好下备选方案进行排序，再用平均值法对上述排序进行综合排序，从而避免单一方法的片面性，较为全面科学地得出最优方案。最后，用一个算例说明了方法的可行性和有效性。     

残缺互补判断矩阵排序的一种新方法

对残缺互补判断矩阵的排序方法进行了研究.把一般互补判断矩阵的排序方法推广到了残缺判断矩阵的情形,分析了参数的取值范围,并对判断信息完全未知的情形进行了讨论.最后给出了算例,对几种排序方法作了比较,结论表明本文给出的方法权重差异较大,更易于方案的排序.     

改进型双基点多指标多方案排序法

本文针对双基点法及其一系列改进方法的不足,借鉴DEA方法的“相对效率”和变权思想,对一类多指标多方案评价与排序问题给出了一种合理的评价方法并得出了排序结果.双基点法中权值的设定反映了决策者对评价指标的偏好,但在某种程度上而言,这样的设定过于依赖决策者的主观判断,其合理性和公平性有待商榷.而DEA方法不受任何人为因素的影响,仅依赖被评价方案对应于所考虑因素的状态值,其特点是它在评价某个方案时,从该方案在方案集中的相对效率出发,选择最有利于该方案的权,若变动这组权,只会使该方案在方案集中的排序结果要么不变要么更差.文章进一步对多个方案的相对效率为1的情形给出改进方法,最后选用两个实例加以说明.     

基于灰关联分析和相对熵的多属性决策排序方法

在灰关联分析和相对熵决策方法的基础上,结合各自的优点,提出了一种解决多属性决策问题排序的新方法.首先利用改进熵对评价属性进行赋权,其次计算被评方案与理想方案和负理想方案的灰色关联度和相对熵,最后根据相对贴近度的大小对被评方案进行排序,案例说明了决策方法的有效性和实用性.     

基于不同距离的TOPSIS油田开发方案组合优选

为了衡量TOPSIS方法中不同距离函数对油田开发最优决策方案的影响,综合考虑技术、经济和效益等指标,分别采用曼哈顿距离、欧式距离、切比雪夫距离和垂面距离来探究油田开发方案排序之间的差异性.同时,为解决这种差异,通过计算4种距离函数下方案排序对理想开发方案的隶属度,并采用加权组合决策的方法对4种优选结果进行综合决策.     

区间数互补判断矩阵的拓扑排序方法

提出了方案之间进行比较时优于与劣于的定义,通过构造与区间数互补判断矩阵相对应的有向图的方法,将互补判断矩阵的排序问题转化为有向图中顶点的拓扑排序问题,将有向图中的顶点按照备选方案的重要性顺序输出,得到的顶点的序列即为备选方案的重要性排序,数值计算实例验证了该方法的有效性与可行性。     

基于在线信息的群评价模型及其偏序集求解方法

在相关研究的基础上,明确界定了在线群评价模型。该模型将在线评价信息用向量评价矩阵来表示,巨量数据转换成易于运算的方式。针对向量难以集结、属性权重难以明确等问题,运用偏序集相关知识对方案进行排序。通过权重排序信息,应用偏序集决策方法,对向量评价矩阵进行变换,得到方案间的比较关系矩阵。用偏序集表示的在线评价模型,不仅能够对方案进行排序,还能用于个性化产品推荐,通过Hasse图能够直观展示方案间的层次关系。最后,依据汽车之家网站提供的汽车产品在线评价信息的例子,体现本文方法的独特性和实用性。     

一种基于序区间偏好信息的群决策分析方法

针对序区间偏好信息的群决策方案排序问题,本文提出了一种新的分析方法.首先,给出了序区间的有关定义及其性质;然后,通过定义专家群体判断关于方案在排序位置的期望可能度和专家群体判断关于方案的数学期望值,给出了序区间偏好信息的群决策方案排序方法.最后,通过一个算例说明了本文提出的分析方法。     

A Hybrid Algorithm for the Non-Guillotine Cutting Problem

In this article, a meta-heuristic method to solve the non-guillotine cutting stock problem is proposed. The method is based on a combination between the basic principles of the constructive and evolutive methods. With an adequate management of the parameters involved, the method allows regulation of the solution quality to computational effort relationship. This method is applied to a particular case of cutting problems, with which the computational behaviors is evaluated. In fact, 1000 instances of the problem have been classified according to their combinatorial degree and then the efficiency and robustness of the method have been tested. The final results conclude that the proposed method generates an average error close to 2.18% with respect to optimal solutions. It has also been verified that the method yields solutions for all of the instances examined; something that has not been achieved with an exact constructive method, which was also implemented. Comparison of the running times demonstrates the superiority of the proposed method as compared with the exact method.     

自适应多重网格法与超松弛法的比较

多重网格法(Multiple Grid Method,简称M-G方法)是近年来出现的快速方法之一,本文在M-G方法中采用自适应控制层间转换的技术,并将自适应M-G方法与G-S迭代方法及SOR迭代方,法进行了比较。其计算结果表明,自适应M-G方法的计算量比G-S迭代及SOR迭代少得多,当M-G方法所用层数为4-6层,这种优越性就更加明显,且自适应M-G方法中选取控制参数有很大的灵活性。     

A new hybrid method for solving global optimization problem

In this paper we present a new hybrid method, called the SASP method. The purpose of this method is the hybridization of the simulated annealing (SA) with the descent method, where we estimate the gradient using simultaneous perturbation. Firstly, the new hybrid method finds a local minimum using the descent method, then SA is executed in order to escape from the currently discovered local minimum to a better one, from which the descent method restarts a new local search, and so on until convergence.The new hybrid method can be widely applied to a class of global optimization problems for continuous functions with constraints. Experiments on 30 benchmark functions, including high dimensional functions, show that the new method is able to find near optimal solutions efficiently. In addition, its performance as a viable optimization method is demonstrated by comparing it with other existing algorithms. Numerical results improve the robustness and efficiency of the method presented.     

多目标决策问题及其求解方法研究

针对多目标决策问题的多目标最优化问题化为单目标最优化问题进行了研究.其主要方法有:理想点法、等级权重法、加权算术平均法、加权几何平均法、风险偏好系数法、乘除法、模糊规划法等.此外,还对多目标最大最小和多目标最小最大决策问题进行了处理.     

双层规划问题的一种模式搜索Filter方法

双层规划在工程设计和经济管理中应用广泛,结合模式搜索方法和Filter方法提出了一种解决双层规划问题的算法—模式搜索Filter方法.算法以Filter法思想构造接受准则,以模式搜索提供迭代方向和步长,能够有效的解决一类双层规划问题.     

复合材料旋转壳非线性稳定性分析计算

利用前屈曲一致理论和能量变分法分析计算了复合材料旋转壳非线性稳定性.前屈曲应变-位移关系采用非线性的卡门方程,能量积分采用数值积分,用势能最小原理求解前屈曲位移和内力,提出了求解临界载荷的实用计算方法,用FORTRAN语言编制了相应的计算机程序,并给出了算例.     

The Impact of Equal Weighting of Low- and High-Confidence Observations on Robust Linear Regression Computations

Equal weighting of low- and high-confidence observations occurs for Huber, Talwar, and Barya weighting functions when Newton's method is used to solve robust linear regression problems. This leads to easy updates and/or downdates of existing matrix factorizations or easy computation of coefficient matrices in linear systems from previous ones. Thus Newton's method based on these functions has been shown to be computationally cheap. In this paper we show that a combination of Newton's method and an iterative method is a promising approach for solving robust linear regression problems. We show that Newton's method based on the Talwar function is an active set method. Further we show that it is possible to obtain improved estimates of the solution vector by combining a line search method like Newton's method with an active set method.This revised version was published online in October 2005 with corrections to the Cover Date.     

Finding roots of a real polynomial simultaneously by means of Bairstow's method

Aberth's method for finding the roots of a polynomial was shown to be robust. However, complex arithmetic is needed in this method even if the polynomial is real, because it starts with complex initial approximations. A novel method is proposed for real polynomials that does not require any complex arithmetic within iterations. It is based on the observation that Aberth's method is a systematic use of Newton's method. The analogous technique is then applied to Bairstow's procedure in the proposed method. As a result, the method needs half the computations per iteration than Aberth's method. Numerical experiments showed that the new method exhibited a competitive overall performance for the test polynomials.     

A partial inexact alternating direction method for structured variational inequalities

In this article, a new method is proposed for solving a class of structured variational inequalities (SVIs). The proposed method is referred to as the partial inexact proximal alternating direction (piPAD) method. In the method, two subproblems are solved independently. One is handled by an inexact proximal point method and the other is solved directly. This feature is the major difference between the proposed method and some existing alternating direction-like methods. The convergence of the piPAD method is proved. Two examples of the modern convex optimization problem arising from engineering and information sciences, which can be reformulated into the encountered SVIs, are presented to demonstrate the applicability of the piPAD method. Also, some preliminary numerical results are reported to validate the feasibility and efficiency of the piPAD method.     

蒙特卡罗方法计算定积分的进一步讨论

介绍了蒙特卡罗方法计算定积分的原理和方法.给出了用蒙特卡罗方法计算定积分的一个简单证明,从而揭示了蒙特卡罗方法和定积分定义间的内在联系.针对蒙特卡罗方法收敛慢的特点,提出将蒙特卡罗方法与相应的数值计算方法相结合,提高计算结果的精度.此外,将蒙特卡罗方法推广到反常积分上去.