Application-oriented Mixed Integer Non-Linear Programming
In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the...
Main Author: | |
---|---|
Other Authors: | |
Format: | Doctoral Thesis |
Language: | en |
Published: |
Alma Mater Studiorum - Università di Bologna
2009
|
Subjects: | |
Online Access: | http://amsdottorato.unibo.it/1634/ |
id |
ndltd-unibo.it-oai-amsdottorato.cib.unibo.it-1634 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-unibo.it-oai-amsdottorato.cib.unibo.it-16342014-03-24T16:27:53Z Application-oriented Mixed Integer Non-Linear Programming D'Ambrosio, Claudia <1980> MAT/09 Ricerca operativa In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to solve in practice. We address to non-convex MINLPs, i.e. having non-convex continuous relaxations: the presence of non-convexities in the model makes these problems usually even harder to solve. The aim of this Ph.D. thesis is to give a flavor of different possible approaches that one can study to attack MINLP problems with non-convexities, with a special attention to real-world problems. In Part 1 of the thesis we introduce the problem and present three special cases of general MINLPs and the most common methods used to solve them. These techniques play a fundamental role in the resolution of general MINLP problems. Then we describe algorithms addressing general MINLPs. Parts 2 and 3 contain the main contributions of the Ph.D. thesis. In particular, in Part 2 four different methods aimed at solving different classes of MINLP problems are presented. Part 3 of the thesis is devoted to real-world applications: two different problems and approaches to MINLPs are presented, namely Scheduling and Unit Commitment for Hydro-Plants and Water Network Design problems. The results show that each of these different methods has advantages and disadvantages. Thus, typically the method to be adopted to solve a real-world problem should be tailored on the characteristics, structure and size of the problem. Part 4 of the thesis consists of a brief review on tools commonly used for general MINLP problems, constituted an integral part of the development of this Ph.D. thesis (especially the use and development of open-source software). We present the main characteristics of solvers for each special case of MINLP. Alma Mater Studiorum - Università di Bologna Lodi, Andrea 2009-04-16 Doctoral Thesis PeerReviewed application/pdf en http://amsdottorato.unibo.it/1634/ info:eu-repo/semantics/openAccess |
collection |
NDLTD |
language |
en |
format |
Doctoral Thesis |
sources |
NDLTD |
topic |
MAT/09 Ricerca operativa |
spellingShingle |
MAT/09 Ricerca operativa D'Ambrosio, Claudia <1980> Application-oriented Mixed Integer Non-Linear Programming |
description |
In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems.
It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to solve in practice. We address to non-convex MINLPs, i.e. having non-convex continuous relaxations: the presence of non-convexities in the model makes these problems usually even harder to solve.
The aim of this Ph.D. thesis is to give a flavor of different possible approaches that one can study to attack MINLP problems with non-convexities, with a special attention to real-world problems. In Part 1 of the thesis we introduce the problem and present three special cases of general MINLPs and the most common methods used to solve them. These techniques play a fundamental role in the resolution of general MINLP problems. Then we describe algorithms addressing general MINLPs. Parts 2 and 3 contain the main contributions of the Ph.D. thesis. In particular, in Part 2 four different methods aimed at solving different classes of MINLP problems are presented. Part 3 of the thesis is devoted to real-world applications: two different problems and approaches to MINLPs are presented, namely Scheduling and Unit Commitment for Hydro-Plants and Water Network Design problems. The results show that each of these different methods has advantages and disadvantages. Thus, typically the method to be adopted to solve a real-world problem should be tailored on the characteristics, structure and size of the problem. Part 4 of the thesis consists of a brief review on tools commonly used for general MINLP problems, constituted an integral part of the development of this Ph.D. thesis (especially the use and development of open-source software).
We present the main characteristics of solvers for each special case of MINLP.
|
author2 |
Lodi, Andrea |
author_facet |
Lodi, Andrea D'Ambrosio, Claudia <1980> |
author |
D'Ambrosio, Claudia <1980> |
author_sort |
D'Ambrosio, Claudia <1980> |
title |
Application-oriented Mixed Integer Non-Linear Programming |
title_short |
Application-oriented Mixed Integer Non-Linear Programming |
title_full |
Application-oriented Mixed Integer Non-Linear Programming |
title_fullStr |
Application-oriented Mixed Integer Non-Linear Programming |
title_full_unstemmed |
Application-oriented Mixed Integer Non-Linear Programming |
title_sort |
application-oriented mixed integer non-linear programming |
publisher |
Alma Mater Studiorum - Università di Bologna |
publishDate |
2009 |
url |
http://amsdottorato.unibo.it/1634/ |
work_keys_str_mv |
AT dambrosioclaudia1980 applicationorientedmixedintegernonlinearprogramming |
_version_ |
1716653960046051328 |