Numbers of the connected components of the solution sets of monotone affine vector variational inequalities
This paper establishes several upper and lower estimates for the maximal number of the connected components of the solution sets of monotone affine vector variational inequalities. Our results give a partial solution to Question 2 in Yen and Yao (Optimization 60:53–68, 2011) and point out that the number depends not only on the number of the criteria but also on the number of variables of the vector variational inequality under investigation.
KeywordsMonotone affine vector variational inequality Solution set Number of connected components Scalarization formula Skew-symmetric matrix
Mathematics Subject Classification49J40 47H05 90C29 90C33
The author is indebted to Professor Nguyen Dong Yen for many stimulating conversations.
- 2.Giannessi, F.: Theorems of alternative, quadratic programs and complementarity problems. In: Cottle, R.W., Giannessi, F., Lions, J.-L. (eds.) Variational Inequality and Complementarity Problems, pp. 151–186. Wiley, New York (1980)Google Scholar
- 3.Hoa, T.N., Phuong, T.D., Yen, N.D.: Number of connected components of the solution sets in linear fractional vector optimization, Preprint 2002/41, Institute of Mathematics, HanoiGoogle Scholar
- 4.Hieu, V.T.: The Tarski -Seidenberg theorem with quantifiers and polynomial vector variational inequalities (2018). https://arxiv.org/abs/1803.00201
- 11.Lee, G.M., Tam, N.N., Yen, N.D.: Quadratic Programming and Affine Variational Inequalities: A Qualitative Study, Series: Nonconvex Optimization and its Applications, vol. 78. Springer, New York (2005)Google Scholar