Automated reformulation of disjunctive constraints in MINLP optimization

A1 Originalartikel i en vetenskaplig tidskrift (referentgranskad)


Interna författare/redaktörer


Publikationens författare: J. Björkqvist, T. Westerlund
Förläggare: PERGAMON-ELSEVIER SCIENCE LTD
Publiceringsår: 1999
Tidskrift: Computers and Chemical Engineering
Tidskriftsakronym: COMPUT CHEM ENG
Volym: 23
Artikelns första sida, sidnummer: S11
Artikelns sista sida, sidnummer: S14
Antal sidor: 4
ISSN: 0098-1354


Abstrakt

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.


Nyckelord

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

Senast uppdaterad 2019-06-12 vid 05:38