Fourth-order finite-difference method for boundary value problems with two small parameters

We present a finite difference scheme for a class of linear singularly perturbed boundary value problems with two small parameters. The problem is discretized using a Bakhvalov-type mesh. It is proved under certain conditions that this scheme is fourth-order accurate and that its error does not increase when the perturbation parameter tends to zero. Numerical examples are presented which demonstrate computationally the fourth order of the method.     

一个对偶问题与对偶性质

本文对非可微凸规划问题建立了一个新的对偶问题 ,并证明其对偶性质 ,如弱对偶性 ,强对偶性及逆对偶性。     

ANTI-PERIODIC BOUNDARY VALUE PROBLEM FOR FUNCTIONAL DIFFENERTIAL EQUATION

By using upper and lower solutions coupled with monotone iterative technique, we discuss the anti-periodic boundary value problem for first order functional diffenertial equation. A sufficient condition for the existence of the solution is obtained.     

三阶奇摄动非线性边值问题

利用微分不等式理论,研究了某一类三阶奇摄动非线性边值问题。以二阶边值问题的已知结果为基础,引入Volterra型积分算子,建立了三阶非线性边值问题的上下解方法。在适当条件下,构造出具体的上下解,得出解的存在性和渐进估计。结果表明这种技巧也为三阶奇摄动边值问题的研究提出了崭新的思路。最后举例验证文中定理的正确性。     

一类四点边值问题的多个对称正解

研究了一类具p-Laplace算子的二阶四点边值问题,利用锥上的不动点定理得到该类问题对称正解的存在性,建立了所研究问题至少存在三个对称正解的充分条件.     

A hybrid tabu search/branch & bound approach to solving the generalized assignment problem

A new approach for solving the generalized assignment problem (GAP) is proposed that combines the exact branch & bound approach with the heuristic strategy of tabu search (TS) to produce a hybrid algorithm for solving GAP. The algorithm described uses commercial software to solve sub-problems generated by the TS guiding strategy. The TS approach makes use of the concept of referent domain optimisation and introduces novel add/drop strategies. In addition, the linear programming relaxation of GAP that forms part of the branch & bound approach is itself helpful in suggesting which variables might take binary values. Computational results on benchmark test instances are presented and compared with results obtained by the standard branch & bound approach and also several other heuristic approaches from the literature. The results show the new algorithm performs competitively against the alternatives and is able to find some new best solutions for several benchmark instances.     

Galois averages

In this paper, we introduce a notion of “Galois average” which allows us to give a suitable answer to the question: how can one extend a finite Galois extension E/F by a prime degree extension N/E to get a Galois extension N/F? Here, N/E is not necessarily a Kummer extension.     

A NEW INEXACT SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM

This paper represents an inexact sequential quadratic programming (SQP) algorithm which can solve nonlinear programming (NLP) problems. An inexact solution of the quadratic programming subproblem is determined by a projection and contraction method such that only matrix-vector product is required. Some truncated criteria are chosen such that the algorithm is suitable to large scale NLP problem. The global convergence of the algorithm is proved.