Global optimization using special ordered sets

• Autores: E. Martín Beale, J.J.H. Forrest
• Localización: Seminario sobre programación matemática, Vol. 1, Tomo 1, 1977 (Seminario sobre programación matemática)
• Idioma: español
• Texto completo no disponible (Saber más ...)
• Resumen

  • The task of finding global optima to general classes of nonconvex optimization problem is attracting increasing attention. McCormick points out that many such problems can conveniently be expressed in separable form, when they can be tackled by the special methods of Falk and Soland or Soland, or by Special Ordered Sets. Special Ordered Sets, introduced by Beale and Tomlin, have lived up to their early promise of being useful for a wide range of practical problems. Forrest, Hirst and Tomlin show how they have benefitted from the last few years, as a result of being incorporated in a general mathematical programming system.

    Nevertheless, Special Ordered Sets in their original form require that any continuous functions arising in the problem be approximated by piecewise linear functions at the start of the analysis. The motivation for the new work described in this paper is the relaxation of this requirement by allowing automatic interpolation of additional relevant points in the course of the analysis.

    This is similar to an interpolation scheme as used in separable programming, but its incorporation in a branch and bound method for global optimization is not entirely straightforward. Two bt-products of the work are of interest. One is an improved branching strategy for general special-ordered-set problems. The other is a method for finding a global minimum of a function of a scalar variable in a finite interval, assuming that one can calculate function values and first derivatives, and also bounds on the second derivatives within any subinterval.

    The paper describes these methods, their implementation in the UMPIRE system, and preliminary computational experience.