非自伴非紧的抽象边值问题

在Ｈｉｌｂｅｒｔ空间研究了一类非自伴非紧的抽象边值问题,利用Ｗｉｅｎｅｒ－Ｈｏｐｆ方法构造了空间Ｘ的分裂投影,进而得出了方程解的适定性．     

Increasing Convex-Along-Rays Functions with Applications to Global Optimization

Increasing convex-along-rays functions are defined within an abstract convexity framework. The basic properties of these functions including support sets and subdifferentials are outlined. Applications are provided to unconstrained global optimization using the concept of excess function.     

伪Scott拓扑与伪Scott开滤子

讨论抽象基(特别是偏序集带辅助序)上的伪Scott拓扑与伪Scott开滤子集的一些基本性质, 推广了Domain理论中一些熟知的结论,证明了抽象基上的伪Scott拓扑是完全分配格;若在偏序集P上赋予辅助关系＜, 则其上伪Scott开滤子之集是连续domain.     

Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem

The optimization problem with the Bilinear Matrix Inequality (BMI) is one of the problems which have greatly interested researchers of system and control theory in the last few years. This inequality permits to reduce in an elegant way various problems of robust control into its form. However, in contrast to the Linear Matrix Inequality (LMI), which can be solved by interior-point-methods, the BMI is a computationally difficult object in theory and in practice. This article improves the branch-and-bound algorithm of Goh, Safonov and Papavassilopoulos (Journal of Global Optimization, vol. 7, pp. 365–380, 1995) by applying a better convex relaxation of the BMI Eigenvalue Problem (BMIEP), and proposes new Branch-and-Bound and Branch-and-Cut Algorithms. Numerical experiments were conducted in a systematic way over randomly generated problems, and they show the robustness and the efficiency of the proposed algorithms.     

On the stable set polytope of a series-parallel graph

We give a short proof of Chvátal's conjecture that the nontrivial facets of the stable set polytope of a series-parallel graph all come from edges and odd holes.Research supported in part by the Natural Sciences and Engineering Research Council of Canada and by CP Rail.     

Distribution-independent properties of the convex hull of random points

Denote byV _n ^(d) the expected volume of the convex hull ofn points chosen independently according to a given probability measure in Euclideand-spaceE ^d. Ifd=2 ord=3 and is the measure corresponding to the uniform distribution on a convex body inE ^d, Affentranger and Badertscher derived that

On cuts and matchings in planar graphs

We study the max cut problem in graphs not contractible toK ₅, and optimum perfect matchings in planar graphs. We prove that both problems can be formulated as polynomial size linear programs.Supported by the joint project Combinatorial Optimization of the Natural Sciences and Engineering Research Council of Canada and the German Research Association (Deutsche Forschungsgemeinschaft, SFB 303).     

Signature classes of transportation polytopes

Signature algorithms solve certain classes of transportation problems in a number of steps bounded by the diameter of the dual polyhedron. The class of problems to which signature algorithms may be applied—the signature classes of the title—are characterized, and the monotonic Hirsch conjecture is shown to hold for them. In addition, certain more precise results are given for different cases. Finally, it is explained why a supposed proof of the Hirsch conjecture for all transportation polytopes is incomplete and apparently irremedial.Dedicated with affection to Philip Wolfe on the occasion of his 65th birthday.