Multi-parametric disaggregation technique for global optimization of polynomial programming problems

This paper discusses a power-based transformation technique that is especially useful when solving polynomial optimization problems, frequently occurring in science and engineering. The polynomial nonlinear problem is primarily transformed into a suitable reformulated problem containing new sets of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of global optimization Jg. 55; H. 2; S. 227 - 251
Hauptverfasser: Teles, João P., Castro, Pedro M., Matos, Henrique A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.02.2013
Springer
Springer Nature B.V
Schlagworte:
ISSN:0925-5001, 1573-2916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper discusses a power-based transformation technique that is especially useful when solving polynomial optimization problems, frequently occurring in science and engineering. The polynomial nonlinear problem is primarily transformed into a suitable reformulated problem containing new sets of discrete and continuous variables. By applying a term-wise disaggregation scheme combined with multi-parametric elements, an upper/lower bounding mixed-integer linear program can be derived for minimization/maximization problems. It can then be solved to global optimality through standard methods, with the original problem being approximated to a certain precision level, which can be as tight as desired. Furthermore, this technique can also be applied to signomial problems with rational exponents, after a few effortless algebraic transformations. Numerical examples taken from the literature are used to illustrate the effectiveness of the proposed approach.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-011-9809-8