On constraint qualifications in nonlinear programming

In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above.     

Optimality conditions for convex semi-infinite programming problems

This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn-Tucker theories, which give only necessary or sufficient conditions for optimality, but not both.     

A note on duality in homogeneous fractional programming

For a linear fractional programming problem, Sharma and Swarup have constructed a dual problem, also a linear fractional program, in which the objective functions of both primal and dual problems are the same. Craven and Mond have extended this result to a nonlinear fractional programming problem with linear constraints, and a dual problem for which the objective function is the same as that of the primal. This theorem is now further extended from linear to differentiable convex constraints.     

基于最大后验风险的多层Bayes方法

为了对指数型产品进行可靠性鉴定,首先给出了失效率的多层先验分布,然后从最大后验风险的角度,运用Bayes方法,制定出可靠性鉴定试验方案.按照此鉴定试验方案,缩短了试验时间,从而降低了鉴定试验所需的费用.     

成败型产品的Bayes鉴定试验方案研究

利用可靠性增长模型给出了成败型产品鉴定试验的一种Bayes方法.提出了Bayes鉴定试验的最大后验风险准则,利用这种准则制定的鉴定试验方案综合了产品研制过程中的先验信息.在确保产品质量的前提下,与传统的鉴定试验方案相比,将大大节省试验时间.     

Optimal interdiction policy for a flow network

This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided.     

对我国维和警察政治考察工作的思考

在联合国任务区执行任务的中国维和警察,展示的是我国警察的整体形象,这就要求维和警察不仅要具备较强的业务素质还要具备较高的政治素质。因此,维和警察的政治考察工作尤为重要。阐述了政治考察工作的必要性和几个重要环节,对政治考察工作提出了构想。     

报刊编辑工作中视而不见现象分析

报刊编辑工作中,有的编辑对文稿反复看了几遍,仍有一些问题被疏忽,这种“视而不见”现象在报刊编辑工作中具有一定的普遍性。究其原因,一是编辑人员事业心、责任心问题,二是文字功底不强。要避免这种现象,编辑就要加强责任心;保持如履薄冰的心态;提高自身素质。     

On‐line parameter estimation for a partially observable system subject to random failure

In this paper, we study the on‐line parameter estimation problem for a partially observable system subject to deterioration and random failure. The state of the system evolves according to a continuous time homogeneous Markov process with a finite state space. The system state is not observable, except for the failure state. The information related to the system state is available at discrete times through inspections. A recursive maximum likelihood (RML) algorithm is proposed for the on‐line parameter estimation of the model. The RML algorithm proposed in the paper is considerably faster and easier to apply than other RML algorithms in the literature, because it does not require projection into the constraint domain and calculation of the gradient on the surface of the constraint manifolds. The algorithm is illustrated by an example using real vibration data. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

On the generation of deep disjunctive cutting planes

In this paper we address the question of deriving deep cuts for nonconvex disjunctive programs. These problems include logical constraints which restrict the variables to at least one of a finite number of constraint sets. Based on the works of Balas. Glover, and Jeroslow, we examine the set of valid inequalities or cuts which one may derive in this context, and defining reasonable criteria to measure depth of a cut we demonstrate how one may obtain the “deepest” cut. The analysis covers the case where each constraint set in the logical statement has only one constraint and is also extended for the case where each of these constraint sets may have more than one constraint.     

MTBF保证试验应用条件及风险分析

简介了美军使用的MTBF保证试验,并对进行MTBF保证试验的条件和经保证试验后使用方的风险进行了分析,说明了MTBF保证试验是可以在工程中应用的.     

兵团新课程实施学校教师专业素质的调查与分析

新课程的实施对我国中小学教师的知识、素质和能力提出了新的更高的要求。目前实施新课程的教师绝大多数都是师范院校培养出来的,他们已有的专业素质已不能满足课程改革的需要。本文在对兵团实施新课程学校教师的专业素质现状及需求的调查基础上,对师范院校师范生专业素质的培养提出一些改革的思路,使其培养出来的学生能够适应兵团基础教育课程改革的需要。     

Optimization in mixed-integer space with a single linear bound

The search for an optimal point in a mixed-integer space with a single linear bound may be significantly reduced by a procedure resembling the Lagrangian technique. This procedure uses the coefficients of the linear bound to generate a set of necessary conditions that may eliminate most of the space from further consideration. Enumerative or other techniques can then locate the optimum with greater efficiency. Several methods are presented for applying this theory to separable and quadratic objectives. In the maximization of a separable concave function, the resulting average range of the variables is approximately equal to the maximum (integer) coefficient of the constraint equation.     

An efficient heuristic for the multi-item newsboy problem with a single constraint

This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more efficient scheme that requires fewer computations. We provide calculations that compare and contrast four approximation techniques. In particular, we have discovered a method that yields a direct algebraic expression of the problem parameters for allocation and achieves an expected profit within 90% of the optimal in about 90% of the cases tested.     

Designing a degradation experiment

Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999     

消防职业技能鉴定制度探析

消防职业技能鉴定制度一般是指由政府主管部门批准的考核鉴定机构,对从业人员的消防技能水平进行评价并颁发证书,表明该人员达到消防职业国家标准的要求的制度。消防职业资格的法律实质为消防特有工种从业人员的执业执照,分析了以消防职业分类、职业标准、职业资格鉴定管理体系为主的消防职业技能鉴定制度构成要素,对制度建设过程中应注重的消防职业培训理念、该制度与人员就业和企业招聘以及与公安消防部队岗位资格制度的衔接问题进行了探讨。     

Optimality conditions for the bilevel programming problem

The bilevel programming problem (BLPP) is a sequence of two optimization problems where the constraint region of the first is determined implicitly by the solution to the second. In this article it is first shown that the linear BLPP is equivalent to maximizing a linear function over a feasible region comprised of connected faces and edges of the original polyhedral constraint set. The solution is shown to occur at a vertex of that set. Next, under assumptions of differentiability, first-order necessary optimality conditions are developed for the more general BLPP, and a potentially equivalent mathematical program is formulated. Finally, the relationship between the solution to this problem and Pareto optimality is discussed and a number of examples given.     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

基于遗传算法的气体爆轰参数计算

在研究气体爆轰条件和物理模型的基础上,首次以遗传算法为工具,解决了气体爆轰参数求解时温度、压力假设的盲目性和复杂性,并应用具体算例对该方法进行了验证,为气体爆轰参数的求解提供了一个新的途径。     

The procurement problem: An integer programming problem well suited to a solution using duality

A procurement problem, as formulated by Murty [10], is that of determining how many pieces of equipment units of each of m types are to be purchased and how this equipment is to be distributed among n stations so as to maximize profit, subject to a budget constraint. We have considered a generalization of Murty's procurement problem and developed an approach using duality to exploit the special structure of this problem. By using our dual approach on Murty's original problem, we have been able to solve large problems (1840 integer variables) with very modest computational effort. The main feature of our approach is the idea of using the current evaluation of the dual problem to produce a good feasible solution to the primal problem. In turn, the availability of good feasible solutions to the primal makes it possible to use a very simple subgradient algorithm to solve the dual effectively.