On sufficiency for mathematical programming problems with equilibrium constraints

Abstract

In this paper, we consider a mathematical programming with equilibrium constraints (MPEC) where the objective and constraint functions are continuously differentiable. We establish the sufficient optimality condition for strict local minima of order m under the assumptions of generalized strong convexity of order m.

Keywords

• mathematical programming with equilibrium constraint
• sufficient optimality condition
• higher-order strong convexity