Automated reformulation of disjunctive constraints in MINLP optimization

    Tutkimustuotos: LehtiartikkeliArtikkeliTieteellinenvertaisarvioitu

    7 Sitaatiot (Scopus)

    Abstrakti

    In this paper, a general method for handling disjunctive constraints in a MINLP optimization problem is presented. This method automates the reformulation of an, in a abstract modeling language given, optimization problem into a mathematical problem that is solvable with existing optimization tools. This implementation can use common MILP solvers for linear problems and nonlinear methods for quasi-convex optimization problems. It also includes the possibility to use the logics in the system and solve the system logically using subproblems.
    AlkuperäiskieliEi tiedossa
    SivutS11–S14
    Sivumäärä4
    JulkaisuComputers and Chemical Engineering
    Vuosikerta23
    DOI - pysyväislinkit
    TilaJulkaistu - 1999
    OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

    Keywords

    • disjunctive constraints
    • mixed integer non-linear programming
    • process synthesis
    • scheduling problems
    • transformations

    Viittausmuodot