A lagrangean relaxation algorithm for the constrained matrix problem

We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems.     

Asymptotic distribution of some multivariate “success run” renewal processes,applied to a 2-i.i.d. unit repairable system

If the probability of “failure” in a multivariate renewal process of the “success run” type is very small, then if certain conditions are imposed on the components of the renewals, the joint distribution of their total durations is approximately exponential with all mass along one line. This result is applied to a 2-i.i.d. unit repairable system of the “1 out of 2:G, Cold Standby” type.     

基于深度卷积神经网络的蛇形机动航迹图像识别

为提高防空武器系统对空袭目标的拦截防御能力,针对现有蛇形机动识别算法鲁棒性较差的问题,提出了将航迹坐标数据转化为图像,利用深度神经卷积神经网络进行航迹模式分类的方法。针对航迹数据直接转化为图像时存在机动幅度不明显或过大的问题,提出了有效解决方案。基于CAFFE平台进行了大量仿真实验,确定了适宜于航迹模式分类的深度卷积网络结构和网络参数。实验结果表明,该方法能有效提高蛇形机动航迹识别的鲁棒性。     

Cyclic scheduling in flow lines: Modeling observations,effective heuristics and a cycle time minimization procedure

In this paper we address the cyclic scheduling problem in flow lines. We develop a modeling framework and an integer programming formulation of the problem. We subsequently present exact and approximate solution procedures. The exact solution procedure is a branch-and-bound algorithm which uses Lagrangian and station-based relaxations of the integer programming formulation of the problem as the lower bounding method. Our heuristic procedures show a performance superior to the available ones in the literature. Finally, we address the stability issue in cyclic scheduling, demonstrate its relationship to the work-in-progress inventory control of a flow line, and present a very simple procedure to generate stable schedules in flow lines. © 1996 John Wiley & Sons, Inc.     

A pareto race

A dynamic and visual “free-search” type of interactive procedure for multiple-objective linear programming is presented. The method enables a decision maker to freely search any part of the efficient frontier by controlling the speed and direction of motion. The objective function values are represented in numeric form and as bar graphs on a display. The method is implemented on an IBM PC/1 microcomputer and is illustrated using a multiple-objective linear-programming model for managing disposal of sewage sludge in the New York Bight. Some other applications are also briefly discussed.     

Quality control and the sales process

Product quality is emerging as a major strategic instrument for competition. The purpose of this article is to assess the effects of quality control on sales, and, vice versa, the effects of the sales process on quality control. A model relating quality control and the sales process (advertising, repeat purchase, and word-of-mouth effects) is developed to evaluate the above relationships. Two special cases, with degenerate and beta distribution for defect items in the production lot, are analyzed in detail. In the former case, analytical results for the optimal quality control schemes are obtained, whereas in the latter, efficient bounds are derived to search for the optimal scheme. It is shown, analytically and numerically, that the sales parameters have significant impact on whether more “stringent” or “tighter” quality control is warranted. Future research directions are also discussed.     

A (Q,R) inventory model with lost sales and erlang-distributed lead times

The exact expression is derived for the average stationary cost of a (Q,R) inventory system with lost sales, unit Poisson demands, Erlang-distributed lead times, fixed order cost, fixed cost per unit lost sale, linear holding cost per unit time, and a maximum of one order outstanding. Explicit expressions for the state probabilities and a fast method of calculating them are obtained for the case of Q greater than R. Exponential lead times are analyzed as a special case. A simple cyclic coordinate search procedure is used to locate the minimum cost policy. Examples of the effect of lead time variability on costs are given.     

Joint pricing,assortment, and inventory decisions for a retailer's product line

Consider a set of product variants that are differentiated by some secondary attributes such as flavor, color, or size. The retailer's problem is to jointly determine the set of variants to include in her product line (“assortment”), together with their prices and inventory levels, so as to maximize her expected profit. We model the consumer choice process using a multinomial logit choice model and consider a newsvendor type inventory setting. We derive the structure of the optimal assortment for some important special cases, including the case of horizontally differentiated items, and propose a dominance relationship for the general case that simplifies the search for an optimal assortment. We also discuss structural properties of the optimal prices. Finally, motivated by our analytical results, we propose a heuristic solution procedure, which is shown to be quite effective through a numerical study. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

等截面隔离段中激波串结构的数值模拟

采用二阶TVD格式的有限体积法偶合Baldwin Lomax代数湍流模型求解雷诺平均Navier stokes方程 ,数值模拟了二维矩形等截面隔离段中的流动现象 ,很好地模拟出由激波 /附面层干扰所形成的复杂的激波串流场结构。计算结果与国外有关文献的结果进行了比较。     

Reliability inference for field conditions from accelerated degradation testing

Accelerated degradation testing (ADT) is usually conducted under deterministic stresses such as constant‐stress, step‐stress, and cyclic‐stress. Based on ADT data, an ADT model is developed to predict reliability under normal (field) operating conditions. In engineering applications, the “standard” approach for reliability prediction assumes that the normal operating conditions are deterministic or simply uses the mean values of the stresses while ignoring their variability. Such an approach may lead to significant prediction errors. In this paper, we extend an ADT model obtained from constant‐stress ADT experiments to predict field reliability by considering the stress variations. A case study is provided to demonstrate the proposed statistical inference procedure. The accuracy of the procedure is verified by simulation using various distributions of field stresses. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

高空动能拦截器末制导导引方法设计与实现

以高空动能拦截器为研究对象,为其末制导段设计了一种“逐段限制视线转率”的导引方法,使之最终能直接命中目标,实现动能拦截的任务并通过仿真计算验证了该导引法的可行性。     

Requirements of an “optimizer” for computer simulations

Computer simulation has many advantages. However, one major disadvantage is that, in all too many cases, the attempt to use computer simulation to find an optimum solution to a problem rapidly degenerates into a trial-and-error process. Techniques for overcoming this disadvantage, i. e., for making optimization and computer simulation more compatible, are applicable at two points in the development of the overall computer simulation. Techniques which are used within actual construction of the mathematical models comprising the simulation will be labeled as internal methods, while those which are used after the simulation has been completely developed will be termed external methods Because external methods appear to offer the largest potential payoff, discussion is restricted to these methods, which are essentially search techniques. In addition, the development of an “Optimizer” computer program based on these techniques is suggested Although drawbacks to the use of search techniques in the computer simulation framework exist, these techniques do offer potential for “optimization.” The modification of these techniques to satisfy the requirements of an “Optimizer” is discussed.     

Single-period inventory models with demand uncertainty and quantity discounts: Behavioral implications and a new solution procedure

Quantity discounts are considered in the context of the single-period inventory model known as “the newsboy problem.” It is argued that the behavioral implications of the all-units discount schedule are more complex and interesting than the literature has suggested. Consideration of this behavior and the use of marginal analysis lead to a new method for solving this problem that is both conceptually simpler and more efficient than the traditional approach. This marginal-cost solution procedure is described graphically, an algorithm is presented, and an example is used to demonstrate that this solution procedure can be extended easily to handle complex discount schedules, such as some combined (simultaneously applied) purchasing and transportation cost discount schedules.     

Transportation type problems with quantity discounts

It is known to be real that the per unit transportation cost from a specific supply source to a given demand sink is dependent on the quantity shipped, so that there exist finite intervals for quantities where price breaks are offered to customers. Thus, such a quantity discount results in a nonconvex, piecewise linear functional. In this paper, an algorithm is provided to solve this problem. This algorithm, with minor modifications, is shown to encompass the “incremental” quantity discount and the “fixed charge” transportation problems as well. It is based upon a branch-and-bound solution procedure. The branches lead to ordinary transportation problems, the results of which are obtained by utilizing the “cost operator” for one branch and “rim operator” for another branch. Suitable illustrations and extensions are also provided.     

Extension of Bolzano search to rectangles which preserves rectangles as iterates

Multivariable elimination algorithms, which may be regarded as generalizations of various one-dimensional search procedures, have not found wide application. A probable reason may be the generally very irregularly shaped regions of uncertainty that evolve iteratively in the procedures. Hence hope for practical salvage of this class of algorithms seems to lie in controlling the shape of the successively smaller regions of uncertainty. In this article an extension of Bolzano search to rectangles which preserves rectangular iterates is given. Since the result is essentially geometrical in nature, a geometric proof of this procedure is given. Hopefully the proof procedure will be of independent interest. A numerical illustration of the procedure is given for a game problem, such problems lending themselves to this method.     

A note on splitting the bump in an elimination factorization

This exposition presents a method for incorporating a technique known as “splitting the bump” within an elimination form reinversion algorithm. This procedure is designed to reduce fill-in during reinversion and should improve the efficiency of linear programming systems which already use the superior elimination form of the inverse.     

“What is dear to you?” Survey of beliefs regarding protection of critical infrastructure against terrorism

Up to the present, there is only very little research on how the population perceives terrorism and its threats, even though support from the population is crucial for effective counterterrorism. By eliciting beliefs and subjecting them to content analyses, six factors were found that determine the protection worthiness of a target in the people's view: the potential damage to “people,” “symbolism,” “economy,” “politics,” “nature,” and “image/publicity.” These empirically found factors are in line with factors specified by terrorist target selection models. They differ in the strength of their cognitive representation among participants and, thus, their subjective importance to the people. The first three factors are shared among all participants, whereas the latter ones could only be found in a part of the participant sample. People's judgments of the targets' protection worthiness differ substantially from their judgments of the targets' attractiveness to terrorists, even though the same factors seem to be involved. This study offers an insight into the people's mental model about protection worthiness of targets. Together with classical risk analysis and knowledge about terrorists, these results can form a basis for setting up a holistic scheme for critical infrastructure protection.     

基于BP神经网络的闭路制导改进方法

针对传统闭路制导方法中的制导方法误差,提出了一种根据"真实目标"进行制导的改进制导方法。采用BP神经网络逼近算法,推导建立预定关机点及落点坐标与需要速度间的映射关系,并装订上弹,使关机点附近对应每一个位置能够映射出相应的需要速度矢量。然后利用闭路制导关机及导引方法对导弹实施控制。通过仿真,该方法大大减小了制导方法误差,提高了导弹射击精度。     

A streamlined simplex approach to the singly constrained transportation problem

A primal simplex procedure is developed to solve transportation problems with an arbitrary additional linear constraint. The approach is a specialization of the Double Reverse Method of Charnes and Cooper. Efficient procedures for pricing-out the basis, determining representations, and implementing the change of basis are presented. These procedures exploit the pure transportation substructure in such a manner that full advantage may be taken of the computational schemes and list structures used to store and update the basis in codifying the MODI method. Furthermore, the pricing-out and change-of-basis procedures are organized in a manner that permits the calculations for one to be utilized in the other. Computational results are presented which indicate that this method is at least 50 times faster than the state-of-the-art LP code, APEX-III. Methods for obtaining basic primal “feasible” starts and “good” feasible integer solutions are also presented.     

The danger of “hybrid warfare” from a sophisticated adversary: the Russian “hybridity” in the Ukrainian conflict

The term “hybrid warfare” is a new one that the West began to use to explain its failure to cope with asymmetric threats. Focusing on the war on global terrorism, the West temporarily withdrew its attention from traditional adversaries, such as Russia, which has used this gap and has audaciously returned to the stage as a global actor. Until the Russian annexation of the Crimean Peninsula in 2014 and inflaming the Ukrainian crisis, most Western authors attributed “hybrid threats” mostly to non-state actors. But the Ukrainian scenario showed the true face of “hybridity” in the modern battlefield when practised by a powerful state actor. Russian “hybrid warfare” in Ukraine has already been seen as a combination of conventional and unconventional methods, that have been complemented with other instruments of national power – diplomatic, economic and information. The purpose of this article is, through an analysis of the Ukrainian scenario, to demonstrate that although the term “hybrid” is new, the concept itself is old and is a continuation of already seen doctrine from the Cold War era. Although “hybrid threats” can come both from state and non-state actors, the Russian interference in Ukraine is proof that they are especially dangerous for the West if, or when, they are initiated from a traditional, sophisticated adversary that has the capacity to use all forms of warfare.