Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
Starting from a kind of generalized higher-order contingent (adjacent) derivatives for set-valued maps, the authors obtain high-order optimality conditions for weakly efficient solutions of some nonconvex set-valued optimization programs.
generalized higher-order contingent (adjacent) derivative
scientific article; zbMATH DE number 5795213