A note on pseudo-invexity and symmetric duality

A pair of symmetric dual nonlinear programming problems is presented and duality theorems are established under pseudoinvexity type assumptions on the kernel function. This formulation removes certain inconsistencies in a recently introduced primal-dual pair and gives the correct proof of various duality theorems.