{'fraction_non_alphanumeric': 0.01376720901126408, 'fraction_numerical': 0.0025031289111389237, 'mean_word_length': 5.451612903225806, '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}}
FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING

ABSTRACT In this paper, first and second order sufficient conditions are established for strict local Pareto minima of orders 1 and 2 to multiobjective optimization problems with an arbitrary feasible set and a twice differentiable objective function are provided. For this aim, the concept of support function to a multiobjective problem is introduced, so that the scalar case in particular is contained. The obtained results generalize the classical ones of this case. Furthermore, particularizing to a feasible set defined by equality and inequality constraints, first and second order optimality conditions in primal form as well as dual form (by means of a Lagrange multiplier rule) are obtained.