Nguyễn Thị Thu Hương, Trần Ninh Hoa, Tạ Duy Phượng, Nguyễn Đông Yên


By a scalarization method, it is proved that both the Pareto solution set and the weak Pareto solution set of a bicriteria affine vector variational inequality have finitely many connected. components provided that a regularity condition is satisfied. An explicit upper bound for the numbers of connected components of the Pareto solution set and the weak. Pareto solution set is obtained. Consequences of the results for bicriteria quadratic vector optimization problems and linear fractional vector optimization problems are discussed in detail. Under an additional assumption on the data set, Theorems 3.1 and 3.2 in this paper solve in the affirmative Question 1 in [17, p. 66] and Question 9.3 in [151 for the case of bicriteria problems without requiring the monotonicity. Besides, the theorems also give a partial solution to Question 2 in [17] about finding an upperboundfor the numbers ofconnected components of the solution sets under investigation.


Bicriteria affine vector variational inequality; Acalarlaation; Solution set; Connectedness; Number of connected components

DOI: http://dx.doi.org/10.37569/DalatUniversity.2.2.198(2012)


  • There are currently no refbacks.

Copyright (c) 2012 Nguyễn Thị Thu Hương, Trần Ninh Hoa, Tạ Duy Phượng, Nguyễn Đông Yên

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Editorial Office of DLU Journal of Science
Room.15, A25 Building, 01 Phu Dong Thien Vuong Street, Dalat, Lamdong
Email: tapchikhoahoc@dlu.edu.vn - Phone: (+84) 263 3 555 131

Creative Commons License
Based on Open Journal Systems
Developed by Information Technology Department