Abstrakti
<ul></ul><p></p> <p>In this paper, we present a new algorithm for solving convex mixed-integer nonlinear programming problems. Similarly to other linearization-based methods, the algorithm generates a polyhedral approximation of the feasible region. The main idea behind the algorithm is to use a different approach for obtaining trial solutions. Here trial solutions are chosen as a center of the polyhedral approximation. By choosing the trial solutions as such, the algorithm is more likely to obtain feasible solutions within only a few iterations, compared to the approach of choosing trial solutions as the minimizer of a linear approximation of the problem. The algorithm can be used both as a technique for finding the optimal solution or as a technique for quickly finding a feasible solution to a given problem. The algorithm has been applied to some challenging test problems, and for these the algorithm is able to find a feasible solution within only a few iterations.</p>
Alkuperäiskieli | Ei tiedossa |
---|---|
Otsikko | 27 European Symposium on Computer Aided Process Engineering |
Toimittajat | Antonio Espuña, Moisès Graells, Luis Puigjaner |
Kustantaja | Elsevier |
Sivut | 2131–2136 |
ISBN (elektroninen) | 9780444639707 |
ISBN (painettu) | 978-0-444-63965-3 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 2017 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisuussa |
Tapahtuma | ESCAPE27 - ESCAPE27 Kesto: 1 tammik. 2017 → … |
Konferenssi
Konferenssi | ESCAPE27 |
---|---|
Ajanjakso | 01/01/17 → … |