资源有限的加权总完工时间单机排序问题

本讨论资源有限的加权总工时间单机排序问题，对现在仍为OPEN问题1｜pj=bj-ajuj，∑uj≤U｜∑wjCj给出了一个有关最优解中最优资源分配的重要性质，并利用该性质分别给出了三种情况bj=b,wj=w,aj=a；bj=b,wj=w,uj=u；aj=a,wj=w,uj=u的最优算法。     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

3-正则图的分割问题是NP-完全问题

证明了3-正则图的最小平分问题和最小α-分割问题都是NP-完全问题.     

工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

NECESSARY CONDITIONS FOR OPTIMAL CONTROLS OF SEMILINEAR ELLIPTIC VARIATIONAL INEQUALITIES INVOLVING STATE CONSTRAINT

This paper deals with maximum principle for some optimal control problem governed by some elliptic variational inequalities. Some state constraints are discussed. The basic techniques used here are based on those in [1] and a new penalty functional defined in this paper.     

Determination of the arc-root position in a DC plasma torch

The behavior of an arc operated in the nontransferred mode with a conical-shaped cathode and a nozzle-shaped anode is studied by applying general tyro-dimensional conservation equations and auxiliary relations for the simulation of arc channel flows. The position of the arc-root attachment at the anode surface is determined by using Steenbeck's minimum principle, which postulates a minimum arc voltage for a given current and certain given boundary conditions. The overall effects of the anode-arc root on the plasma flow are, studied by comparing the results with those of the transferred mode of operation. Specific arc-channel diameters are chosen in the simulation in order to verify flit, numerical model through comparisons with experimental results. The results show that Steenbeck's minimum principle is useful for determining the position of the arc-root attachment at the anode surface. Application of this method for control of the arc-anode attachment may be valuable in the design and operation of plasma spray torches to avoid jet instabilities.     

Normalization and Fermi–Coulomb and Coulomb hole sum rules for approximate wave functions

For approximate wave functions, we prove the theorem that there is a one‐to‐one correspondence between the constraints of normalization and of the Fermi–Coulomb and Coulomb hole charge sum rules at each electron position. This correspondence is surprising in light of the fact that normalization depends on the probability of finding an electron at some position. In contrast, the Fermi–Coulomb hole sum rule depends on the probability of two electrons staying apart because of correlations due to the Pauli exclusion principle and Coulomb repulsion, while the Coulomb hole sum rule depends on Coulomb repulsion. We demonstrate the theorem for the ground state of the He atom by the use of two different approximate wave functions that are functionals rather than functions. The first of these wave function functionals is constructed to satisfy the constraint of normalization, and the second that of the Coulomb hole sum rule for each electron position. Each is then shown to satisfy the other corresponding sum rule. The significance of the theorem for the construction of approximate “exchange‐correlation” and “correlation” energy functionals of density functional theory is also discussed. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented. An erratum to this article is available at .