Penalty function methods and a duality gap for invex optimization problems

In this paper, the penalty function method is used to study duality in nonconvex mathematical programming problems. In particular, we prove the zero duality gap between optimization problems involving invex functions with respect to the same function η and their Lagrangian dual problems. The results proved in the paper are illustrated by suitable examples of nonconvex optimization problems.