{'fraction_non_alphanumeric': 0.02459016393442623, 'fraction_numerical': 0.004918032786885246, 'mean_word_length': 5.364583333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Well-posed vector optimization problems and vector variational inequalities

In this paper we introduce notions of well-posedness for a vector optimization problem and for a vector variational inequality of differential type, we study their basic properties and we establish the links among them. The proposed concept of well-posedness for a vector optimization problem generalizes the notion of well-setness for scalar optimization problems, introduced in [2]. On the other side, the introduced definition of well-posednessfor a vector variational inequality extends the one given in [13] for the scalar case.