Jeyakumar, V. (1985) Strong and Weak Invexity in Mathematical Programming. Mathematical Methods of Operations Research, 55, 109-125.

has been cited by the following article:

• TITLE: Mixed Saddle Point and Its Equivalence with an Efficient Solution under Generalized (V, p)-Invexity

  AUTHORS: Arvind Kumar, Pankaj Kumar Garg

  KEYWORDS: Nonsmooth Multiobjective Programs, (V, p)-Invexity, Mixed Saddle Point, Vector-Valued Mixed Lagrangian Function

  JOURNAL NAME: Applied Mathematics, Vol.6 No.9, August 24, 2015

  ABSTRACT: The purpose of this paper is to define the concept of mixed saddle point for a vector-valued Lagrangian of the non-smooth multiobjective vector-valued constrained optimization problem and establish the equivalence of the mixed saddle point and an efficient solution under generalized (V, p)-invexity assumptions.