空中加油问题的递推模型与调度策略

首先对空中加油问题进行了分析,提取了相关性质,在此基础上建立了问题的递推模型.根据该模型,提出了一种启发式搜索算法.该算法计算复杂度低,适用性好.对应于辅机是否可以多次起飞,该算法分为两子算法.对这两种不同情况下的具体问题,设计了相关的优化函数.所有算法都在计算机中运行,并得到了相应结果.值得指出的是,提出的启发式搜索算法十分高效.对于问题1和问题2,该算法所得解是约束条件下的最优调度策略.对于问题3,问题4,问题5,该算法所得解逼近最优调度策略.     

关于未解决的一个不等式问题的注记(英文)

文[6]中,F.Qi提出了一个未解决的不等式问题.本文给出了此问题的答案和进一步的拓广,同时也得到了该问题的反向不等式.     

基于遗传算法的大学课程表问题研究

课程表问题是时间表问题之一 ,也是 NP难问题 .根据大学授课形式的特点建立了大学课程表问题的数学模型 ,给出了求解该问题的遗传算法 .根据模型和大学课程表问题的特点设计了一种全新的编码 ,提出了一种新形式的交叉方式 .实验结果表明该方法是可行和有效的 .     

一类具有跳跃层的非线性反应扩散系统的渐近行为

讨论了一类具有跳跃层的反应扩散系统.首先,求出了问题的外部解.其次,引入伸长变量,构造了跳跃层校正项.最后,利用微分不等式理论,得到了原问题解的一致有效的渐近展开式.从而研究了相应问题的解的渐近性态.     

探井布局问题的遗传算法

首先建立探井布局问题的数学模型 .其次基于所建立的数学模型 ,给出了求解探井布局问题的遗传算法 ,并就一个具体问题进行了计算 .计算结果表明 ,用遗传算法求解探井布局问题耗时少 ,适应性好 ,且对于处理大规模的探井布局问题十分有效 .     

学生面试问题的一个解法

研究的是自主招生的面试安排问题.它与一个经典问题(Steiner System问题)有很紧密的联系.首先我们形式化地提出了这个问题,并针对问题提出了3种算法.值得一提的是,我们提出的同余构造算法在时间复杂度较低的情况下,具有很高的近似比(强于FPTAS).对于文理分科的情况,我们同样在形式化地提出问题之后,给出了相应的算法.我们编写程序实现了所述的算法.     

半空间的热弹性问题——弹性通解方法的应用

本文基于弹性力学的通解,求解了半空间的热弹性问题.这种解法对于轴对称问题及半平面问题特别有效.应用这种解法我们对几种典型的热弹性半空间问题进行了求解.     

一类具有转移条件的向量Sturm-Liouville问题的特征值

考虑了一类具有转移条件的向量Sturm-Liouville问题的特征值及其重数问题.首先构造了与问题相关的新内积和基本解,得到特征值的充要条件.在此基础上证明了二维情况下,问题特征值的代数重数与几何重数相等.     

齐次Neumann边界条件非线性抛物方程解的爆破时间的下界

研究了非线性抛物方程具有齐次Neumann边界条件问题解的爆破.在对问题中的f,ρ和g作出适当的假设的前提下,推导出了上述问题解的爆破时间的下界.同时,也得到了问题的解不发生爆破的条件.     

一类耦合的有限元-边界元变分不等式的预条件子

本文主要研究一类Signorini 接触条件的非线性传输问题. 这类问题可以用耦合的有限元- 边界元变分不等式来描述. 我们首先提出一种求解变分不等式的预处理梯度投影法. 然后对离散系统构造了有效的区域分解预条件子. 该预条件子能够使耦合的不等式问题分解成等式问题和小规模的不等式问题, 并且这些问题可以并行求解. 最后我们详细研究了该迭代方法的收敛性.     

用非线性方程组求解等式约束非线性规划问题的降维算法

本文研究线性和非线性等式约束非线性规划问题的降维算法.首先,利用一般等式约束问题的降维方法,将线性等式约束非线性规划问题转换成一个非线性方程组,解非线性方程组即得其解;然后,对线性和非线性等式约束非线性规划问题用Lagrange乘子法,将非线性约束部分和目标函数构成增广的Lagrange函数,并保留线性等式约束,这样便得到一个线性等式约束非线性规划序列,从而,又将问题转化为求解只含线性等式约束的非线性规划问题.     

非线性特征值问题的二次近似方法

本文研究求解非线性特征值问题的数值方法.基于矩阵值函数的二次近似,将非线性特征值问题转化为二次特征值问题,提出了求解非线性特征值问题的逐次二次近似方法,分析了该方法的收敛性.结合求解二次特征值问题的Arnoldi方法和Jacobi-Davidson方法,给出求解非线性特征值问题的一些二次近似方法.数值结果表明本文所给算法是有效的.     

Solution Sets of Quadratic Complementarity Problems

In this paper, we study quadratic complementarity problems, which form a subclass of nonlinear complementarity problems with the nonlinear functions being quadratic polynomial mappings. Quadratic complementarity problems serve as an important bridge linking linear complementarity problems and nonlinear complementarity problems. Various properties on the solution set for a quadratic complementarity problem, including existence, compactness and uniqueness, are studied. Several results are established from assumptions given in terms of the comprising matrices of the underlying tensor, henceforth easily checkable. Examples are given to demonstrate that the results improve or generalize the corresponding quadratic complementarity problem counterparts of the well-known nonlinear complementarity problem theory and broaden the boundary knowledge of nonlinear complementarity problems as well.     

Probability-one homotopies in computational science

Probability-one homotopy algorithms are a class of methods for solving nonlinear systems of equations that, under mild assumptions, are globally convergent for a wide range of problems in science and engineering. Convergence theory, robust numerical algorithms, and production quality mathematical software exist for general nonlinear systems of equations, and special cases such as Brouwer fixed point problems, polynomial systems, and nonlinear constrained optimization. Using a sample of challenging scientific problems as motivation, some pertinent homotopy theory and algorithms are presented. The problems considered are analog circuit simulation (for nonlinear systems), reconfigurable space trusses (for polynomial systems), and fuel-optimal orbital rendezvous (for nonlinear constrained optimization). The mathematical software packages HOMPACK90 and POLSYS_PLP are also briefly described.     

Sous-solutions d'équations elliptiques dans L1

We study subsolutions for semilinear elliptic boundary value problems in L1. We consider as well nonlinear as linear boundary conditions. The nonlinear functions may be multivated. We characterize in terms of p.d.e. the subsolutions defined by a nonlinear functional analysis argument. Applications are given to obtain existence results for semilinear elliptic boundary value problems and comparison and estimates for nonlinear parabolic boundary value problems.     

A sparse nonlinear optimization algorithm

One of the most effective numerical techniques for solving nonlinear programming problems is the sequential quadratic programming approach. Many large nonlinear programming problems arise naturally in data fitting and when discretization techniques are applied to systems described by ordinary or partial differential equations. Problems of this type are characterized by matrices which are large and sparse. This paper describes a nonlinear programming algorithm which exploits the matrix sparsity produced by these applications. Numerical experience is reported for a collection of trajectory optimization problems with nonlinear equality and inequality constraints.The authors wish to acknowledge the insightful contributions of Dr. William Huffman.     

奇异非线性边值问题的经典Agarwal-O'Regan方法

改进了奇异非线性边值问题的经典Agarwal-O'Regan方法.利用这个改进的方法建立了奇异非线性(p,n-p)共轭边值问题正解的局部存在性与多解性,其中允许非线性项关于时间和空间变元同时奇异.主要工具是锥拉伸与锥压缩型的Guo-Krasnosel'skii不动点定理和精确先验估计技巧.特别的,考察了非自治奇异非线性二阶、三阶、四阶共轭边值问题.     

结构动力学逆特征值问题的同伦解法

将结构动力学反问题视为拟乘法逆特征值问题,利用求解非线性方程组的同伦方法来解决结构动力学逆特征值问题,这种方法由于沿同伦路径求解,对初值的选取没有本质的要求,算例说明了这种方法是可行的．     

Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.     

New fixed point theorems for mixed monotone operators and local existence-uniqueness of positive solutions for nonlinear boundary value problems

In this article we present a new fixed point theorem for a class of general mixed monotone operators, which extends the existing corresponding results. Moreover, we establish some pleasant properties of nonlinear eigenvalue problems for mixed monotone operators. Based on them the local existence-uniqueness of positive solutions for nonlinear boundary value problems which include Neumann boundary value problems, three-point boundary value problems and elliptic boundary value problems for Lane-Emden-Fowler equations is proved. The theorems for nonlinear boundary value problems obtained here are very general.