[PDF] Top 20 Symmetric duality for a class of multiobjective programming

... of symmetric dual nondifferentiable multiobjective pro- gramming and establish appropriate duality ...of symmetric dual problems can be ob- tained as special cases of our general ... See full document

... higher-order multiobjective nondifferentiable symmetric dual program have been formulated and we established weak, strong, and con- verse duality theorems under K -F convexity ... See full document

... of symmetric dual fractional programs with certain convexity ...for multiobjective fractional programming problem and established weak and strong dua- lity ...a class of nondifferentiable ... See full document

... The paper is organized as follows. In Section , we recall some known concepts in the lit- erature and then introduce the concept of strong invexity of order σ for a locally Lipschitz function and its generalizations. ... See full document

... so-called class of univex functions have been the object of increasing interest, both theoretical and applicative, and there ex- ists nowadays a wide ...This class of generalized convex functions was ... See full document

... new class of generalized V-type I invex functions is introduced for nonsmooth multiobjective programming ...converse duality theorems are proved for Mond-Weir type dual program in order to ... See full document

... a class of non-smooth multiobjective semi-infinite programming ...new duality results for such semi-infinite programming ...converse duality theorems are derived. Some previous ... See full document

... of multiobjective programming, has grown remarkably in different direc- tional in the setting of optimality conditions and duality theory since ...a class of functions depending on the sign of ... See full document

... fractional programming. For the multiobjective case of static nonlinear fractional program, symmetric duality was established under convexity ...objective symmetric dual variational ... See full document

... ficient optimality conditions for efficient and properly ef- ficient solutions to the problem are established involving new classes of semidirectionally differentiable generali- zed type I functions. Moreover, usual ... See full document

... In this paper, we have defined a class of new generalized functions. By using the new functions, we have presented a sufficient optimality condition and Wolfe type duality results for a nondifferentiable ... See full document

... mixed symmetric dual formulation for a non-differentiable nonlinear programming ...mixed symmetric dual model for a class of nonlinear multiobjective programming pro- ...strong ... See full document

... a symmetric and a generalized symmetric dual for mathematical var iational programming , weak , strong and converse duality relations are obtained under invexity ...time programming ... See full document

... Three duality models for a multiobjective fractional programming problem involving nondifferen- tiability in terms of support functions have been formulated and usual duality relations have ... See full document

... order symmetric primal and dual problems in mathemati- cal ...strong duality theorems were established under second order F-convexity assump- ...tions. Symmetric minimax mixed integer primal and dual ... See full document

... of programming problem, there has been a growing interest in the higher-order dual pro- ...a class of second- and higher-order dual problems for a nonlinear program- ming problem involving twice ... See full document

... fractional programming problems containing ρ-convex func- tions have been established by Zalmai ...parameter-free duality models and proving ap- propriate duality ...and duality theorems for a ... See full document

... Multiobjective optimization has a large number of applications. As an example, it is gen- erally used in goal programming, risk programming etc. Optimality conditions for multi- objective ... See full document

... a class of functions called (C, α, ρ, d)-convex functions and de- rived duality theorems for a nondifferentiable minimax fractional programming problem under (C, α, ρ, ...fractional programming ... See full document

... a class of E- convex programming problems were discussed by Youness [], and E-Fritz-John and E- Kuhn-Tucker problems, which modified the Fritz-John and Kuhn-Tucker problems, were also ...mathematical ... See full document