On the theory of semi-infinite programming and a generalization of the kuhn-tucker saddle point theorem for arbitrary convex functions

We first present a survey on the theory of semi-infinite programming as a generalization of linear programming and convex duality theory. By the pairing of a finite dimensional vector space over an arbitrarily ordered field with a generalized finite sequence space, the major theorems of linear programming are generalized. When applied to Euclidean spaces, semi-infinite programming theory yields a dual theorem associating as dual problems minimization of an arbitrary convex function over an arbitrary convex set in n-space with maximization of a linear function in non-negative variables of a generalized finite sequence space subject to a finite system of linear equations. We then present a new generalization of the Kuhn-Tucker saddle-point equivalence theorem for arbitrary convex functions in n-space where differentiability is no longer assumed.     

Optimal interdiction of a supply network

Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.     

A solution for queues with instantaneous jockeying and other customer selection rules

This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Z^r?1) × (2^r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution.     

模块结构EMS 型磁浮列车的导向控制研究

本文研究了模块结构ＥＭＳ型磁浮列车中的一对相互错开的电磁铁的导向模型,采用衰减记忆算法实施导向控制,通过仿真比较了主动控制系统与自稳定系统的导向效果,讨论了导向控制对纵向悬浮的影响     

视觉导航自主车方向控制系统性能仿真分析

本文主要通过图形仿真的方法对基于视觉导航的自主车（ＡＬＶ）方向控制系统进行性能分析,以大量仿真结果分析各组成子系统对整个系统性能的影响,为系统设计提供理论依据     

毁歼概率积分的高精度计算

精确地计算武器系统对目标的毁歼概率是重要的。在对几种数值积分方案比较的基础上,证明了Ｇａｕｓ－Ｈｅｒｍｉｔ数值积分方案可以最少的积分点达到最高的精度,并以此方案计算了各个参数对毁歼概率的影响     

Survey of approaches to readiness

About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology.