We prove a slightly modified G-Karush-Kuhn-Tucker necessary optimality theorem for multiobjective programming problems, which was originally given by Antczak (J Glob Optim 43:97–109, <CitationRef CitationID="CR2">2009</CitationRef>), and give an example showing the efficient application of (modified) G-Karush-Kuhn-Tucker optimality...</citationref>

This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P⊆ [InlineMediaObject not available: see fulltext.]<Superscript> m </Superscript> being the underlying ordering cone, called semistrictly ( [InlineMediaObject not available: see fulltext.]<Superscript> m </Superscript>\ −int...</superscript></superscript>

This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P⊆ [InlineMediaObject not available: see fulltext.] m being the underlying ordering cone, called semistrictly ( [InlineMediaObject not available: see fulltext.] m \ −int...

In this paper, we first derive several characterizations of the nonemptiness and compactness for the solution set of a convex scalar set-valued optimization problem (with or without cone constraints) in which the decision space is finite-dimensional. The characterizations are expressed in terms...

In this work, we consider a new class of multitime multiobjective variational problems of minimizing a vector of functionals of curvilinear integral type. Based on the normal efficiency conditions for multitime multiobjective variational problems, we study duals of Mond-Weir type, generalized...

In this work we study the Newton-like methods for finding efficient solutions of the vector optimization problem for a map from a finite dimensional Hilbert space X to a Banach space Y, with respect to the partial order induced by a closed, convex and pointed cone C with a nonempty interior. We...