Sufficient optimality conditions and duality theory for interval optimization problem

2014 ◽  
Vol 243 (1-2) ◽  
pp. 335-348 ◽  
Author(s):  
A. K. Bhurjee ◽  
G. Panda
Keyword(s):  
Optimality Conditions ◽  
Duality Theory ◽  
Optimization Problem ◽  
Sufficient Optimality Conditions ◽  
Interval Optimization

scholarly journals Optimality and duality in set-valued optimization utilizing limit sets

2018 ◽  
Vol 16 (1) ◽  
pp. 1128-1139
Author(s):  
Xiangyu Kong ◽  
Yinfeng Zhang ◽  
GuoLin Yu
Keyword(s):  
Optimality Conditions ◽  
Duality Theory ◽  
Optimization Problem ◽  
Convex Set ◽  
Sufficient Optimality Conditions ◽  
Constraint Optimization ◽  
Limit Sets ◽  
Optimality And Duality ◽  
Wolfe Type Dual ◽  
Necessary And Sufficient

AbstractThis paper deals with optimality conditions and duality theory for vector optimization involving non-convex set-valued maps. Firstly, under the assumption of nearly cone-subconvexlike property for set-valued maps, the necessary and sufficient optimality conditions in terms of limit sets are derived for local weak minimizers of a set-valued constraint optimization problem. Then, applications to Mond-Weir type and Wolfe type dual problems are presented.

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.

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 Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming

2020 ◽  
Author(s):  
Mohsine Jennane ◽  
El Mostafa Kalmoun ◽  
Lahoussine Lafhim
Keyword(s):  
Optimality Conditions ◽  
Optimization Problem ◽  
Constraint Qualification ◽  
Necessary Optimality Conditions ◽  
Sufficient Optimality Conditions ◽  
Convexity Assumption ◽  
Locally Lipschitz ◽  
Infinite Programming ◽  
Asymptotic Convexity ◽  
Interval Valued

We consider a nonsmooth semi-infinite interval-valued vector programming problem, where the objectives and constraints functions need not to be locally Lipschitz. Using Abadie's constraint qualification and convexificators, we provide  Karush-Kuhn-Tucker necessary optimality conditions by converting the initial problem into a bi-criteria optimization problem. Furthermore, we establish sufficient optimality conditions  under the asymptotic convexity assumption.

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

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.

Sign in / Sign up

Export Citation Format

Share Document