On the Numbers of Connected Components in the Solution Sets of Polynomial Vector Variational Inequalities

Vu Trung Hieu ()
Additional contact information
Vu Trung Hieu: Phuong Dong University

Journal of Optimization Theory and Applications, 2019, vol. 181, issue 1, No 4, 95-100

Abstract: Abstract In this paper, we establish explicit upper bounds for the number of connected components in the proper Pareto solution sets and the weak Pareto solution sets of polynomial vector variational inequalities. Consequently, upper bounds for the numbers of connected components in the stationary point sets, the proper stationary point sets, and the weak Pareto solution sets of polynomial vector optimization problems are obtained.

Keywords: Polynomial vector variational inequality; Polynomial vector optimization; Solution set; Semi-algebraic set; Number of connected components; 90C29; 90C33; 49J40; 14P10 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-018-1450-y 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:181:y:2019:i:1:d:10.1007_s10957-018-1450-y

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-018-1450-y

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 ().