Structure of efficient sets in lexicographic quasiconvex multicriteria optimization
β Scribed by Nicolae Popovici
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 188 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
β¦ Synopsis
The aim of this paper is to emphasize some remarkable properties of multicriteria optimization problems involving lexicographic quasiconvex objective functions. It is shown that, under appropriate assumptions, these problems are Pareto reducible and their efficient sets are strongly contractible.
π SIMILAR VOLUMES
We present a conjecture concerning the optimal structure of a subset pair satisfying two dual requirements in a lattice that can be derived as the product of k finite length chains. The conjecture is proved for k = 2.
Improved full ab initio optimizations of the molecular structure of biphenyl in twisted minimum energy, coplanar, and perpendicular conformations by use of Poles's GAUSSIAN 82 program have been performed in the 6-31G basis set. These lead to geometries and energies of much higher reliability than ou