Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

The Action Functional for Moyal Planes

Modulo some natural generalizations to noncompact spaces, we show in this Letter that Moyal planes are nonunital spectral triples in the sense of Connes. The action functional of these triples is computed, and we obtain the expected result, i.e. the noncommutative Yang–Mills action associated with the Moyal product. In particular, we show that Moyal gauge theory naturally fits into the rigorous framework of noncommutative geometry.     

A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.     

Euler characteristic and related measures for random geometric sets

By an elementary calculation we obtain the exact mean values of Minkowksi functionals for a standard model of percolating sets. In particular, a recurrence theorem for the mean Euler characteristic recently put forward is shown to be incorrect. Related previous mathematical work is mentioned. We also conjecture bounds for the threshold density of continuum percolation, which are associated with the Euler characteristic.     

Generic Transport Aft-body Drag Reduction using Active Flow Control

Active flow-separation control is an effective and efficient mean for drag reduction and unsteady load alleviation resulting from locally or massively separated flow. Such a situation occurs in configurations where the aerodynamic performance is of secondary importance to functionality. The performance of heavy transport helicopters and aeroplanes, having a large, and almost flat, aft loading ramp suffer from the poor aerodynamics of the aft body. Hence, a combined experimental and numerical investigation was undertaken on a generic transport aeroplane/helicopter configuration. The experimental study provided surface pressures, direct drag measurements, surface and smoke flow visualization. The baseline flow was numerically analyzed, using finite volume solutions of the RANS equations. The baseline flow around the model was insensitive to the Reynolds number in the range it was tested. The flow separating from the aft body was characterized by two main sources of drag and unsteadiness. The first is a separation bubble residing at the lower ramp corner and the second is a pair of vortex systems developing and separating from the sides of the ramp. As the model incidence is decreased, the pair of vortex systems also penetrates deeper towards the centerline of the ramp, decreasing the pressure and increasing the drag. As expected, the ramp lower corner bubble was highly receptive to periodic excitation introduced from four addressable piezo-fluidic actuators situated at the ramp lower corner. Total drag was reduced by 3–11%, depending on the model incidence. There are indications that the flow in the wake of the model is also significantly steadier when the bubble at the lower ramp corner is eliminated. The vortex system is tighter and steadier when the ramp-corner bubble is eliminated.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

A Liouville type theorem for polyharmonic elliptic systems

In this paper, we consider the polyharmonic system m(−Δ)U=Vq,m(−Δ)V=Up in RN, for m>1, N>2m, with p?1, q?1, but not both equal to 1, where m(−Δ) is the polyharmonic operator. Set α=2m(q+1)/(pq−1), β=2m(p+1)/(pq−1), for α,β∈[(N−2)/2,N−2m), we prove the nonexistence of positive solutions.     

COMPLETE EXTREMAL SURFACES OF MIXED TYPE IN 3-DIMENSIONAL MINKOWSKI SPACE

ＣＯＭＰＬＥＴＥＥＸＴＲＥＭＡＬＳＵＲＦＡＣＥＳＯＦＭＩＸＥＤＴＹＰＥＩＮ３－ＤＩＭＥＮＳＩＯＮＡＬＭＩＮＫＯＷＳＫＩＳＰＡＣＥ￥ＧＵＣＨＡＯＨＡＯ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，Ｓｈａｎｇｈａｉ２００...     

三维Minkowski空间中的曲面及其可积性

利用可积系统的思想,借助三维Minkowski空间L3的矩阵模型,研究了L3中具有调和逆平均曲率的类空曲面和洛伦兹调和逆平均曲率类时曲面的可积性及其形变.     

Generalised 2-circulant inequalities for the max-cut problem

The max-cut problem is a fundamental combinatorial optimisation problem, with many applications. Poljak and Turzik found some facet-defining inequalities for the associated polytope, which we call 2-circulant inequalities. We present a more general family of facet-defining inequalities, an exact separation algorithm that runs in polynomial time, and some computational results.