A nonlinear eigenvalue problem

We reduce the problem of the zeros of an entire function related to the Painlevé I equation to the eigenvalue problem for the Dirichlet problem for a fourth-order bilinear equation. In a simplified case, this problem reduces to the problem of the position of the zeros of theta functions. We then apply the developed general method to the inverse scattering problem. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 157, No. 2, pp. 175–187, November, 2008.     

ASYMPTOTIC BEHAVIOR OF A STOCHASTIC EVOLUTION PROBLEM IN A VARYING DOMAIN

We study the asymptotic behaviour of the initial boundary value problem for a stochastic partial differential equation in a sequence of perforated domains. We prove that the sequence of solutions of the problem converges in appropriate topologies to the solution of a limit stochastic initial boundary value problem of the same type as the original problem, but containing an additional term expressed in terms of some characteristics of the perforated domain.     

广义双正则函数的非线性带位移边值问题

本文研究Ｃｌｉｆｆｏｒｄ分析中的广义双正则函数及其一类非线性带Ｈａｓｅｍａｎ位移的边 值问题．通过积分变换将边值问题转化成积分方程问题，借助于积分方程理论和不动点 定理证明了边值问题解的存在性并给出了解的积分表示式．     

一个修正的罚函数方法

本文通过给出的一个修正的罚函数,把约束非线性规划问题转化为无约束非线性规划问题.我们讨论了原问题与相应的罚问题局部最优解和全局最优解之间的关系,并给出了乘子参数和罚参数与迭代点之间的关系,最后给出了一个简单算法,数值试验表明算法是有效的.     

A Wildlife Management Problem: A Case Study in Multiple-Objective Linear Programming

A linear programming problem is presented to solve a problem in determining how many herbivores are needed to stock a small game reserve. The resulting problem has several conflicting objectives. The interactive algorithm which was used to solve the problem is then outlined. The interactive approach is then applied to the problem in order to find a satisfactory solution. Certain ad hoc improvisations which were needed in the final stages are outlined.     

A RIEMANN-HILBERT PROBLEM IN A RIEMANN SURFACE

One of the inspirations behind Peter Lax’s interest in dispersive integrable systems, as the small dispersion parameter goes to zero, comes from systems of ODEs discretizing 1-dimensional compressible gas dynamics [17]. For example, an understanding of the asymptotic behavior of the Toda lattice in different regimes has been able to shed light on some of von Neumann’s conjectures concerning the validity of the approximation of PDEs by dispersive systems of ODEs. Back in the 1990s several authors have worked on the long time asymptotics of the Toda lattice [2, 7, 8, 19]. Initially the method used was the method of Lax and Levermore [16], reducing the asymptotic problem to the solution of a minimization problem with constraints (an "equilibrium measure" problem). Later, it was found that the asymptotic method of Deift and Zhou (analysis of the associated Riemann-Hilbert factorization problem in the complex plane) could apply to previously intractable problems and also produce more detailed information. Recently, together with Gerald Teschl, we have revisited the Toda lattice; instead of solutions in a constant or steplike constant background that were considered in the 1990s we have been able to study solutions in a periodic background. Two features are worth noting here. First, the associated Riemann-Hilbert factorization problem naturally lies in a hyperelliptic Riemann surface. We thus generalize the Deift-Zhou "nonlinear stationary phase method" to surfaces of nonzero genus. Second, we illustrate the important fact that very often even when applying the powerful Riemann-Hilbert method, a Lax-Levermore problem is still underlying and understanding it is crucial in the analysis and the proofs of the Deift-Zhou method!     

双正侧函数的非线性带位移边值问题

Ｃｌｉｆｆoｒｄ分析中的双正则函数是一类广义正则函数,它的研究是近年来函数论领域内的一个热门分支,本文研究双正则函数的非线性带位移的边值问题．设计积分算子,将边值问题转化成积分方程问题,借助于积分方程理论和Ｓｃｈａｕｄｅｒ不动点理论证明了边值问题解的存在性并给出了解的积分表达式．     

A DUAL NON-LINEAR PROGRAM

In the paper a dual of a nonlinear fractional functional programming problem has beenformulated.This problem can be used to obtain a solution of the mixed 0—1 integer linearprogramming problem.Some properties related to the primal and dual have been given.     

ON SOLVABILITY OF A BOUNDARY VALUE PROBLEM FOR A NONHOMOGENEOUS BIHARMONIC EQUATION WITH A BOUNDARY OPERATOR OF A FRACTIONAL ORDER

This paper is concerned with the solvability of a boundary value problem for a nonhomogeneous biharmonic equation. The boundary data is determined by a differential operator of fractional order in the Riemann-Liouville sense. The considered problem is a generalization of the known Dirichlet and Neumann problems.     

2010年研究生数学建模竞赛A题综述

第七届全国研究生数学建模竞赛A题是生物信息学中的一个急需解决的问题.虽然有关问题的研究已经经历了十多年,但由于问题的复杂性,人们的认识还很局限,基本的结论大多还以定性的为主,定量的探讨正方兴未艾.对参赛队员来讲解决该问题是一个极大的挑战.研究生们在讨论该问题时,大多直接进行分类.然而对于一个小样本的学习问题,显然这样做是行不通的.所以问题的关键是从数学和生物学角度减少用于分类的特征数目.同时,对于获取的基因标签,需要从临床上或生物学角度找到验证.该问题的求解过程引导研究生们从数学建模走向解决实际问题.     

一种新的向量互补问题

本文在实局部凸空间中引入了一种新的向量互补问题,这一向量互补问题不仅包含了由Ｙｕ和Ｙａｏ提出的广义向量互补问题由Ｃｈｅｎ和Ｙａｎｇ定义的弱向量互补问题,而且还包含了Ｉｓａｃ意义下的隐互补问题。本文还讨论了新的向量互补问题,向量变分不等式,向量单向极小化问题和最小元问题之间的关系,给出了这一向量互补问题解的存在定理。     

A generalized bottleneck assignment problem

A solution procedure is presented for a generalization of the standard bottleneck assignment problem in which a secondary criterion is automatically provided. A partitioning problem is modeled by this bottleneck problem to provide an example of its application.     

A Multi-Period Renewal equipment problem

This paper looks at a Multi-Period Renewal equipment problem (MPR). It is inspired by a specific real-life situation where a set of hardware items is to be managed and their replacement dates determined, given a budget over a time horizon comprising a set of periods. The particular characteristic of this problem is the possibility of carrying forward any unused budget from one period to the next, which corresponds to the multi-periodicity aspect in the model. We begin with the industrial context and deduce the corresponding knapsack model that is the subject of this paper. Links to certain variants of the knapsack problem are next examined. We provide a study of complexity of the problem, for some of its special cases, and for its continuous relaxation. In particular, it is established that its continuous relaxation and a special case can be solved in (strongly) polynomial time, that three other special cases can be solved in pseudo-polynomial time, while the problem itself is strongly NP-hard when the number of periods is unbounded. Next, two heuristics are proposed for solving the MPR problem. Experimental results and comparisons with the Martello&Toth and Dantzig heuristics, adapted to our problem, are provided.     

一类二阶段指派问题

经典的指派问题是研究资源与任务的二元匹配。作为推广,三维指派问题是研究资源、任务与作业的三元匹配。前者已有成熟的有效算法,后者是著名的NP困难问题。本文讨论介于二者之间的一类二阶段指派问题,即可分解为二阶段决策的特殊三维匹配问题,给出多项式时间算法。     

A school bus scheduling problem

This paper introduces a school bus scheduling problem wherein trips for each school are given. A trip consists of a sequence of bus stops and their designated school. Each school has its fixed time window within which trips should be completed. A school bus can serve multiple trips for multiple schools. The school bus scheduling problem seeks to optimize bus schedules to serve all the given trips considering the school time windows. We first model the problem as a vehicle routing problem with time windows (VRPTW) by treating a trip as a virtual stop. Two assignment problem based exact approaches are then proposed for special cases and a heuristic algorithm is proposed for more general cases. Benchmark problems and computational experiments are presented. Computational experiments show the effectiveness of the proposed approaches.     

A generalized knapsack problem with variable coefficients

The ordinary knapsack problem is to find the optimal combination of items to be packed in a knapsack under a single constraint on the total allowable resources, where all coefficients in the objective function and in the constraint are constant.In this paper, a generalized knapsack problem with coefficients depending on variable parameters is proposed and discussed. Developing an effective branch and bound algorithm for this problem, the concept of relaxation and the efficiency function introduced here will play important roles. Furthermore, a relation between the algorithm and the dynamic programming approach is discussed, and subsequently it will be shown that the ordinary 0–1 knapsack problem, the linear programming knapsack problem and the single constrained linear programming problem with upper-bounded variables are special cases of the interested problem. Finally, practical applications of the problem and its computational experiences will be shown.     

The Vehicle Routing-Allocation Problem: A unifying framework

Summary In this paper the Vehicle Routing-Allocation Problem (VRAP) is presented. In VRAP not all customers need be visited by the vehicles. However customers not visited either have to be allocated to some customer on one of the vehicle tours or left isolated. We concentrate our discussion on the Single Vehicle Routing-Allocation Problem (SVRAP). An integer linear programming formulation of SVRAP is presented and we show how SVRAP provides a unifying framework for understanding a number of the papers and problems presented in the literature. Specifically the covering tour problem, the covering salesman problem, the median tour problem, the maximal covering tour problem, the travelling salesman problem, the generalised travelling salesman problem, the selective travelling salesman problem, the prize collecting travelling salesman problem, the maximum covering/shortest path problem, the maximum population/shortest path problem, the shortest covering path problem, the median shortest path problem, the minimum covering/shortest path problem and the hierarchical network design problem are special cases/variants of SVRAP.     

A Stability Theorem for Constrained Optimal Control Problems

This paper presents the stability of difference approximations of an optimal control problem for a quasilinear parabolic equation with controls in the coefficients, boundary conditions and additional restrictions. The optimal control problem has been convered to one of the optimization problem using a penalty function technique. The difference approximations problem for the considered problem is obtained. The estimations of stability of the solution of difference approximations problem are proved. The stability estimation of the solution of difference approximations problem by the controls is obtained.     

A Modified Regularization Method

We consider the Cauchy problem for the systems of the first-order ordinary differential equations with a small parameter E of degree q at the derivative. We study the possibility of solving this problem by means of the regularization method of the Lomov theory of singular perturbations. We show that, for q>1, an application of the procedure by Lomov leads only to the trivial solution to the problem in the class of resonance-free solutions. We suggest and describe a modification of the procedure which enables us to construct a nontrivial solution to the problem in the space of resonance-free solutions.     

高阶复合方程的连值问题

本文研究高阶复合方程基于能量不等式和生成算子的稠密性，证明了广义解的存在，唯一性。