复域复合函数方程组解的极点与增长级

研究了几类复域复合函数方程组解的极点与增长级问题,得到关于这些方程组解的Nevanlinna下级,极点的计数函数以及其最大模的下界的一些估计,进一步推广了高凌云等人的结果.     

涉及导函数与分担函数的全纯函数正规定则

针对一类零点个数为有限的全纯函数族,在函数与其导函数分担一个极点均为重级的亚纯函数的条件下,利用Nevanlinna理论及其方法改进了已有文献在分担值条件下得到的一个定理.     

带关联的双层多目标决策研究

本文研究是线性的双层多目标决策.根据线性规划的对偶理论证明了双层多目标决策的可行集的连通性;利用s*-最优均衡解的概念,求得双层多目标规划的偏好满意解;最后,我们得到了满意解的有效性,并在极点得到.     

一类亚纯函数系数微分方程的复振荡

研究了系数函数是有限个极点的亚纯函数的高阶慢增长系数线性微分方程,得到了当方程系数受到很小的扰动时其解的复振荡的一个结果.推广了Alotaibi等作者的结果.     

一类亚纯系数微分方程解的复振荡

本文研究了当A(z)为有理函数,E(z)为亚纯函数时,k阶非齐次线性微分方程 f~(k)+AF=E(z) 的亚纯函数解f(z)的复振荡问题,得到在一定条件下,方程解的零点序列与极点序列的收敛指数的精确估计。     

一类亚纯系数微分方程解的复振荡

本文研究了当 A(s)为有理函数,E(z)为亚纯函数时,k 阶非齐次线性微分方程f~(k)+Af=E(z)的亚纯函数解 f(z)的复振荡问题,得到在一定条件下,方程解的零点序列与极点序列的收敛指数的精确估计.     

一类亚纯函数系数线性微分方程亚纯解的增长级

该文讨论了齐次线性微分方程f~(k)+A_(k-1)f~(k-1)+…+Aof=0,k≥2的解的增长级,其中方程的系数为至多有有限多个极点的亚纯函数,在一定条件下,得到了方程亚纯解的精确估计,这也是Gundersen、陈宗煊和高仕安等人在整函数系数下结果的推广.     

模糊多目标半定规划的最优性条件

将模糊集理论应用到多目标半定规划中来,提出了有约束的模糊多目标半定规划模型,并首次给出了其最优有效解的定义.通过构造确定的隶属度函数,将以矩阵为决策变量的模糊多目标半定规划转化为一种目标函数的某些分量由约束函数决定的确定性多目标半定规划,并证明了前者最优有效解与后者有效解的一致性.在此基础之上,讨论了二者的最优性条件.     

用改进的代数方法构造(2+1)维ZK-MEW方程的精确行波解

利用一种改进的统一代数方法将构造(2+1)维ZK-MEW((2+1)-dimensional Zakharov-Kuznetsov modified equal width)方程精确行波解的问题转化为求解一组非线性的代数方程组。再借助于符号计算系统Mathematica求解所得到的非线性代数方程组,最终获得了方程的多种形式的精确行波解。其中包括有理解,三角函数解,双曲函数解,双周期Jacobi椭圆函数解,双周期Weierstrass椭圆形式解等。并给出了部分解的图形。     

双层规划问题基于对偶理论的遗传算法

针对下层为线性规划的非线性双层规划问题，提出了一种基于下层对偶理论的遗传算法。首先利用下层对偶问题可行域的极点对上层变量的取值域进行划分，使得每一个划分区域对应一个极点。根据原一对偶问题最优解的关系，确定每个划分区域对应的下层最优解。其次利用罚函数方法处理了上层约束，设计了一个依赖于种群变化的动态罚因子。对20个测试问题的数值结果表明，所提出的算法是可行有效的。     

An achievement rate approach to linear programming problems with an interval objective function

In this paper, we focus on a treatment of a linear programming problem with an interval objective function. From the viewpoint of the achievement rate, a new solution concept, the maximin achievement rate solution, is proposed. Nice properties of this solution are shown: a maximin achievement rate solution is necessarily optimal when a necessarily optimal solution exists, and if not, then it is still a possibly optimal solution. An algorithm for a maximin achievement rate solution is proposed based on a relaxation procedure together with a simplex method. A numerical example is given to demonstrate the proposed solution algorithm.     

Sequential Linear-Quadratic Method for Differential Games with Air Combat Applications

We present a numerical method for computing a local Nash (saddle-point) solution to a zero-sum differential game for a nonlinear system. Given a solution estimate to the game, we define a subproblem, which is obtained from the original problem by linearizing its system dynamics around the solution estimate and expanding its payoff function to quadratic terms around the same solution estimate. We then apply the standard Riccati equation method to the linear-quadratic subproblem and compute its saddle solution. We then update the current solution estimate by adding the computed saddle solution of the subproblem multiplied by a small positive constant (a step size) to the current solution estimate for the original game. We repeat this process and successively generate better solution estimates. Our applications of this sequential method to air combat simulations demonstrate experimentally that the solution estimates converge to a local Nash (saddle) solution of the original game.     

A note on the Helmholz oscillator

The possible existence of a potentially chaotic soliton solution of an unperturbed classical oscillator is investigated. It is shown that in general the solution of the so-called “Helmholz oscillator” is a periodic solution. Special solutions are also found where a localized soliton solution or a decaying solution is obtained depending on the initial conditions.     

一类拟线性常微分方程的多解

说明一类拟线性特征值问题有两个正解;一个大解,一个小解。同时本也证明小解是一个山路解当参数大时发展成为尖解。     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

Periodic solutions in n dimensions and Volterra equations

If a nonlinear autonomous n-dimensional system of ordinary differential equations has a bounded solution with a certain uniform stability property, this solution approaches an almost periodic solution with the same stability property. (More precisely, the almost periodic solution is in the set of ω-limit points of the given solution.) If the bounded solution has, in addition to the uniform stability property, an asymptotic stability property, then the solution approaches a periodic solution with the same stability properties. Practical (i.e., computable) sufficient conditions for boundedness of solutions are obtained. The results are applied to generalized Volterra equations.     

AF—代数的闭的Jordan理想

讨论AF-代数的闭的Jordan理想。我们证明了AF-代灵敏的一个闭的子集是其一Jordan理想的充分必要条件是它是一个结合理想。     

Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients

The current paper focuses on a multiobjective linear programming problem with interval objective functions coefficients. Taking into account the minimax regret criterion, an attempt is being made to propose a new solution i.e. minimax regret solution. With respect to its properties, a minimax regret solution is necessarily ideal when a necessarily ideal solution exists; otherwise it is still considered a possibly weak efficient solution. In order to obtain a minimax regret solution, an algorithm based on a relaxation procedure is suggested. A numerical example demonstrates the validity and strengths of the proposed algorithm. Finally, two special cases are investigated: the minimax regret solution for fixed objective functions coefficients as well as the minimax regret solution with a reference point. Some of the characteristic features of both cases are highlighted thereafter.     

A bifurcation phenomenon in a singularly perturbed two-phase free boundary problem of phase transition

In this paper, we prove a bifurcation phenomenon in a two-phase, singularly perturbed, free boundary problem of phase transition. We show that the uniqueness of the solution for the two-phase problem breaks down as the boundary data decreases through a threshold value. For boundary values below the threshold, there are at least three solutions, namely, the harmonic solution which is treated as a trivial solution in the absence of a free boundary, a nontrivial minimizer of the functional under consideration, and a third solution of the mountain-pass type. We classify these solutions according to the stability through evolution. The evolution with initial data near a stable solution, such as the trivial harmonic solution or a minimizer of the functional, converges to the stable solution. On the other hand, the evolution deviates away from a non-minimal solution of the free boundary problem.     

(2+1)维AKNS方程的行波解研究(英文)

Based on the travelling wave method, a(2 + 1)-dimensional AKNS equation is considered. Elliptic solution and soliton solution are presented and it is shown that the soliton solution can be reduced from the elliptic solution. It also proves that the result is consistent with the soliton solution of simplify Hirota bilinear method by Wazwaz and illustrate the solution are right travelling wave solution.