Abstrakti
Convex relaxations play an important role in many areas, especially in optimization and particularly in global optimization. In this paper we will consider some special, but fundamental, issues related to convex relaxation techniques in constrained nonconvex optimization. We will especially consider optimization problems including nonconvex inequality constraints and their relaxations. Finally, we will illustrate the results by a problem connected to N-dimensional allocation.
Alkuperäiskieli | Ei tiedossa |
---|---|
Sivut | 331–336 |
Sivumäärä | 6 |
Julkaisu | Chemical Engineering Transactions |
Vuosikerta | 24 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 2011 |
OKM-julkaisutyyppi | A1 Julkaistu artikkeli, soviteltu |