Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

无穷矩阵拓扑代数的理想(Ⅰ)(英文)

本文给出了所有弱紧算子 ,强紧算子 ,Mackey紧算子 ,构成无穷矩阵拓扑下相同紧集的特征的刻画 .     

Existence, Multiplicity and Infinite Solvability of Positive Solutions for One-Dimensional p-Laplacian

The existence, multiplicity and infinite solvability of positive solutions are established for some two-point boundary value problems of one-dimensional p-Laplacian. In this paper, by multiplicity we mean the existence of m solutions, where m is an arbitrary natural number.     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

一类求解线性约束非线性规划问题的可行方向法

Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。     

Nonturnpike Optimal Solutions and Their Approximations in Infinite Horizon

Recently, the authors have proposed a new necessary and sufficient condition for turnpike optimality in calculus of variations with singular Euler equation. The method is based on a characterization of the value function and generalizes the well known method based on the Green theorem. Furthermore, it allows the optimality of a competition between several turnpikes to be characterized. For a class of such problems not enjoying the turnpike property, we give an explicit formula for the value function and show how to characterize the optimal solution as the limiting solution of a family of perturbed problems satisfying the turnpike property. The considered problems are scalar with infinite horizon.     

Infinite propagation speed of the Camassa-Holm equation

We use the inverse scattering transform to show that a solution of the Camassa-Holm equation is identically zero whenever it vanishes on two horizontal half-lines in the x-t space. In particular, a solution that has compact support at two different times vanishes everywhere, proving that the Camassa-Holm equation has infinite propagation speed.     

SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A Kind of direct methods is presented for the solution of optimal control problems with state constraints.These methods are sequential quadratic programming methods.At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and Linear approximations to constraints is solved to get a search direction for a merit function.The merit function is formulated by augmenting the Lagrangian funetion with a penalty term.A line search is carried out along the search direction to determine a step length such that the merit function is decreased.The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadrade programming methods.