Optimization Condition Research Of Multiobjective Programming Under Generalized

Convexity is generalized study mathematical programming, variational study, the optimization theory, and other disciplines important theoretical basis and useful tool; However, a large number of practical problems are non-convex function function in order to further discussion of the multi-objective planning issues, in the previous paper on the basis of the concept of a convex forms the promotion, which unchanged convex function, preinvex function is very important to promote both forms; the introduction of the invex functions , the preinvex functions, The prequasiinvex functions and a series of related concepts, they studied the correlation between nature and, on the basis of the conditions put forward with optimality conditions, thus simplifying the nature of theorem proof; convexity studied generalized multi-objective planning in the application discussed I, II, III functions posed by the establishment of the multi-objective planning optimality conditions; Finally, the transcript made a summing up, and possible future development, the study made a number of pending issues.