A new approach to characterize the solution set of a pseudoconvex programming problem

A new approach to characterize the solution set of a nonconvex optimization problem via its dual problem is proposed. Some properties of the Lagrange function associated to the problem are investigated. Then characterizations of the solution set of the problem are established.