Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains
N. Q. Huy and
N. D. Yen
Additional contact information
N. Q. Huy: Hanoi Pedagogical University
N. D. Yen: Vietnam Academy of Science and Technology
Journal of Optimization Theory and Applications, 2005, vol. 124, issue 3, No 5, 615-635
Abstract:
Abstract We study the contractibility of the efficient solution set of strictly quasiconcave vector maximization problems on (possibly) noncompact feasible domains. It is proved that the efficient solution set is contractible if at least one of the objective functions is strongly quasiconcave and any intersection of level sets of the objective functions is a compact (possibly empty) set. This theorem generalizes the main result of Benoist (Ref.1), which was established for problems on compact feasible domains.
Keywords: Vector optimization; strictly quasiconcave functions; noncompact feasible domains; efficient solution sets; contractibility (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10957-004-1177-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:124:y:2005:i:3:d:10.1007_s10957-004-1177-9
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-004-1177-9
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().