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, 2009), and give an example showing the efficient application of (modified) G‐Karush‐Kuhn‐Tucker optimality theorem to the problems.
