目标选择优化模型及算法

提出了可用于大威力武器火力分配的目标选择优化模型及算法。内容包括：问题的数学描述、问题的等价变换与分解、问题求解的动态规划算法和不同算法的计算次数比较。     

关于大型线性规划问题鞍点算法的讨论

关于大型线性规划问题鞍点算法的讨论尚毅,张国光,成孟金（沈阳化工学院１１００２１）ＡＤｉｓｃｕｓｓｉｏｎｏｆｔｈｅＳａｄｄｌｅＰｏｉｎｔＡｌｇｏｒｉｔｈｍｆｏｒＬａｒｇｅＳｃａｌｅＬＰＰｒｏｂｌｅｍｓ￥ＳｈａｎｇＹｉ;ＺｈａｎｇＧｕｏｇｕａｎｇ;Ｃｈ...     

求解整数规划问题的一个搜索方法

本文整数规划问题给出一种搜索方法,它类似于求解连续变量优化问题的迭代方法,从一个好的初始可行解出发,寻找一个搜索方向,沿着这个方向求出改进的可行解,然后又开始下一次迭代。此方法简单易行,可以求出问题的最优解或近似最优解,对于整数线性规划问题和整数非线性规划问题的求解都适用,并且容易推广到求解大规校整数线性规划问题。文中附有计算例子,说明方法是有效的。     

Smalltalk-80 的形式语义研究

Smalltalk-80是原型的面向对象程序设计语言和环境。本文简要地介绍了Smalltalk-80的基本概念和抽象文法,给出了其形式模型,并基于该模型描述了Smalltalk-80的静态指称语义和动态指称语义。     

The failure of defense planning in European Post-Communist Defense Institutions: ascertaining causation and determining solutions

By any objective measure, defense institutions in Central and Eastern Europe have all but universally been incapable of producing viable defense plans that are based on objective costing and operational planning data. This situation exists in spite the provision of considerable Western advice and assistance, let alone reporting to and receiving assessments by NATO’s International Staff under Partnership for Peace, as well as via the integrated defense planning and reporting systems. An explanation for this systematic failure across European post-Communist defense institutions can be found in the continued slow development of an over-arching policy framework which directs and approves all activities of the armed forces, as well as the de-centralization of financial decision-making down to capability providers. The essay ends with an examination of the adverse effects of the early introduction of planning programming, budgeting system (PPBS), have had on the development of effective policy and planning capabilities within these defense institutions.     

基于凸优化理论的三维微分对策制导规律求解

针对三维微分对策制导律(DGL)求解问题,引入凸优化理论,将DGL求解归结到Hamilton系统的求解,设计了DGL求解算法,通过对代价函数梯度特征的凸分析,推导出对策系统鞍点存在的充要条件和求解方法,解决了以往通过对微分对策模型简化求解导致的模型不能客观反映作战过程的问题.     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

基于随机提前期的备件携行量计算方法

舰艇出海执行任务期间,需要携行一定种类和数量的物资自给。文中研究了这种单级供应条件下,如何确定备件最优携行量的问题。建立了以服务水平为目标,以资源为约束的目标规划模型,模型考虑了随机提前期和备件重要度。提出一种基于边际效费比的增量法用于求解这个模型。最后,给出一个算例并得到了一些结论。     

Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process

This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Machine maintenance with workload considerations

Machine maintenance is modeled in the setting of a single‐server queue. Machine deterioration corresponds to slower service rates and failure. This leads to higher congestion and an increase in customer holding costs. The decision‐maker decides when to perform maintenance, which may be done pre‐emptively; before catastrophic failures. Similar to classic maintenance control models, the information available to the decision‐maker includes the state of the server. Unlike classic models, the information also includes the number of customers in queue. Considered are both a repair model and a replacement model. In the repair model, with random replacement times, fixed costs are assumed to be constant in the server state. In the replacement model, both constant and variable fixed costs are considered. It is shown in general that the optimal maintenance policies have switching curve structure that is monotone in the server state. However, the switching curve policies for the repair model are not always monotone in the number of customers in the queue. Numerical examples and two heuristics are also presented. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007