Sufficient optimality criteria and duality for multiobjective variational control problems with G-type I objective and constraint functions

In the paper, we introduce the concepts of G-type I and generalized G-type I functions for a new class of nonconvex multiobjective variational control problems. For such nonconvex vector optimization problems, we prove sufficient optimality conditions for weakly efficiency, efficiency and properly efficiency under assumptions that the functions constituting them are G-type I and/or generalized G-type I objective and constraint functions. Further, for the considered multiobjective variational control problem, its dual multiobjective variational control problem is given and several duality results are established under (generalized) G-type I objective and constraint functions

Duality for multiobjective variational control problems with (Φ,ρ)-invexity

In this paper, Mond-Weir and Wolfe type duals for multiobjective variational control problems are formulated. Several duality theorems are established relating efficient solutions of the primal and dual multiobjective variational control problems under TeX-invexity. The results generalize a number of duality results previously established for multiobjective variational control problems under other generalized convexity assumptions

Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems

In this paper, a new class of generalized of nonconvex multitime multiobjective variational problems is considered. We prove the sufficient optimality conditions for efficiency and proper efficiency in the considered multitime multiobjective variational problems with univex functionals. Further, for such vector variational problems, various duality results in the sense of Mond-Weir and in the sense of Wolfe are established under univexity. The results established in the paper extend and generalize results existing in the literature for such vector variational problems

Nondifferentiable multiobjective programming problem under strongly K-Gf-pseudoinvexity assumptions

[EN] In this paper we consider the introduction of the concept of (strongly) K-G(f)-pseudoinvex functions which enable to study a pair of nondifferentiable K-G- Mond-Weir type symmetric multiobjective programming model under such assumptions.Dubey, R.; Mishra, LN.; Sánchez Ruiz, LM.; Sarwe, DU. (2020). Nondifferentiable multiobjective programming problem under strongly K-Gf-pseudoinvexity assumptions. Mathematics. 8(5):1-11. https://doi.org/10.3390/math8050738S11185Antczak, T. (2007). New optimality conditions and duality results of type in differentiable mathematical programming. Nonlinear Analysis: Theory, Methods & Applications, 66(7), 1617-1632. doi:10.1016/j.na.2006.02.013Antczak, T. (2008). On G-invex multiobjective programming. Part I. Optimality. Journal of Global Optimization, 43(1), 97-109. doi:10.1007/s10898-008-9299-5Ferrara, M., & Viorica-Stefanescu, M. (2008). Optimality conditions and duality in multiobjective programming with invexity. YUJOR, 18(2), 153-165. doi:10.2298/yjor0802153fChen, X. (2004). Higher-order symmetric duality in nondifferentiable multiobjective programming problems. Journal of Mathematical Analysis and Applications, 290(2), 423-435. doi:10.1016/j.jmaa.2003.10.004Long, X. (2013). Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized univex functions. Journal of Systems Science and Complexity, 26(6), 1002-1018. doi:10.1007/s11424-013-1089-6Dubey, R., Mishra, L. N., & Sánchez Ruiz, L. M. (2019). Nondifferentiable G-Mond–Weir Type Multiobjective Symmetric Fractional Problem and Their Duality Theorems under Generalized Assumptions. Symmetry, 11(11), 1348. doi:10.3390/sym11111348Pitea, A., & Postolache, M. (2011). Duality theorems for a new class of multitime multiobjective variational problems. Journal of Global Optimization, 54(1), 47-58. doi:10.1007/s10898-011-9740-zPitea, A., & Antczak, T. (2014). Proper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems. Journal of Inequalities and Applications, 2014(1). doi:10.1186/1029-242x-2014-333Dubey, R., Deepmala, & Narayan Mishra, V. (2020). Higher-order symmetric duality in nondifferentiable multiobjective fractional programming problem over cone contraints. Statistics, Optimization & Information Computing, 8(1), 187-205. doi:10.19139/soic-2310-5070-60

On nonsmooth multiobjective fractional programming problems involving (p, r)− ρ −(η ,θ)- invex functions

A class of multiobjective fractional programming problems (MFP) is considered where the involved functions are locally Lipschitz. In order to deduce our main results, we introduce the definition of (p,r)−ρ −(η,θ)-invex class about the Clarke generalized gradient. Under the above invexity assumption, sufficient conditions for optimality are given. Finally, three types of dual problems corresponding to (MFP) are formulated, and appropriate dual theorems are proved

Decision analysis: vector optimization theory

First published in Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales in 93, 4, 1999, published by the Real Academia de Ciencias Exactas, Físicas y Naturales

Generalized Convexity in Multiobjective Programming

AbstractFor the scalar programming problem, some characterizations for optimal solutions are known. In these characterizations convexity properties play a very important role. In this work, we study characterizations for multiobjective programming problem solutions when functions belonging to the problem are differentiable. These characterizations need some conditions of convexity. In differentiable scalar programming problems the concept of invexity is very important. We prove that it is also necessary for the multiobjective programming problem and give some characterizations of multiobjective programming problem solutions under weaker conditions. We define analogous concepts to those of stationary points and to the conditions of Kuhn–Tucker and Fritz–John for the multiobjective programming problem

Nonsmooth multiobjective optimization using limiting subdifferentials

AbstractIn this study, using the properties of limiting subdifferentials in nonsmooth analysis and regarding a separation theorem, some weak Pareto-optimality (necessary and sufficient) conditions for nonsmooth multiobjective optimization problems are proved

Tangential Extremal Principles for Finite and Infinite Systems of Sets, II: Applications to Semi-infinite and Multiobjective Optimization

This paper contains selected applications of the new tangential extremal principles and related results developed in Part I to calculus rules for infinite intersections of sets and optimality conditions for problems of semi-infinite programming and multiobjective optimization with countable constraint

Generalized convexity: Their applications to multiobjective programming

The aim of this paper is to show some applicable results to multiobjective optimization problems and the role that the Generalized Convexity plays in them. The study of convexity for sets and functions has special relevance in the search of optimal functions, and in the development of algorithms for solving optimization problems. However, the absence of convexity implies a total loss of effectiveness of the Optimization Theory methods, ie, the results are being verified under less stringent conditions, it was what became known as Generalized convexity. The literature generated around this topic has demonstrated its importance both from a theoretical point of view as practical, but it has also generated an enormous amount of papers with little scientific input