Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

A note on the necessary conditions for the algebraic Riccati equation

We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived.     

The Classification and Realization of Complete Lie Algebras with Commutative Nilpotent Radicals

in this paper, the classification and realization of complete Lie algebras withcommutative nilpotent radicals are given. From this, some results on the radicals of thesecomplete Lie algebras are obtained.     

量子计算与超冷离子

通过介绍量子计算的基本概念和特点，并对比目前人们使用的计算机的计算方式，对于如何利用囚禁在离子阱中的超冷离子进行量子计算作了简要的叙述．     

Banach空间上的框架与Riesz基

本文讨论Banach空间上框架、无冗框架与Riesz基之间的关系及它们的稳定性．     

对摩擦力作功与摩擦生热的量度的认识

本文通过对摩擦力作功与不擦生热的讨论，给出摩擦生热的量度方法．     

用相位调制方法测量光盘盘基应力双折射的精度分析

偏振相位调制方法是测量微小双折射的一种高精度检测方法。本文系统全面地分析了以ＰＭＣＳＡ结构形式测量光盘盘基应力双折射的相位调制方法中，由各种误差源造成的对测试结果的影响。     

Computation of confined coflow jets with three turbulence models

A numerical study of confined jets in a cylindrical duct is carried out to examine the performance of two recently proposed turbulence models: an RNG-based K-? model and a realizable Reynolds stress algebraic equation model. The former is of the same form as the standard K-? model but has different model coefficients. The latter uses an explicit quadratic stress-strain relationship to model the turbulent stresses and is capable of ensuring the positivity of each turbulent normal stress. The flow considered involves recirculation with unfixed separation and reatachment points and severe adverse pressure gradients, thereby providing a valuable test of the predictive capability of the models for complex flows. Calculations are performed with a finite volume procedure. Numerical credibility of the solutions is ensured by using second-order-accurate differencing schemes and sufficiently fine grids. Calculations with the standard K-? model are also made for comparison. Detailed comparisons with experiments show that the realizable Reynolds stress algebraic equation model consistently works better than does the standard K-? model in capturing the essential flow features, while the RNG-based K-? model does not seem to give improvements over the standard K-? model under the flow conditions considered.