基于动态网络流理论的扇区通行能力优化模型

为解决区域管制扇区在危险天气、军方活动和管制员工作负荷等因素影响下通行能力降低的问题,提出了基于动态网络流理论的扇区通行能力优化模型,界定了容量和通行能力的区别。考虑航路容量、管制员负荷、危险天气和军方活动,构建了扇区内航路的通行能力模型,建立了与流量和通行时间有关的航段阻抗函数,建立了一个以航行时间最小为目标的优化模型。针对扇区内交通流动态变化的特点,设计了一种阶段性的分配流量的近似算法,并通过改进的算法对模型进行求解。仿真结果表明,所设计的模型和算法能够在受扰状况下有效分配流量,提高扇区的通行能力。     

登陆作战中直接火力准备的模糊指派模型

在登陆作战中,直接火力准备起着至关重要的作用,直接关系到登陆兵能否冲击上陆成功.考虑到实际作战中的模糊不确定性和多属性问题,利用模糊数学理论与多属性决策方法,将指派问题拓展到模糊条件下,针对登陆作战中如何发挥直接火力准备的最大效能问题,建立了模糊状态下的多目标指派模型,提供了求解方法,简要地对模型进行了动态化研究,并通过一仿真算例说明模型的应用效果较好,能为未来登陆作战提供辅助决策支持.     

一种评价伪装目标雷达发现概率的方法

为简化描述脉冲积累数、雷达参数及目标后向散射截面与发现概率、虚警概率之间的关系,结合伪装效果检测情况,提出了一种评价目标伪装前后雷达发现概率的方法,即构建评价函数对上述关系进行特征逼近研究.结果表明,该评价函数能反映伪装前后目标RCS与背景RCS比值的变化规律,且计算过程简单,可用于雷达检测评估.     

An operator theory of parametric programming for the transportation problem-II

This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-, the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. Operators that effect the transformation of optimum solution associated with such data changes, are shown to be a product of basis preserving operators (described in the earlier paper) that operate on a sequence of adjacent basis structures. Algorithms are provided for both rim and cost operators. The paper concludes with a discussion of the economic and managerial interpretations of the operators.     

Mathematical control theory solution of an interactive accounting flows model

In this paper we have applied the mathematical control theory to the accounting network flows, where the flow rates are constrained by linear inequalities. The optimal control policy is of the “generalized bang-bang” variety which is obtained by solving at each instant in time a linear programming problem whose objective function parameters are determined by the “switching function” which is derived from the Hamiltonian function. The interpretation of the adjoint variables of the control problem and the dual evaluators of the linear programming problem demonstrates an interesting interaction of the cross section phase of the problem, which is characterized by linear programming, and the dynamic phase of the problem, which is characterized by control theory.     

Productivity estimates of the strategic airlift system by the use of simulation

Although the strategic airlift system is under continuous analysis, C-5A problems provided impetus to analyze the airlift system productivity function by using a large-scale simulation model. Development of the simulation model (Simulation of Airlift Resources - SOAR) was initiated by the Office of Secretary of Defense (Systems Analysis) in 1966. SOAR had barely become operational in time for the study in November 1968. Since limited verification and validation tests had been performed on the simulation model, the design of experiments was of critical importance. The experimental design had to be flexible enough to salvage the maximum amount of information possible upon the discovery of either a verification or validation error. In addition, the experimental design was required to accommodate the estimation of a large number of possibly changing independent variables. The experimental design developed for the analysis was full factorial design sets for a finite number of factors. Initial analysis began with aggregated sets of factors at two levels, and information gained from experiment execution was used to parse the sets. The process was sequential and parsing continued until the major explanatory independent variables were identified or enough information was obtained to eliminate the factor from further direct analysis. This design permitted the overlapping of simulation runs to fill out the factorial design sets. In addition to estimating the airlift productivity function, several other findings are reported which tended to disprove previous assumptions about the nature of the strategic airlift system.     

The distribution of recoverable inventory items from a repair center when the number of consumption centers is large

This paper considers real-time decision rules for an inventory system where items are repaired than “used up.” The problem is to decide which user in the system has the greatest need for the newly available inventory items coming out of repair. The main result shows that two published approahes, the Transportation Time Look Ahead policy and METRIC, are optimal when the number of users gets large. A useful byproduct of the proof is a lower bound on the average backorder rate for a repair-inventory system of any size.