A COMPLETE EXPRESSION OF THE ASYMPTOTIC SOLUTION OF DIFFERENTIAL EQUATION WITH A∩-TH ORDER TURNING POINT

A second order linear ordinary differential equation has been studied, and the complete expresson, of the formal uniformly valid asymptotic solutions to the equation near turning point is obtained by using extended Airy function.     

The problems of nonlinear bending for orthotropic rectangular plate with four clamped edges

（黄家寅）（秦圣立）ＴＨＥＰＲＯＢＬＥＭＳＯＦＮＯＮＬＩＮＥＡＲＢＥＮＤＩＮＧＦＯＲＯＲＴＨＯＴＲＯＰＩＣＲＥＣＴＡＮＧＵＬＡＲＰＬＡＴＥＷＩＴＨＦＯＵＲＣＬＡＭＰＥＤＥＤＧＥＳ￥ＨｕａｎｇＪｉａｙｉｎ;ＱｉｎＳｈｅｎｇｌｉ（ＱｕｆｕＮｏｒｍａｌＵｎ...     

SINGULARLY PERTURBED BOUNDARY VALUE PROBLEMS FOR SEMI-LINEAR RETARDED DIFFERENTIAL EQUATIONS WITH NONLINEAR BOUNDARY CONDITIONS

IntroductionInthispaper,westudiedakindofboundaryvalueproblems (BVPs)forsemi_linearretardeddifferentialequationwithnonlinearboundarycondition :　　　　εx″(t) =f(t,x(t) ,x(t-ε) ,ε) ,　　t∈(0 ,1 ) ,(1 )　　　　x(t) =φ(t,ε) ,　t∈[-ε0 ,0 ] ,h(x(1 ) ,x′(1 ) ,ε) =A(ε) ,(2 )whereε>0isasmallparameterandε0 isasufficientlysmallpositiveconstant.ThereweremanyresultsofstudyingonsingularlyperturbedboundaryvalueproblemforretardeddifferentialequationinRefs.[1～5] .Butthosestudiespossessedanesse…     

k-Edge Failure Resilient Network Design

We design a network that supports a feasible multicommodity flow even after the failures of any k edges. We present a mixed-integer linear program (MILP), a cutting plane algorithm, and a column-and-cut algorithm. The algorithms add constraints to repair vulnerabilities in partial network designs. Empirical studies on previously unsolved instances of SNDlib demonstrate their effectiveness.     

一般整数规划中有效不等式的同步升维

有效不等式在整数规划的定界研究中具有重要的意义.研究了一般整数规划问题的有效不等式的升维方法,引入超加性函数给出同步升维的条件,并给出有效不等式的同步升维的具体方法,算例表明本文提出的方法是有效的.     

机场任务指派问题的优化方案研究

本文研究了机场任务指派问题,该问题是指将具有特殊属性的任务指派给有限数量的班次。由于机场任务和班次属性的多样性,机场任务指派问题是一个复杂的组合优化问题,属于NP-完全问题。本文以任务完成产生的效益总和最大化为目标建立数学优化模型,提出有效不等式,应用CPLEX软件对实际数据进行求解,结果表明,CPLEX可以在较短时间内对一定规模的算例求得最优解。同时对影响目标函数的四个因素:任务数量、班次数量、班次工作时长和任务属性分别进行分析,通过实际算例测试对比,得出具有指导意义的结论,即根据机场特征分别调整四个因素不仅能够提高机场资源的有效利用率,而且能够提高机场的运行效率和服务水平。     

考虑订单取件时间和柔性时间窗的取送货车辆路径问题

研究了同城配送中考虑订单取货时间和柔性时间窗的取送货车辆路径问题,考虑同城配送中订单起终点,订单取货时间和订单配送的柔性时间窗,车容量限制等因素。首先构建以配送成本与超时惩罚成本之和最小化为目标的混合整数线性模型。其次,设计了含多种有效不等式及其对应分离算法的改进分支切割算法对该模型进行精确求解。最后通过实验测试分析了不等式的性能,验证了算法的有效性,实验表明适当的减少车辆数和增大装载能力能够有效的减少成本。     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001     

Min-cut clustering

We describe a decomposition framework and a column generation scheme for solving a min-cut clustering problem. The subproblem to generate additional columns is itself an NP-hard mixed integer programming problem. We discuss strong valid inequalities for the subproblem and describe some efficient solution strategies. Computational results on compiler construction problems are reported.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.This research was supported by NSF grants DMS-8719128 and DDM-9115768, and by an IBM grant to the Computational Optimization Center, Georgia Institute of Technology.     

0–1 equivalent model representations for air traffic management

We present two equivalent representations of a 0–1 model for the Air Traffic Flow Management Problem. We show that the LP relaxation of the second representation is tighter than the LP relaxation of the first one. As a direct implication, the Branch-and-Cut effort can be reduced. Computational results are reported on a set of large-scale instances. The preparation of this paper is partially supported by DGICYT through grant PB95-0407