The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999     

集团军跨域应急作战装备保障能力建设研究

加强应急作战装备保障能力建设,是提高战斗力的重要组成部分。本文针对新体制、新形势下的军队战争形态、使命任务和训练要求,分析了集团军跨域应急作战装备保障的主要特点和当前装备保障存在的不足,并在此基础上,从构建理论体系和装备保障平台、人才队伍建设,装备保障模式以及装备保障实战化训练五个方面给出了集团军跨域应急作战装备保障能力建设和应对措施。     

Pricing and capacity allocation strategies: Implications for manufacturers with product sharing

Emerging sharing modes, like the consumer-to-consumer (C2C) sharing of Uber and the business-to-consumer (B2C) sharing of GoFun, have considerably affected the retailing markets of traditional manufacturers, who are motivated to consider product sharing when making pricing and capacity decisions, particularly electric car manufacturers with limited capacity. In this paper, we examine the equilibrium pricing for a capacity-constrained manufacturer under various sharing modes and further analyze the impact of capacity constraint on the manufacturer's sharing mode selection as well as equilibrium outcomes. We find that manufacturers with low-cost products prefer B2C sharing while those with high-cost products prefer C2C sharing except when the sharing price is moderate. However, limited capacity motivates manufacturers to enter into the B2C sharing under a relatively low sharing price, and raise the total usage level by sharing high-cost products. We also show that the equilibrium capacity allocated to the sharing market with low-cost products first increases and then decreases. Finally, we find that sharing low-cost products with a high limited capacity leads to a lower retail price under B2C sharing, which creates a win-win situation for both the manufacturer and consumers. However, sharing high-cost products with a low limited capacity creates a win-lose situation for them.     

Callable products with dependent demands

Capacity providers such as airlines often sell the same capacity to different market segments at different prices to improve their expected revenues. The absence of a secondary market, due to the nontransferability of airline tickets, gives rise to an opportunity for airlines to broker capacity between consumers with different willingness to pay. One way to broker capacity is by the introduction of callable products. The idea is similar to callable bonds where the issuer has the right, but not the obligation, to buy back the bonds at a certain price by a certain date. The idea of callable products was introduced before under the assumption that the fare-class demands are all independent. The independent assumption becomes untenable when there is significant demand recovery (respectively, demand cannibalization) when lower fares are closed (respectively, opened). In this case, consumer choice behavior should be modeled explicitly to make meaningful decisions. In this paper, we consider a general consumer choice model and develop the optimal strategy for callable products. Our numerical study illustrates how callable products are win-win-win, for the capacity provider and for both high and low fare consumers. Our studies also identify conditions for callable products to result in significant improvements in expected revenues.     

近地一次环月两次交会的载人登月任务规划

针对近地一次环月两次交会的载人登月任务飞行阶段多、周期长、约束复杂,导致各阶段飞行窗口与轨道衔接匹配复杂的难题,提出分层分解、正逆向结合的全任务标称飞行窗口与轨道衔接设计策略。介绍近地一次环月两次交会的载人登月任务飞行模式特点和应用前景,假定任务基本需求与工程约束,仿真验证所提方法的有效性,可以快速规划出近地一次环月两次交会的载人登月任务飞行轨道与窗口。     

联合作战筹划中的态势评估

联合作战筹划中的态势评估,是对预设战局有效性的评估,其目的是判断己方能否通过该作战态势取得预期战场优势,达成阶段作战目的。科学、合理的态势评估是构建联合作战筹划链路的重要一环,值得深入探索和研究。     

The Hungarian experience with Gripen fighter aircraft

The post-communist countries transition from the Warsaw Pact style of platforms and systems to Western-compatible capabilities has never been an easy task or a process without conflicts. This was no different for the Visegrád countries either, in which case the Hungarian Gripen procurement stands out. After much debate, Budapest decided to modernize its fighter fleet with the not battle tested Swedish-made Gripen fighter aircraft. This decision received several critiques due to the lack of transparency in the selection process and the initial lack of NATO-required systems. Subsequently, the fleet has had to operate in a financially demanding environment. Moreover, the air force has lost two aircrafts in accidents. Now that the jets are in the middle of their envisaged life cycle, it is more than appropriate to answer the question if the Gripens can utilize their full combat potential or will they fail the test of time?     

复杂约束下的导弹作战任务规划模型和算法研究

导弹作战任务规划是一个涉及时间、资源、质量和其他关系约束的复杂问题。首先通过定义约束满足效用对基本约束满足模型进行了扩展,建立了导弹任务规划的约束满足优化模型。在此基础上,研究了任务规划模型求解的时间和效用传播算法,提出了基于综合效用的优化求解框架。该模型和求解框架易于解决具有多种约束因素的复杂问题,具有较好的通用性。通过定义软、硬约束效用,使得实际任务规划问题求解具有更好的灵活性。     

地铁火灾应急预案的制定

介绍地铁火灾发生时的几个主要的特点以及其巨大的危害性,引出了地铁火灾应急预案制定模式的重要性。通过对已有的资料进行研究、分析,同时结合实际,对地铁火灾应急预案制定时所包含的主要内容进行了科学的完善,得出了一个完整的预案制定模式。     

重大活动安全警卫工作之我见

当前,重要会议、重大活动已经成为群众上访制造事端扩大影响的首选目标。同时,也成为敌对分子、恐怖组织企图实施阴谋暗害和恐怖破坏活动的主要选择场所。为防止上述事件发生,警卫部队要处理好三种关系,掌握情报信息。严密部署。