面向靠桥率及道口冲突率的航班-机位指派问题优化模型及其启发式算法研究

在给定航班时刻表条件下,对于进出港航班的机位分配,除了必须满足航班、飞机和机位之间的技术性要求之外,还要考虑尽量提高整个机场的机位利用率,且方便旅客出入港及时、安全和便捷.文章以飞机机型、所属航空公司、客运/货运航班、国内/国际航班等匹配条件为约束条件,以航班-机位分配完成率、靠桥率、道口非冲突率为目标,建立了一个航班...     

New results on a class of exact augmented Lagrangians

In this paper, a new continuously differentiable exact augmented Lagrangian is introduced for the solution of nonlinear programming problems with compact feasible set. The distinguishing features of this augmented Lagrangian are that it is radially unbounded with respect to the multiplier and that it goes to infinity on the boundary of a compact set containing the feasible region. This allows one to establish a complete equivalence between the unconstrained minimization of the augmented Lagrangian on the product space of problem variables and multipliers and the solution of the constrained problem.The author wishes to thank Dr. L. Grippo for having suggested the topic of this paper and for helpful discussions.     

Legendre Transformation for Regularizable Lagrangians in Field Theory

Hamilton equations based not only upon the Poincaré–Cartan equivalent of a first-order Lagrangian, but also upon its Lepagean equivalent are investigated. Lagrangians which are singular within the Hamilton–De Donder theory, but regularizable in this generalized sense are studied. Legendre transformation for regularizable Lagrangians is proposed and Hamilton equations, equivalent with the Euler–Lagrange equations, are found. It is shown that all Lagrangians affine or quadratic in the first derivatives of the field variables are regularizable. The Dirac field and the electromagnetic field are discussed in detail.     

A Note on Symplectic Algorithm

We present the symplectic algorithm in the Lagrangian formalism for the Hamiltonian systems by virtue of the noncommutative differential calculus with respect to the discrete time and the Euler-Lagrange cohomological concepts. We also show that the trapezoidal integrator is symplectic in certain sense.``     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

非完整约束奇异广义力学系统的Poincaré-Cartan积分

对受高阶微商非完整约束并用奇异Lagrange量描述的广义力学系 统，基于广义Apell-Четаев约束条件，并考虑到系统的内在约束，导出了该非完整 约 束奇异广义力学系统的广义Poincaré-Cartan积分不变量. 并证明了该不变量与非完整约束 奇异广义力学系统的广义正则方程等价.     

High-Order Hamilton＇s Principle and the Hamilton＇s Principle of High-Order Lagrangian Function

In this paper, based on the theorem of the high-order velocity energy, integration and variation principle, the high-order Hamilton＇s principle of general holonomic systems is given. Then, three-order Lagrangian equations and four-order Lagrangian equations are obtained from the high-order Hamilton＇s principle. Finally, the Hamilton＇s principle of high-order Lagrangian function is given.