国外几种大型微机有限元分析系统(FEAS)简介

本文简述当前国际上流行几种大型通用微机用有限元程序的概况，以及它们的比较与应用等     

OBJECT-ORIENTED FINITE ELEMENT ANALYSIS AND PROGRAMMING IN VC++

ＩｎｔｒｏｄｕｃｔｉｏｎＳｉｎｃｅｆｉｎｉｔｅｅｌｅｍｅｎｔａｎａｌｙｓｉｓｐｒｏｇｒａｍｓｄｅａｌｗｉｔｈｔｈｅｔｈｅｏｒｉｅｓａｎｄｍｅｔｈｏｄｓｏｆｔｈｒｅｅｆｉｅｌｄｓｏｆｍｅｃｈａｎｉｃｓ,ａｐｐｌｉｅｄｍａｔｈｅｍａｔｉｃｓａｎｄｃｏｍｐｕｔｅｒｓｃｉｅｎｃｅ,ｔｈｅｙａｒｅｃｏｍｐｌｉｃａｔｅｄａｎｄｅｒｒｏｒ＿ｐｒｏｎｅ .Ｄｕｒｉｎｇｄｅｖｅｌｏｐｍｅｎｔｐｅｏｐｌｅａｌｌｔｈｒｏｕｇｈｓｅｅｋｔｈｅｍｅｔｈｏｄｔｏｉｍｐｒｏｖｅｐｒｏｇｒａｍｓ.Ｔｈｅｏｂｊｅｃｔ＿ｏｒｉｅｎｔｅ…     

大型结构分析程序系统单元库更新

阐述了大型结构分析程序系统单元库更新的概念及其意义，报告了装入ＡＰ－１程序系统单元库的精化四节点及八节点平面等参元的情况，给出了更新前、后单元通过考题库测试的结果及与其它程序系统结果的比较。数值结果表明通过更新单元来提高程序系统的分析精度与计算效率从而增强其竞争力是可行的。     

用ADINA确定热电厂磨煤机打击轮磨损极限

利用ＡＤＩＮＡ程序计算磨损后打击轮的应力分布状态；根据强度理论，得到磨损极限，为打击轮维修提供了依据．实践证明，不超过磨损极限的打击轮修复以后可以满足使用精度要求，其使用期限与新的打击轮相同．磨损极限的确定为国家创造了经济效益     

Doppler程序对金红石型TiO2的空位缺陷研究

金红石型TiO2是一种非常好的稀磁半导体材料,其自身的本征缺陷与室温铁磁性起源密切相关。本文利用Doppler程序在广义梯度理论（GGA）的基础上,计算了正电子在金红石型TiO2块材中不同缺陷处的湮没寿命。主要包括自由态正电子的湮没寿命,单空位和双空位处束缚态正电子的湮没寿命。并从理论上给出了含有空位缺陷时金红石型TiO2的符合多普勒展宽能谱。     

Minimizing weighted mean absolute deviation of job completion times from their weighted mean

We address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the maximum admissible level of service equity. It has been shown earlier that the unweighted version of this problem is NP-hard in the ordinary sense. For that version, a pseudo-polynomial time dynamic program and a 2-approximate algorithm are available. However, not much (except for an important solution property) exists for the weighted version. In this paper, we establish the relationship between the optimal solution to the weighted problem and a related one in which the deviations are measured from the weighted median (rather than the mean) of the job completion times; this generalizes the 2-approximation result mentioned above. We proceed to give a pseudo-polynomial time dynamic program, establishing the ordinary NP-hardness of the problem in general. We then present a fully-polynomial time approximation scheme as well. Finally, we report the findings from a limited computational study on the heuristic solution of the general problem. Our results specialize easily to the unweighted case; they also lead to an approximation of the set of schedules that are efficient with respect to both the weighted mean absolute deviation and the weighted mean completion time.     

Existence of optimal solutions for general stochastic linear complementarity problems

In this paper we show the solvability of the expected residual minimization (ERM) formulation for the general stochastic linear complementarity problem (SLCP) under mild assumptions. The properties of the ERM formulation are dependent on the choice of NCP functions. We focus on the ERM formulations defined by the “min” NCP function and the penalized FB function, both of which are nonconvex programs on the nonnegative orthant.     

Mathematical programs with multiobjective generalized Nash equilibrium problems in the constraints

This paper considers a class of mathematical programs that include multiobjective generalized Nash equilibrium problems in the constraints. Little research can be found in the literature although it has some interesting applications. We present a single level reformulation for this kind of problems and show their equivalence in terms of global and local minimizers. We find that the reformulation is a special case of the so-called mathematical program with equilibrium constraints which is extensively studied in the literature.     

基于时间窗延迟的资源约束项目调度双层优化研究

本研究从业主—承包商交互的视角构建了一种RCPSP(resource-constrained project scheduling problem)双层优化模型,即在可更新资源约束条件下,项目双方如何进行交互决策达到双方NPV(Net present value)最大化的目标。首先对研究问题进行界定,构建资源约束下的max-NPV项目调度双层优化模型;然后利用延迟优先规则设计了一种基于时间窗延迟的嵌套式自适应遗传算法来求解该模型,以达到双方NPV最大化;最后用一个算例验证算法的有效性,同时通过PSPLIB数值实验说明算法的稳定性,并分析关键参数对项目双方收益的影响。研究结果为项目进程的安排以及奖励机制的设计提供依据,以提高双方利益。     

An interactive method for multiple-objective mathematical programming problems

An interactive method is developed for solving the general nonlinear multiple objective mathematical programming problems. The method asks the decision maker to provide partial information (local tradeoff ratios) about his utility (preference) function at each iteration. Using the information, the method generates an efficient solution and presents it to the decision maker. In so doing, the best compromise solution is sought in a finite number of iterations. This method differs from the existing feasible direction methods in that (i) it allows the decision maker to consider only efficient solutions throughout, (ii) the requirement of line search is optional, and (iii) it solves the problems with linear objective functions and linear utility function in one iteration. Using various problems selected from the literature, five line search variations of the method are tested and compared to one another. The nonexisting decision maker is simulated using three different recognition levels, and their impact on the method is also investigated.