Optimality Condition and Duality Results for a Class of Multi-objective Fractional Programming Problems with Generalized Convexity;

On optimality conditions for a Class of semi-infinite programming;

The loose saddle point optimality conditions of set-valued functions with super efficiency;

Optimality Conditions for a Quasi-differentiable and B-preinvex Programming;

The Optimality Conditions and Lagrange Duality of Vector Extremum Problems in Abstract Space;

The study of optimality conditions for generalized quasi-differentiable optimization is very important for Bracken-McGill bilevel programming and other important nondifferentiable optimization problems.

The existence of optimal solution and first order optimal condition are proved according to the optimal theory and methods of nondifferentiable function.

To solve the conflict between calculating speed and accuracy in conventional dynamic optimal power flow(DOPF)algorithms,a variation model of DOPF is developed and the optimal condition for the model proposed is derived.

Using the calculus of variations method, the optimal conditions of the model are deduced.

This paper demonstrates an alternative theorem of generalized subconvex-like maps in ordered linear spaces, by means of which s the optimal conditions of a class of vector extremum problem are obtained.

In this paper, some optimal conditions are derived for nonlinear bilevel programming problems in which the leader s objective function is linear but the follower s is quadratic.

Under certain conditions,we derive the first order optimal conditions by Fritz-John conditions.