Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers

The main aim of this article is to obtain characterizations of the solution set of two non-linear programs in terms of Lagrange multipliers. Both the programs have pseudolinear constraints but the objective function is convex for the first program and pseudolinear for the second program, where all the functions are defined in terms of bifunctions.