scholarly journals Vector optimization with cone semilocally preinvex functions

2013 ◽  
Vol 4 (1) ◽  
pp. 11-20 ◽  
Author(s):  
Surjeet Kaur Suneja ◽  
Meetu Bhatia
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Minimization Problem ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Sufficient Optimality Conditions ◽  
Duality Theorems ◽  
Preinvex Functions ◽  
Necessary And Sufficient

In this paper we introduce cone semilocally preinvex, cone semilocally quasi preinvex and cone semilocally pseudo preinvex functions and study their properties. These functions are further used to establish necessary and sufficient optimality conditions for a vector minimization problem over cones. A Mond-Weir type dual is formulated for the vector optimization problem and various duality theorems are proved.

scholarly journals Optimality and duality in nonsmooth vector optimization with non-convex feasible set

2020 ◽  
Author(s):  
Dr. Sunila Sharma ◽  
Priyanka Yadav
Keyword(s):  
Objective Function ◽  
Optimality Conditions ◽  
Vector Optimization ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Sufficient Optimality Conditions ◽  
Convex Programming Problem ◽  
Feasible Set ◽  
Nonsmooth Vector Optimization ◽  
Necessary And Sufficient

For a convex programming problem, the Karush-Kuhn-Tucker (KKT) conditions are necessary and sufficient for optimality under suitable constraint qualification. Recently, Suneja et al proved KKT optimality conditions for a differentiable vector optimization problem over cones in which they replaced the cone-convexity of constraint function by convexity of feasible set and assumed the objective function to be cone-pseudoconvex. In this paper, we have considered a nonsmooth vector optimization problem over cones and proved KKT type sufficient optimality conditions by replacing convexity of feasible set with the weaker condition considered by Ho and assuming the objective function to be generalized nonsmooth cone-pseudoconvex. Also, a Mond-Weir type dual is formulated and various duality results are established in the modified setting.

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 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.

Necessary and sufficient optimality conditions for set-valued optimization problems

2011 ◽  
Vol 18 (1) ◽  
pp. 53-66
Author(s):  
Najia Benkenza ◽  
Nazih Gadhi ◽  
Lahoussine Lafhim
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Necessary Optimality Conditions ◽  
Sufficient Optimality Conditions ◽  
Necessary And Sufficient ◽  
First Time ◽  
Funct Anal

Abstract Using a special scalarization employed for the first time for the study of necessary optimality conditions in vector optimization by Ciligot-Travain [Numer. Funct. Anal. Optim. 15: 689–693, 1994], we give necessary optimality conditions for a set-valued optimization problem by establishing the existence of Lagrange–Fritz–John multipliers. Also, sufficient optimality conditions are given without any Lipschitz assumption.

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.

OPTIMALITY OF GLOBAL PROPER EFFICIENCY FOR CONE-ARCWISE CONNECTED SET-VALUED OPTIMIZATION USING CONTINGENT EPIDERIVATIVE

2013 ◽  
Vol 30 (03) ◽  
pp. 1340004 ◽  
Author(s):  
GUOLIN YU
Keyword(s):  
Optimality Conditions ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Proper Efficiency ◽  
Sufficient Optimality Conditions ◽  
Set Valued Mapping ◽  
Contingent Epiderivative ◽  
Connected Set ◽  
Arcwise Connected ◽  
Necessary And Sufficient

This note deals with the optimality conditions of set-valued unconstraint optimization problem in real normed linear spaces. Based upon the concept of contingent epiderivative, the unified necessary and sufficient optimality conditions for global proper efficiency in vector optimization problem involving cone-arcwise connected set-valued mapping are presented.

scholarly journals On semidifferentiable interval-valued programming problems

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Kin Keung Lai ◽  
Avanish Shahi ◽  
Shashi Kant Mishra
Keyword(s):  
Saddle Point ◽  
Optimality Conditions ◽  
Minimization Problem ◽  
Optimal Solution ◽  
Optimality Criteria ◽  
Lagrangian Function ◽  
Sufficient Optimality Conditions ◽  
Duality Theorems ◽  
Preinvex Functions ◽  
Interval Valued

AbstractIn this paper, we consider the semidifferentiable case of an interval-valued minimization problem and establish sufficient optimality conditions and Wolfe type as well as Mond–Weir type duality theorems under semilocal E-preinvex functions. Furthermore, we present saddle-point optimality criteria to relate an optimal solution of the semidifferentiable interval-valued programming problem and a saddle point of the Lagrangian function.

Derivatives of Hadamard type in vector optimization

2018 ◽  
Vol 68 (2) ◽  
pp. 421-430
Author(s):  
Karel Pastor
Keyword(s):  
Nonlinear Analysis ◽  
Optimality Conditions ◽  
Vector Optimization ◽  
Optimality Condition ◽  
Optimization Problem ◽  
Vector Optimization Problem ◽  
Dini Derivatives ◽  
Scalar Optimality ◽  
Derivatives Of

Abstract In our paper we will continue the comparison which was started by Vsevolod I. Ivanov [Nonlinear Analysis 125 (2015), 270–289], where he compared scalar optimality conditions stated in terms of Hadamard derivatives for arbitrary functions and those which was stated for ℓ-stable functions in terms of Dini derivatives. We will study the vector optimization problem and we show that also in this case the optimality condition stated in terms of Hadamard derivatives is more advantageous.

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 Robust Approximate Optimality Conditions for Uncertain Nonsmooth Optimization with Infinite Number of Constraints

Mathematics ◽  
2018 ◽  
Vol 7 (1) ◽  
pp. 12 ◽  
Author(s):  
Xiangkai Sun ◽  
Hongyong Fu ◽  
Jing Zeng
Keyword(s):  
Optimality Conditions ◽  
Optimization Problem ◽  
Constraint Qualification ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Optimal Solution ◽  
Sufficient Optimality Conditions ◽  
Convex Constraint ◽  
Approximate Optimality Conditions ◽  
Necessary And Sufficient

This paper deals with robust quasi approximate optimal solutions for a nonsmooth semi-infinite optimization problems with uncertainty data. By virtue of the epigraphs of the conjugates of the constraint functions, we first introduce a robust type closed convex constraint qualification. Then, by using the robust type closed convex constraint qualification and robust optimization technique, we obtain some necessary and sufficient optimality conditions for robust quasi approximate optimal solution and exact optimal solution of this nonsmooth uncertain semi-infinite optimization problem. Moreover, the obtained results in this paper are applied to a nonsmooth uncertain optimization problem with cone constraints.

Sign in / Sign up

Export Citation Format

Share Document