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.     

Konvergente und asymptotische Darstellungen für die Lösungen linearer Differentialgleichungen,deren Koeffizienten Dirichletsche Reihen oder Exponentialpolynome mit komplexen Exponenten sind

Ohne ZusammenfassungDie vorliegende Arbeit wurde von der Mathematisch-naturwissenschaftlichen Fakultät der Universität Jena als Dissertation (D 27) angenommen. nachdem sie vorher einen Fakultätspreis erhalten hatte. Referent war Herr Prof. Hermann Schmidt. Ich möchte ihm auch hier meinen Dank für die Förderung aussprechen, die er mir durch seine vielfachen persönlichen Anregungen zuteil werden ließ.     

Papieruntersuchung

Analytical and Bioanalytical Chemistry -     

Influence of organic modifiers on morphology and crystallization of poly(ϵ‐caprolactone)/synthetic clay intercalated nanocomposites

ε‐caprolactone was polymerized in the presence of neat montmorillonite or organomontmorillonites to obtain a variety of poly(ε‐caprolactone) (PCL)‐based systems loaded with 10 wt % of the silicates. The materials were thoroughly investigated by different X‐ray scattering techniques to determine factors affecting structure of the systems. For one of the nanocomposites it was found that varying the temperature in the range corresponding to crystallization of PCL causes reversible changes in the interlayer distance of the organoclay. Extensive experimental and literature studies on this phenomenon provided clues indicating that this effect might be a result of two‐dimensional ordering of PCL chains inside the galleries of the silicate. Small angle X‐ray scattering and wide angle X‐ray scattering investigation of filaments oriented above melting point of PCL revealed that polymer lamellae were oriented perpendicularly to particles of unmodified silicate, while in PCL/organoclay systems they were found parallel to clay tactoids. Calorimetric and microscopic studies shown that clay particles are effective nucleating agents. In the nanocomposites, PCL crystallized 20‐fold faster than in the neat polymer. The crystallization rate in nanocomposites was also significantly higher than in microcomposite. Further research provided an insight how the presence of the filler affects crystalline fraction and spherulitic structure of the polymer matrix in the investigated systems. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 2350–2367, 2007     

Mineralogical analysis of auriferous ores from the El Diamante mine, Colombia

X-ray diffraction (XRD), Mössbauer spectrometry (MS), secondary ions mass spectroscopy (SIMS) and laser-ablation microprobe–inductively coupled plasma–mass spectrometry (LAM–ICP–MS) were used to study mineral samples of Colombian auriferous ores collected from the “El Diamante” mine, located in the municipality of Guachavez-Nariño, in Colombia. The samples were prepared as polished thin sections and polished sections. From XRD data, quartz, sphalerite and pyrite were detected and their respective cell parameters were estimated. From MS analyses, pyrite, arsenopyrite and chalcopyrite were identified; their respective hyperfine parameters and respective texture were deduced. Multiple regions of approximately 200 × 200 μm in each sample were analyzed with SIMS; the occurrence of “invisible gold” associated mainly with pyrite and secondarily with arsenopyrite could thus be assigned. It was also found that pyrite is of the arsenious type. Spots from 30 to 40 μm in diameter were analyzed with LAM–ICP–MS for pyrite, arsenopyrite and sphalerite; Au is “homogeneously” distributed inside the structure of the arsenious pyrite and the arsenopyrite (not as inclusions); the chemical composition indicates similarities of this “invisible gold”, forming a solid solution with arsenious pyrite and arsenopyrite. One hundred nineteen and 62 ppm of ‘invisible gold’ was quantified in 21 spots analyzed on pyrite and in 14 spots on arsenopyrite, respectively.     

Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs

A two-dimensional framework (G,p) is a graph G = (V,E) together with a map p: V → ℝ². We view (G,p) as a straight line realization of G in ℝ². Two realizations of G are equivalent if the corresponding edges in the two frameworks have the same length. A pair of vertices {u,v} is globally linked in G if %and for all equivalent frameworks (G,q), the distance between the points corresponding to u and v is the same in all pairs of equivalent generic realizations of G. The graph G is globally rigid if all of its pairs of vertices are globally linked. We extend the characterization of globally rigid graphs given by the first two authors [13] by characterizing globally linked pairs in M-connected graphs, an important family of rigid graphs. As a byproduct we simplify the proof of a result of Connelly [6] which is a key step in the characterization of globally rigid graphs. We also determine the number of distinct realizations of an M-connected graph, each of which is equivalent to a given generic realization. Bounds on this number for minimally rigid graphs were obtained by Borcea and Streinu in [3].     

Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.