Total optimality of incrementally optimal allocations

This paper considers the problem of finding optimal solutions to a class of separable constrained extremal problems involving nonlinear functionals. The results are proved for rather general situations, but they may be easily stated for the case of search for a stationary object whose a priori location distribution is given by a density function on R, a subset of Euclidean n-space. The functional to be optimized in this case is the probability of detection and the constraint is on the amount of effort to be used Suppose that a search of the above type is conducted in such a manner as to produce the maximum increase in probability of detection for each increment of effort added to the search. Then under very weak assumptions, it is proven that this search will produce an optimal allocation of the total effort involved. Under some additional assumptions, it is shown that any amount of search effort may be allocated in an optimal fashion.     

An optimality condition for a nondifferentiable convex program

An optimality condition for the ordinary convex programming problem which utilizes the directional derivatives of the constraints is studied.     

一种基于主动网络技术的拥塞控制模型研究

文章对传统拥塞控制方案和主动拥塞控制算法进行研究,在此基础上提出了一种新的主动拥塞控制模型。重点描述了该模型的功能结构和软件控制流程,并对用于拥塞控制的主动报文封装格式进行了设计。最后对该模型的公平性、稳健性以及安全问题进行了探讨。     

A squared-variable transformation approach to nonlinear programming optimality conditions

We show that the well-known necessary and sufficient conditions for a relative maximum of a nonlinear differentiable objective function with nonnegative variables constrained by nonlinear differentiable inequalities may be derived using the classical theory of equality constrained optimization problems with unrestricted variables. To do this we transform the original inequality-constrained problem to an equivalent equality-constrained problem by means of a well-known squared-variable transformation. Our major result is to show that second order conditions must be used to obtain the Kuhn-Tucker conditions by this approach. Our nonlinear programming results are motivated by the development of some well-known linear programming results by this approach.     

Congestion analysis of a computer core storage system

This paper studies the congestion problems of the computer core storage units. The principle of storage request interleaving is briefly discussed as means of increasing thruput. An analytic model is proposed to analyze the core storage system with a two-way interleaving feature. The model, an approximation to the physical system, is an extension of a queueing model with bulk service considered by Bailey in Ref. [1].     

Acceptance sampling,imperfect production,and the optimality of zero defects

Acceptance sampling is often used to monitor the quality of raw materials and components when product testing is destructive, time-consuming, or expensive. In this paper we consider the effect of a buyer-imposed acceptance sampling policy on the optimal batch size and optimal quality level delivered by an expected cost minimizing supplier. We define quality as the supplier's process capability, i.e., the probability that a unit conforms to all product specifications, and we assume that unit cost is an increasing function of the quality level. We also assume that the supplier faces a known and constant “pass-through” cost, i.e., a fixed cost per defective unit passed on to the buyer. We show that the acceptance sampling plan has a significant impact on the supplier's optimal quality level, and we derive the conditions under which zero defects (100% conformance) is the policy that minimizes the supplier's expected annual cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 515–530, 1997     

A note on the optimality conditions for the bilevel programming problem

A counterexample is given to demonstrate that previously proposed necessary conditions for the bilevel programming problem are not correct. An interpretation of the difficulty is given by appealing to a “theorem of alternative” result presented in the original work.     

基于XMSF的组播拥塞控制模型的设计与研究

采用叠加组播技术为XMSF提供多对多的通信服务,同时使用拥塞控制机制保证其网络服务质量。提出了一种新的组播拥塞控制模型,在MAX-PLUS代数基础上采用线性循环法分析计算了其吞吐量,经过仿真验证了该模型的可行性和灵活性。     

李雅普诺夫运动稳定性与平衡状态稳定性的关系

稳定性是系统分析的重要内容 ,针对在系统稳定性分析中 ,运动稳定性和平衡状态稳定性之间常易于混淆的问题 ,详细分析了两种稳定性之间内在本质联系 ,给出了从一种稳定性过渡到另一种稳定性的方法     

On the optimality of the bayes prediction policy in two-echelon multistation inventory models

The present paper provides a proof that the Bayes prediction ordering policy developed in [3] is an optimal policy, in the sense that it minimizes the total expected discounted cost of ordering for any finite planning horizon.     

Statistical equivalency and optimality of simple step‐stress accelerated test plans for the exponential distribution

Accelerated life testing (ALT) is commonly used to obtain reliability information about a product in a timely manner. Several stress loading designs have been proposed and recent research interests have emerged concerning the development of equivalent ALT plans. Step‐stress ALT (SSALT) is one of the most commonly used stress loadings because it usually shortens the test duration and reduces the number of required test units. This article considers two fundamental questions when designing a SSALT and provides formal proofs in answer to each. Namely: (1) can a simple SSALT be designed so that it is equivalent to other stress loading designs? (2) when optimizing a multilevel SSALT, does it degenerate to a simple SSALT plan? The answers to both queries, under certain reasonable model assumptions, are shown to be a qualified YES. In addition, we provide an argument to support the rationale of a common practice in designing a SSALT, that is, setting the higher stress level as high as possible in a SSALT plan. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

节点缓存受限场景下车载自组织网络拥堵特性研究

车载自组织网络作为一种新型的移动自组织网络,是智能交通系统的关键组成部分.近年来,社会各界对车载自组织网络的拥堵性进行了广泛研究,但却忽略了车载自组织网络中移动节点缓存空间有限的现实问题.因此,针对节点缓存受限场景下车载自组织网络的拥堵性问题进行了研究,通过设计来优化网络中数据包的传递过程.仿真实验的结果表明,提出的多...     

基于纳什均衡的动态目标分配策略研究

动态武器目标分配(dynamic weapon target assignment,DWTA)问题是军事运筹学研究的重要理论问题,也是作战指挥决策中迫切需要解决的现实问题。DWTA问题不能使用静态武器目标分配(static weapon target assignment,SWTA)的动态规划方法来解决。在考虑攻防双方武器系统损耗的基础上分析了DWTA模型,分析结果表明DWTA问题可以尝试用博弈理论解决。最后以实例加以说明。     

高维非线性电路平衡点稳定性研究

提出了一种新的分析具有分解形式的高维非线性电路平衡点全局渐近稳定的方法.这种方法以矩阵分解为工具,结合平衡点的渐近稳定判据,用分解矩阵的稳定性决定平衡点的全局渐近稳定性.与目前该问题所采用的LIYAPUNOV直接法相比,该方法具有无须判断平衡点的唯一性,判别方法直接明了等优点.电路维数越大时,此方法越有其优势.同时,该方法对于其他形式的非线性系统的分析,也有重要的启发性及应用价值.     

平衡肘轴裂纹原因分析

某车辆在初样车试车过程中发现平衡肘轴有开裂现象。经化学成分分析、金相检测、宏观断口分析、综合分析等分析检测手段,最终确定裂纹是在试车过程中形成于连接销孔底部圆锥面与孔侧圆柱面相交的圆周处,在随后的试车过程中发生疲劳扩展。本论文针对所分析的结论,对原始设计工艺进行了研究,并作了一定的改进,在改进后的试车中,未发现类似的失效现象。     

装备采办中一级密封招标的博弈均衡分析

针对装备采办中的一级密封招标问题,分析了招标过程中的博弈特点,给出了一维贝叶斯均衡的求解方法和解析表达式,论证了在军工企业的最优战略是选择博弈的贝叶斯均衡,军方的选择是增加竞标者的人数。然后,重点分析了招标过程中的多维博弈问题,给出了多维贝叶斯均衡的一般求解方法,并针对特定的事例进行了多维均衡分析。最后,在多维博弈的框架下对一维博弈和多维博弈的均衡结果进行比较分析,结果表明：在一级密封招标过程中,多维博弈均衡是军工企业的最优战略。     

混合均衡问题和不动点问题的公共元的迭代算法

在Hilbert空间中,利用超梯度算法,用以逼近混合均衡问题的解集与半压缩映像不动点集的公共元,并且证明了该算法的收敛性。使用新的分析技巧证明了一个强收敛定理。     

五九坦克平衡肘滑动轴承的磨损分析

本文通过对平衡肘滑动轴承磨损量的统计分析,得到了有关平衡肘滑动轴承及平衡肘轴磨损状况的一些统计性规律.     

和谐本位社会中公共政策的价值冲突及其均衡

以利益原则为基础的功利主义倾向是当前政府实践决策的主要选择,这种决策模式不能解决建构和谐社会中公共政策的价值冲突问题。如何更好地坚持和谐本位原则,寻求公共政策价值冲突的均衡,构造和谐的公共政策价值结构,是建构和谐社会的一个重要课题。试图通过寻求公共政策价值冲突的均衡,探求建构和谐社会中公共政策价值冲突的解决办法。