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>