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.     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

On the Cycle Space of an Infinite 3-connected Graph

Problems related to Tutte’s theorem on the generation of the cycle space of a 3-connected finite graph are discussed for infinite graphs.     

Temperature Stresses in a Piecewise-Homogeneous Cylindrical Shell Caused by the Presence of a Longitudinal Crack

By using the method of generalized conjugation problems, we propose a numerical scheme for investigation of the redistribution of temperature stresses in a piecewise-homogeneous cylindrical shell caused by a longitudinal crack. This scheme is based on systems of integral equations (some of them are singular) to determine the unknown jumps of integral characteristics of the disturbed temperature field and displacements and their derivatives on the line of a crack and on the interface as well as the derivatives of these integral characteristics with respect to the longitudinal coordinate at the interface.     

On the distribution singular values of Toeplitz matrices

We prove a second order formula concerning distribution of singular values of Toeplitz matrices in some cases when conditions of the H. Widom Theorem are not satisfied.

     

Economic Equilibrium: Optimality and Price Decentralization

Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies.     

Rank-perfect and" weakly rank-perfect graphs

An edge e of a perfect graph G is critical if G−e is imperfect. We would like to decide whether G−e is still “almost perfect” or already “very imperfect”. Via relaxations of the stable set polytope of a graph, we define two superclasses of perfect graphs: rank-perfect and weakly rank-perfect graphs. Membership in those two classes indicates how far an imperfect graph is away from being perfect. We study the cases, when a critical edge is removed from the line graph of a bipartite graph or from the complement of such a graph.     

Possible Loss and Recovery of Gibbsianness¶During the Stochastic Evolution of Gibbs Measures

We consider Ising-spin systems starting from an initial Gibbs measure ν and evolving under a spin-flip dynamics towards a reversible Gibbs measure μ≠ν. Both ν and μ are assumed to have a translation-invariant finite-range interaction. We study the Gibbsian character of the measure νS(t) at time t and show the following: (1) For all ν and μ, νS(t) is Gibbs for small t. (2) If both ν and μ have a high or infinite temperature, then νS(t) is Gibbs for all t > 0. (3) If ν has a low non-zero temperature and a zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t and non-Gibbs for large t. (4) If ν has a low non-zero temperature and a non-zero magnetic field and μ has a high or infinite temperature, then νS(t) is Gibbs for small t, non-Gibbs for intermediate t, and Gibbs for large t. The regime where μ has a low or zero temperature and t is not small remains open. This regime presumably allows for many different scenarios. Received: 26 April 2001 / Accepted: 10 October 2001     

Synthesis and characterisation of cadmium titanium oxide thin films by sol-gel technique

Crack free, dense and transparent CdTiO₃ thin films have been prepared by sol-gel technique using titanium butoxide and cadmium acetate. The formation of the CdTiO₃ phase started from 500°C annealing temperature onwards. The complete orthorhombic structure of CdTiO₃ was formed on Silicon (100) substrate at an annealing temperature of 600°C for 5 h. As the annealing temperature increased from 600 to 700°C, we have observed the cadmium silicate phase at the interface of Si and CdTiO₃ phase. Structural, morphological and elemental evolution of these CdTiO₃ thin films produced by sol-gel synthesis were characterised by grazing incidence X-ray diffraction (GIXRD), tapping mode atomic force microscopy (TMAFM), scanning electron microscopy (SEM) and X-ray photoelectron spectroscopy (XPS) respectively.