Approximating Pareto curves using semidefinite relaxations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00220936" target="_blank" >RIV/68407700:21230/14:00220936 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.orl.2014.07.007" target="_blank" >http://dx.doi.org/10.1016/j.orl.2014.07.007</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.orl.2014.07.007" target="_blank" >10.1016/j.orl.2014.07.007</a>
Alternative languages
Result language
angličtina
Original language name
Approximating Pareto curves using semidefinite relaxations
Original language description
We approximate as closely as desired the Pareto curve associated with bicriteria polynomial optimization problems. We use three formulations (including the weighted sum approach and the Chebyshev approximation) and each of them is viewed as a parametricpolynomial optimization problem. For each case is associated a hierarchy of semidefinite relaxations and from an optimal solution of each relaxation one approximates the Pareto curve by solving an inverse problem (first two cases) or by building a polynomial underestimator (third case).
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Operations Research Letters
ISSN
0167-6377
e-ISSN
—
Volume of the periodical
42
Issue of the periodical within the volume
6-7
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
6
Pages from-to
432-437
UT code for WoS article
000343350700013
EID of the result in the Scopus database
—