Kybernetika

Some results on sufficient optimality conditions in multiobjective differentiable programming are estabilished under generalized $F$-convexity assumptions. Various levels of convexity on the component of the functions involved are imposed, and the equality constraints are not necessarily linear. In the nonlinear case scalarization of the objective function is used.