Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

横向效应增强型弹垂直侵彻薄靶的轴向剩余速度理论分析

为了得到横向效应增强型弹（Penetration with Enhanced Lateral Efficiency projectile, PELE）对金属薄靶垂直侵彻后的弹体轴向剩余速度,运用平面冲击波理论,对PELE的侵彻机理进行分析。参照平头弹体对靶板的侵彻模型,将PELE侵彻过程中的能量损失划分为以下几个部分：外壳体和内芯撞靶区域对应的环形塞块获得的能量、冲击波作用下弹体的内能增量以及剪切耗能等。然后根据能量守恒原理,得到PELE垂直侵彻金属薄靶后的PELE弹体轴向剩余速度的理论模型。为了验证该模型的合理性和准确性,设计相应的试验进行验证。结果表明,不同条件下得到的试验结果和理论模型得到的计算结果均吻合得较好。因此,得到的PELE垂直侵彻薄靶的轴向剩余速度理论模型可为工程应用提供指导和参考。     

相依网络研究综述

网络相依性和相依网络研究已经成为近年来复杂网络领域的热点,但是目前对相关研究进展进行综合归纳的文献却不多见。在对国内外相关文献进行系统分析的基础上,简要介绍相依网络研究涉及的渗流理论;描述该类型网络的级联失效过程;从相依网络的子网络特性、相依边的方向和类型、子网络组合方式等三个角度对相依网络鲁棒性的研究成果进行总结;并从理论和应用两方面对未来相依网络研究的发展方向进行展望。     

基于灰色关联和D-S证据理论的导弹系统安全性评估

针对导弹系统安全性评价的不确定性问题,提出了将灰色关联和D-S证据理论相结合的方法,从人员安全性、设备安全性和环境安全性建立了综合评估指标体系,用灰色关联分析处理了指标之间的关联性。在传统证据合成公式的基础上,考虑证据集非关键因素的权重,给出了修正的证据合成公式。并以打靶选弹为例进行了计算分析,得出了导弹安全性优先级排序,并将改进算法与传统计算方法的结果进行了比较,验证了评价模型的可行性与实用性,为导弹系统的管理工作提供了有益的参考。     

基于Epsilon-Nash策略的动态武器-目标分配方法

在大型任务规划软件的作战单元任务分配中,搜索零和博弈问题的纳什均衡点是求解任务分配的一种有效的方法。然而,纳什均衡点在决策中并不一定总是存在且唯一,这造成了纳什均衡策略在实际使用时具有较大的局限。通过采用Epsilon-Nash策略克服这种局限,并将其应用于自主空战任务规划系统中,通过仿真实验,证实Epsilon-Nash策略具有近似于纳什策略的效果。     

基于贝叶斯混合博弈的空袭火力资源分配决策模型

从博弈论的角度出发研究空袭火力资源的分配问题,针对空袭编队和防空火力单元攻防对抗过程中存在的不确定性、静态性以及动态性,建立基于贝叶斯混合博弈的空袭对抗火力分配模型。通过构造贝叶斯混合博弈树,采用逆向回溯法分别建立不同的博弈分析模型,利用混合粒子群算法求解那什均衡。仿真结果表明:以博弈论为背景研究空袭作战火力分配问题,符合真实的作战坏境,有效性好,有较高的理论应用价值。     

释放点排布方式对水雾红外遮蔽性能的影响

水雾作为一种优良的红外伪装措施,受到了越来越多的关注。水雾遮蔽性能的仿真研究也成为了关注的焦点,但是始终没有一种有效的仿真途径来探讨水雾释放点排布产生的影响。针对这一问题,基于高斯扩散理论与Mie散射理论,提出了一种空间划分的建模方案,解决了这一问题,并根据仿真结果,简单分析了相同条件下不同释放点排布方式对其红外辐射遮蔽性能的影响。所得结论对制定有效的红外对抗策略有一定的参考价值。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

基于排队论的反舰导弹突防概率研究

根据水面舰艇对海导弹攻击中作战指挥的需要,提出了基于排队论中随机服务理论的反舰导弹突防概率解算模型.综合研究了目标舰艇编队采用各种手段进行抗击帮助条件下,反舰导弹突防概率的计算问题,并且结合想定装备参数进行了算例分析.为指挥员实施导弹攻击提供辅助决策和量化支持.