Automated reformulation of disjunctive constraints in MINLP optimization

A1 Journal article (refereed)


Internal Authors/Editors


Publication Details

List of Authors: J. Björkqvist, T. Westerlund
Publisher: PERGAMON-ELSEVIER SCIENCE LTD
Publication year: 1999
Journal: Computers and Chemical Engineering
Journal acronym: COMPUT CHEM ENG
Volume number: 23
Start page: S11
End page: S14
Number of pages: 4
ISSN: 0098-1354


Abstract

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.


Keywords

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

Last updated on 2019-20-07 at 03:21