The many facets of linear programming

We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex, ellipsoid, interior-point, and other methods. Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001     

串联系统可靠性虚拟系统法置信下限的小样本性质

本文讨论了具有r个成败型元件串联系统可靠性的置信下限问题。研究了虚拟系统法置信下限的小样本性质,证明了,在通常情况下虚拟系统法置信下限要大于常见的L-M法置信下限.更一般地,本文证明了在成败型试验中,当成功数与试验数之比保持不变时,试验次数的增加将直接缩小成功率置信区间的长度。     

停流—荧光动力学分析法测定痕量钛的研究

利用自行组装的停流-荧光动力学分析仪,采用停流法汇合流体动力注入技术,研究了钛与3.5-二溴水杨基荧光酮的荧光增强动力学反应性质,讨论了流速、进样时间对方法灵敏度和精密度的影响,提出了一个快速、简便、精确测定钛的分析方法,并用于稀土样品及合成样品中痕量钛的测定.方法检测限为8×10~(-3)ppm,大多数元素的干扰均可用动力学方法消除.     

带耗散的一阶非线性偏微分方程组的Cauchy问题

本文采用整体迭代法证明了带小初值的一阶非线性耗散偏微分方程组的Cauchy问题的整体经典解的存在性及指数衰减性质。     

人力资源的预测方法

人力资源规划是必不可少的管理环节．科学的人力资源规划，必须建立在对人员供、需的准确预测的基础上．本文讨论人力资源预测的问题和转移矩阵等方法的使用．     

On a fast direct elliptic solver by a modified Fourier method

We describe high order numerical algorithms for the solution of second order elliptic equations in rectangular domains. These algorithms are based on the Fourier method in combination with a subtraction procedure. The singularities at the corner points, arising due to non-smoothness of the boundaries, are treated explicitly using properly constructed singular corner functions. The present algorithm is a generalization of the Fast Poisson Solver developed in our previous paper. This revised version was published online in August 2006 with corrections to the Cover Date.     

Riabouchinsky flow with partially penetrable obstacle

An explicitly solvable Riabouchinsky model with a partially penetrable obstacle is introduced. This model applied to the estimation of the efficiency of free flow turbines allows us to take into account the pressure drop past the lamina.     

The method of concentrating a substance from a solution in a stationary sorbent layer and its theoretical basis

The principle of concentrating a substance from a mixture flow in a stationary sorbent layer of infinite length that was previously developed for gas chromatography is extended to liquid chromatography. Translated fromIzevestiya Akademii Nauk. Seriya Khimicheskaya, No. 5, pp. 1063–1065, May, 1997.     

Trefftz,collocation, and other boundary methods—A comparison

In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.