Efficiency and duality for vector optimization problem on Riemannian manifolds involving KT-B-invexity

2019 ◽  
Vol 12 (07) ◽  
pp. 1950088
Author(s):  
Babli Kumari ◽  
Anurag Jayswal
Keyword(s):  
Vector Optimization ◽  
Riemannian Manifolds ◽  
Efficient Solution ◽  
Optimization Problem ◽  
Dual Problem ◽  
Vector Optimization Problem ◽  
Converse Duality ◽  
Duality Results ◽  
Weak Efficient Solution

In this paper, we consider a vector optimization problem on Riemannian manifolds for which we define KT-B-invex and KT-B-pseudoinvex functions. Further, we prove that every vector Kuhn–Tucker point is a weak efficient solution for considered vector optimization problem under the suitable assumptions. Moreover, we also study the Mond–Weir dual problem for the aforesaid problem and establish its weak, strong and converse duality results.

scholarly journals Mixed E-duality for E-differentiable Vector Optimization Problems Under (Generalized) V-E-invexity

2021 ◽  
Vol 2 (3) ◽  
Author(s):  
Najeeb Abdulaleem
Keyword(s):  
Vector Optimization ◽  
Optimization Problem ◽  
Dual Problem ◽  
Optimization Problems ◽  
Vector Optimization Problem ◽  
Equality Constraints ◽  
Vector Optimization Problems ◽  
Duality Theorems ◽  
Differentiable Vector

AbstractIn this paper, a class of E-differentiable vector optimization problems with both inequality and equality constraints is considered. The so-called vector mixed E-dual problem is defined for the considered E-differentiable vector optimization problem with both inequality and equality constraints. Then, several mixed E-duality theorems are established under (generalized) V-E-invexity hypotheses.

scholarly journals Nondifferentiable G-Mond–Weir Type Multiobjective Symmetric Fractional Problem and Their Duality Theorems under Generalized Assumptions

Symmetry ◽  
2019 ◽  
Vol 11 (11) ◽  
pp. 1348 ◽  
Author(s):  
Ramu Dubey ◽  
Lakshmi Narayan Mishra ◽  
Luis Manuel Sánchez Ruiz
Keyword(s):  
Vector Optimization ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Second Order ◽  
Type Model ◽  
Dual Model ◽  
Duality Theorems ◽  
Converse Duality ◽  
Numerical Example ◽  
Primal Dual

In this article, a pair of nondifferentiable second-order symmetric fractional primal-dual model (G-Mond–Weir type model) in vector optimization problem is formulated over arbitrary cones. In addition, we construct a nontrivial numerical example, which helps to understand the existence of such type of functions. Finally, we prove weak, strong and converse duality theorems under aforesaid assumptions.

scholarly journals Nonsmooth Vector Optimization Problem Involving Second-Order Semipseudo, Semiquasi Cone-Convex Functions

2020 ◽  
Vol 9 (2) ◽  
pp. 383-398
Author(s):  
Sunila Sharma ◽  
Priyanka Yadav
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Convex Functions ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Second Order ◽  
Sufficient Optimality Conditions ◽  
Duality Results ◽  
Nonsmooth Vector Optimization ◽  
Second Order Cone

Recently, Suneja et al. [26] introduced new classes of second-order cone-(η; ξ)-convex functions along with theirgeneralizations and used them to prove second-order Karush–Kuhn–Tucker (KKT) type optimality conditions and duality results for the vector optimization problem involving first-order differentiable and second-order directionally differentiable functions. In this paper, we move one step ahead and study a nonsmooth vector optimization problem wherein the functions involved are first and second-order directionally differentiable. We introduce new classes of nonsmooth second-order cone-semipseudoconvex and nonsmooth second-order cone-semiquasiconvex functions in terms of second-order directional derivatives. Second-order KKT type sufficient optimality conditions and duality results for the same problem are proved using these functions.

scholarly journals A class of semilocal E-preinvex maps in Banach spaces with applications to nondifferentiable vector optimization

2013 ◽  
Vol 4 (1) ◽  
pp. 1-10
Author(s):  
Hehua Jiao
Keyword(s):  
Optimality Conditions ◽  
Banach Spaces ◽  
Vector Optimization ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Basic Properties ◽  
New Class ◽  
Duality Results

In this paper, a new class of semilocal E-preinvex and related maps in Banach spaces is introduced for a nondifferentiable vector optimization problem with restrictions of inequalities and some of its basic properties are studied. Furthermore, as its applications, some optimality conditions and duality results are established for a nondifferentiable vector optimization under the aforesaid maps assumptions.

scholarly journals Strict Benson proper-ε-efficiency in vector optimization with set-valued maps

2015 ◽  
Vol 25 (3) ◽  
pp. 387-395
Author(s):  
Kaur Suneja ◽  
Megha Sharma_
Keyword(s):  
Vector Optimization ◽  
Efficient Solution ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Lagrangian Multiplier ◽  
Multiplier Theorems ◽  
Proper Efficient Solution

In this paper the notion of Strict Benson proper-?-efficient solution for a vector optimization problem with set-valued maps is introduced. The scalarization theorems and ?-Lagrangian multiplier theorems are established under the assumption of ic-cone-convexlikeness of set-valued maps.

scholarly journals Higher order optimality and duality in fractional vector optimization over cones

2017 ◽  
Vol 48 (3) ◽  
pp. 273-287 ◽  
Author(s):  
Muskan Kapoor ◽  
Surjeet Kaur Suneja ◽  
Meetu Bhatia Grover
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Convex Functions ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Higher Order ◽  
Sufficient Optimality Conditions ◽  
Dual Program ◽  
Duality Results ◽  
Optimality And Duality

In this paper we give higher order sufficient optimality conditions for a fractional vector optimization problem over cones, using higher order cone-convex functions. A higher order Schaible type dual program is formulated over cones.Weak, strong and converse duality results are established by using the higher order cone convex and other related functions.

scholarly journals Connectedness and Path Connectedness of Weak Efficient Solution Sets of Vector Optimization Problems via Nonlinear Scalarization Methods

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 947
Author(s):  
Xin Xu ◽  
Yang Dong Xu
Keyword(s):  
Vector Optimization ◽  
Efficient Solution ◽  
Optimization Problems ◽  
Vector Optimization Problem ◽  
Nonlinear Scalarization ◽  
Solution Sets ◽  
Scalarization Method ◽  
Path Connectedness ◽  
Weak Efficient Solution ◽  
Efficient Solution Set

The connectedness and path connectedness of the solution sets to vector optimization problems is an important and interesting study in optimization theories and applications. Most papers involving the direction established the connectedness and connectedness for the solution sets of vector optimization problems or vector equilibrium problems by means of the linear scalarization method rather than the nonlinear scalarization method. The aim of the paper is to deal with the connectedness and the path connectedness for the weak efficient solution set to a vector optimization problem by using the nonlinear scalarization method. Firstly, the union relationship between the weak efficient solution set to the vector optimization problem and the solution sets to a series of parametric scalar minimization problems, is established. Then, some properties of the solution sets of scalar minimization problems are investigated. Finally, by using the union relationship, the connectedness and the path connectedness for the weak efficient solution set of the vector optimization problem are obtained.

scholarly journals On a Nonsmooth Vector Optimization Problem with Generalized Cone Invexity

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Hehua Jiao ◽  
Sanyang Liu
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Sufficient Optimality Conditions ◽  
Generalized Gradients ◽  
Invex Functions ◽  
Duality Results ◽  
Nonsmooth Vector Optimization ◽  
Cone Constraints

By using Clarke’s generalized gradients we consider a nonsmooth vector optimization problem with cone constraints and introduce some generalized cone-invex functions calledK-α-generalized invex,K-α-nonsmooth invex, and other related functions. Several sufficient optimality conditions and Mond-Weir type weak and converse duality results are obtained for this problem under the assumptions of the generalized cone invexity. The results presented in this paper generalize and extend the previously known results in this area.

Sign in / Sign up

Export Citation Format

Share Document