A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
Identifieur interne : 001457 ( Istex/Curation ); précédent : 001456; suivant : 001458A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
Auteurs : Nguyen V. Thoai [Allemagne]Source :
- European Journal of Operational Research [ 0377-2217 ] ; 2000.
Abstract
One of the most important and interesting approaches in multiple criteria optimization is the problem of optimizing some function over the set of efficient solutions. This is a very difficult multiextremal global optimization problem, even for the case that the underlying multiple criteria program is linear and the function to be optimized over the efficient set is linear as well. In this article, we consider the problem of maximizing a special function over the efficient set of a multiple criteria concave maximization problem under the assumption that the objective function is a nondecreasing composite quasiconvex function of the concave criteria. We show that this problem can be formulated as a special global optimization problem in the outcome space. An algorithm of the outer approximation type is proposed for solving the resulting problem. Preliminary computational experiments show that this algorithm can work well for problems with a small number of criteria (less than 8), while the dimension of the decision space can be fairly large.
Url:
DOI: 10.1016/S0377-2217(99)00068-5
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001569
Links to Exploration step
ISTEX:8146A932CCE218E8BF251A9B293B518CF91EC5F1Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem</title><author><name sortKey="Thoai, Nguyen V" sort="Thoai, Nguyen V" uniqKey="Thoai N" first="Nguyen V." last="Thoai">Nguyen V. Thoai</name><affiliation wicri:level="1"><mods:affiliation>Department of Mathematics, University of Trier, 54286 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Mathematics, University of Trier, 54286 Trier</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8146A932CCE218E8BF251A9B293B518CF91EC5F1</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1016/S0377-2217(99)00068-5</idno><idno type="url">https://api.istex.fr/document/8146A932CCE218E8BF251A9B293B518CF91EC5F1/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001569</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001569</idno><idno type="wicri:Area/Istex/Curation">001457</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem</title><author><name sortKey="Thoai, Nguyen V" sort="Thoai, Nguyen V" uniqKey="Thoai N" first="Nguyen V." last="Thoai">Nguyen V. Thoai</name><affiliation wicri:level="1"><mods:affiliation>Department of Mathematics, University of Trier, 54286 Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Mathematics, University of Trier, 54286 Trier</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="j">European Journal of Operational Research</title><title level="j" type="abbrev">EOR</title><idno type="ISSN">0377-2217</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="2000">2000</date><biblScope unit="volume">122</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="58">58</biblScope><biblScope unit="page" to="68">68</biblScope></imprint><idno type="ISSN">0377-2217</idno></series><idno type="istex">8146A932CCE218E8BF251A9B293B518CF91EC5F1</idno><idno type="DOI">10.1016/S0377-2217(99)00068-5</idno><idno type="PII">S0377-2217(99)00068-5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0377-2217</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">One of the most important and interesting approaches in multiple criteria optimization is the problem of optimizing some function over the set of efficient solutions. This is a very difficult multiextremal global optimization problem, even for the case that the underlying multiple criteria program is linear and the function to be optimized over the efficient set is linear as well. In this article, we consider the problem of maximizing a special function over the efficient set of a multiple criteria concave maximization problem under the assumption that the objective function is a nondecreasing composite quasiconvex function of the concave criteria. We show that this problem can be formulated as a special global optimization problem in the outcome space. An algorithm of the outer approximation type is proposed for solving the resulting problem. Preliminary computational experiments show that this algorithm can work well for problems with a small number of criteria (less than 8), while the dimension of the decision space can be fairly large.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001457 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001457 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:8146A932CCE218E8BF251A9B293B518CF91EC5F1
|texte= A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
}}
| This area was generated with Dilib version V0.6.31. |  |