依赖机器的两台机自由作业排序问题

文章研究加工时间仅依赖于机器的两台机自由作业排序问题 O2 | pij = pi, p2 < p1 < 2p2, Non-Idle | ΣCj。项思明和唐国春(1998)证明了可将该问题转化成指派问题。俞文ci 和应刚(1998)给出了这一问题的显式解,并用较长的篇幅证明其显式解的正确性;他们还举例说明所给出的显式最优排序并不排除其他形式的最优解的存在;但他们未说明所给出的显式解何时才是唯一最优解。本文将给出问题 O2 | pij = pi, p2 < p1 < 2p2, Non-Idle | ΣCj的显式解的直观的最优性证明,并讨论问题显式解何时是唯一的最优解。     

加工时间依赖资源的流水作业资源分配问题

本研究加工时间受资源影响的流水作业时间表长问题。对问题F2|chain，∑（j=1，n）μj≤U|Cmax给出了问题求最优解的多项式时间算法。     

概率约束线性规划最优解的存在性

本文给出了概率约束规划ｍｉｎ{cx|P(A₁x≥ξ)≥p,A₂x≥b}的最优值有限的充要条件；对一类离散型随机向量ξ，并给出了这一概率约束规划存在最优解的充要条件．实际中常用的离散型随机向量属于这类离散型随机向量．     

概率约束非线性规划及对偶规划的最优解

§ 1.引言E.komaromi在[1]、[2]中讨论了概率约束线性规划 min{CX|P(A_1X≥ξ)≥p,A_2X≥6}及对偶规划最优解的存在性,并给出了一个求其最优解的算法.本文讨论了概率约束非线性规划     

关于问题Pm|intree;pj=1;rj|Cmax的分支定界算法

本文针对一个尚未解决的问题Pm|intree;pj=1;rj|Cmax进行了研究,借助于决策论中的递阶层次结构的概念提出一个全新的分支定界算法,并用这一算法得到了问题Pm|intree;pj=1;rj|Cmax的最优排序．     

指派问题的多重最优解的择优方法

在某些情况下,经典指派问题的最优解不唯一．不同的最优解对参与人的影响不同,导致每个参与人会争取最有利于自身的最优解．为解决这个问题,通过研究允许合作指派问题的合作对策解的形成,提出允许合作指派问题的讨价还价模型和个体理性激励函数．在此基础上,提出了一个考虑个体理性的指派问题多重最优解的择优方法,从而保证了指派问题最优解的唯一性．     

线性分式规划问题的最优性条件

本文讨论了线性分式规划问题ｍｉｎ以及它的最优性条件．证明了它的局布最优解一定是整体最优解，并且局布最优解正定在约束条件的基本可行解处达到．     

一类带调和势的非线性Schrdinger方程在R~N中的整体解存在的门槛

本文考虑一类带调和势的非线性 Schrdinger 方程 it=-△ |x|~2-μ||~(p-1)-λ||~(q-1),x∈R~N,t≥0, 其中μ＞0,λ＞0．当 N=1,2时,1＜p＜q＜∞；当 N≥3时,1＜p＜q＜(N 2)/(N-2)．运用精巧的变分方法、势井方法和凸方法,得到了方程的整体解和爆破解存在的门槛．进一步回答了：当 q＞p＞1 4/N 时,方程的 Cauchy 问题的初值小到什么程度,其整体解存在?     

一类非线性常微分方程振荡解的渐近表示

在本文中,我们讨论了非线性常微分方程y"=a0|x|αy3 a1|x|βy2 α2|x|γy α3|x|δ振荡解的渐近表示．在这个方程中将α0,α,α1,β,α2,γ,α3,δ分别换成0,0,6,0,0,0,sgn(x),1就是著名的第一类Painleve方程,而将α0,α,α1,β,α2,γ,α3,δ分别换成2,0,0,0,sgn(x),1,α0,就是著名的第二类Painleve方程．当α0,α,α1,β,α2,γ,α3,δ分别换成-β/3γ,0,0,0,1/γ,1,α,0时,可用于组合KdV方程孤立子解的化简．     

奇异非线性常微分方程非线性边界条件非负解的存在性

本文证明了非负解的存在性．这里（S）＝|S|P－2S，P＞1．     

直接法的推广与广义Burgers方程的条件对称约化

A generalization of the direct method of Clarkson and Kruskal for finding similarity reductions of partial differential equations with arbitrary functions is found and discussed for the generalized Burgers equation. The corresponding reductions and the exact solutions due to the methods of the ordinary differential equations are then given by the methods. The results given here answer partially an open problem proposed by Clarkson, that is how to develop the direct method to seek symmetry reductions of nonlinear PDEs with arbitrary functions.     

From the matrix-geometric to the matrix-exponential

We consider the single server queuesN/G/1 andGI/N/1 respectively in which the arrival process or the service process is a Neuts Process, and derive the matrix-exponential forms of the solution of relevant nonlinear matrix equations for such queues. We thereby generalize the matrix-exponential results of Sengupta forGI/PH/1 and of Neuts forMMPP/G/1 to substantially more general models. Our derivation of the results also establishes the equivalence of the methods of Neuts and those of Sengupta. A detailed analysis of the queueGI/N/1 is given, and it is noted that not only the stationary distribution at arrivals but also at an arbitrary time is matrix-geometric. Matrix-exponential steady state distributions are established for the waiting times in the queueGI/N/1. From this, by appealing to the duality theorem of Ramaswami, it is deduced that the stationary virtual and actual waiting times in aGI/PH/1 queue are of phase type.     

Letter to the Editor

The recent paper by Alshabani et al. [Partial size-and-shape distributions, J. Multivariate Anal. (2006), in press] derived the partial size-and-shape distributions motivated by a study in human movement analysis. The paper contained three main results (referred to as Results 1-3), each deriving an expression of the partial size-and-shape distribution. Two of the three results are expressed as infinite sums of terms involving special functions. Here, I would like to point that at least one of these results can be reduced to an explicit and manageable form.     

Letter to the editor

It is shown that the recent characterization of strong feasibility of interval linear equations by Karademir and Prokopyev was in fact published by this author 13 years earlier. The original result was difficult to discover, having been embedded, together with its proof, into the proof of another theorem.     

Letter to the editor

This letter shows how the main result contained in a paper recently appeared in the Journal of Multivariate Analysis was in fact a particular case of a more general theorem published three years before.     

三人博弈问题的模型和一种解法的修正

简要叙述了三个擂台赛博弈问题,指出解法[1]的错误所在,其一是将无限延伸的博弈树以有限的形式看待,其二是概率计算过程与结果错误,提出一种新的解法,并比较了结果的大小。