Application of the penalty function method to generalized convex programs Original Research Article

We use the penalty function method to study duality in generalized convex (invex) programming. In particular, we will obtain a new derivation under which the generalized convex (invex) programs do not have duality gaps.