The reformulation-based αGO algorithm for solving nonconvex MINLP problems - some improvements

    Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussaKonferenssiartikkeliTieteellinenvertaisarvioitu

    1 Sitaatiot (Scopus)

    Abstrakti

    The alpha-reformulation (alpha R) technique can be used to transform any nonconvex twice-differentiable mixed-integer nonlinear programming problem to a convex relaxed form. By adding a quadratic function to the nonconvex function it is possible to convexify it, and by subtracting a piecewise linearization of the added function a convex underestimator will be obtained. This reformulation technique is implemented in the a global optimization (alpha GO) algorithm solving the specified problem type to global optimality as a sequence of reformulated subproblems where the piecewise linear functions are refined in each step. The tightness of the underestimator has a large impact on the efficiency of the solution process, and in this paper it is shown how it is possible to reduce the approximation error by utilizing a piecewise quadratic spline function defined on smaller subintervals. The improved underestimator is also applied to test problems illustrating its performance.
    AlkuperäiskieliEi tiedossa
    Otsikko11th International Conference on Chemical and Process Engineering - selected papers of ICheaP11
    ToimittajatSauro Pierucci, Jiří J. Klemeš
    KustantajaAssociazione Italiana di Ingegneria Chimica
    Sivut1321–1326
    Sivumäärä6
    ISBN (painettu)978-88-95608-23-5
    DOI - pysyväislinkit
    TilaJulkaistu - 2013
    OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
    TapahtumaInternational Conference on Chemical and Process Engineering (ICheaP) - 11th International Conference on Chemical and Process Engineering (ICheaP)
    Kesto: 2 kesäkuuta 20135 kesäkuuta 2013

    Konferenssi

    KonferenssiInternational Conference on Chemical and Process Engineering (ICheaP)
    Ajanjakso02/06/1305/06/13

    Viittausmuodot