Automated reformulation of disjunctive constraints in MINLP optimization

Jerker Björkqvist; Tapio Westerlund

doi:10.1016/S0098-1354(99)80004-0

Automated reformulation of disjunctive constraints in MINLP optimization

Jerker Björkqvist, Tapio Westerlund

Research output: Contribution to journal › Article › Scientific › peer-review

7 Citations (Scopus)

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.

Original language	Undefined/Unknown
Pages (from-to)	S11–S14
Number of pages	4
Journal	Computers and Chemical Engineering
Volume	23
DOIs	https://doi.org/10.1016/S0098-1354(99)80004-0
Publication status	Published - 1999
MoE publication type	A1 Journal article-refereed

Keywords

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

Access to Document

10.1016/S0098-1354(99)80004-0

Cite this

@article{7c126b847d2b46709dfce7664744886a,

title = "Automated reformulation of disjunctive constraints in MINLP optimization",

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, disjunctive constraints, mixed integer non-linear programming, process synthesis, scheduling problems, transformations, disjunctive constraints, mixed integer non-linear programming, process synthesis, scheduling problems, transformations",

author = "Jerker Bj{\"o}rkqvist and Tapio Westerlund",

year = "1999",

doi = "10.1016/S0098-1354(99)80004-0",

language = "Odefinierat/ok{\"a}nt",

volume = "23",

pages = "S11–S14",

journal = "Computers and Chemical Engineering",

issn = "0098-1354",

publisher = "Elsevier",

}

TY - JOUR

T1 - Automated reformulation of disjunctive constraints in MINLP optimization

AU - Björkqvist, Jerker

AU - Westerlund, Tapio

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

KW - disjunctive constraints

KW - mixed integer non-linear programming

KW - process synthesis

KW - scheduling problems

KW - transformations

KW - disjunctive constraints

KW - mixed integer non-linear programming

KW - process synthesis

KW - scheduling problems

KW - transformations

KW - disjunctive constraints

KW - mixed integer non-linear programming

KW - process synthesis

KW - scheduling problems

KW - transformations

U2 - 10.1016/S0098-1354(99)80004-0

DO - 10.1016/S0098-1354(99)80004-0

M3 - Artikel

SN - 0098-1354

VL - 23

SP - S11–S14

JO - Computers and Chemical Engineering

JF - Computers and Chemical Engineering

ER -