The Kuhn-Tucker type necessary conditions are presented under the Arrow-Hurwicz-Uzawa constraint qualification for a class of nondifferentiable generalized fractional programming problem,in which both the numerator and the denominator of the objective function are consisted of the differentiable function and the convex function.

In this paper, under the Kuhn-Tucker constraint qualification,the author gave the Kuhn-Tucker type necessary conditions for a class of nondifferentiable generalized fractional programming problems.

In the framework of locally convex topological vector space,the scalarization theorem,Kuhn-Tucker conditions as well as the duality theorem and the saddle points theorem on Henig proper efficient solutions with respect to the base for vector optimization involving arcwise connected convex maps are established separately.

In our algorithm,replacing the lower level problem by its Kuhn-Tucker condition,the bilevel linear programming is transformed into a traditional single-level programming problem,which can be transformed into a series of linear programming problem.

Via connecting linear plus power module ideal point algorithm under Kuhn-Tucker condition,the bilevel multiobjective programming problem is changed to a singula.

As for weak efficient solution to multi objective programming inequality and equality constrants, the new necessary condition between Fritz John condition and Kuhn Tucker condition is established under weaker condition.