Sammanfattning
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.
Originalspråk | Odefinierat/okänt |
---|---|
Sidor (från-till) | S11–S14 |
Antal sidor | 4 |
Tidskrift | Computers and Chemical Engineering |
Volym | 23 |
DOI | |
Status | Publicerad - 1999 |
MoE-publikationstyp | A1 Tidskriftsartikel-refererad |
Nyckelord
- disjunctive constraints
- mixed integer non-linear programming
- process synthesis
- scheduling problems
- transformations