KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions

2016 ◽  
Vol 254 (1) ◽  
pp. 29-39 ◽  
Author(s):  
D. Singh ◽  
B.A. Dar ◽  
D.S. Kim
Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 908
Author(s):  
Md Sadikur Rahman ◽  
Ali Akbar Shaikh ◽  
Irfan Ali ◽  
Asoke Kumar Bhunia ◽  
Armin Fügenschuh

In the traditional nonlinear optimization theory, the Karush-Kuhn-Tucker (KKT) optimality conditions for constrained optimization problems with inequality constraints play an essential role. The situation becomes challenging when the theory of traditional optimization is discussed under uncertainty. Several researchers have discussed the interval approach to tackle nonlinear optimization uncertainty and derived the optimality conditions. However, there are several realistic situations in which the interval approach is not suitable. This study aims to introduce the Type-2 interval approach to overcome the limitation of the classical interval approach. This study introduces Type-2 interval order relation and Type-2 interval-valued function concepts to derive generalized KKT optimality conditions for constrained optimization problems under uncertain environments. Then, the optimality conditions are discussed for the unconstrained Type-2 interval-valued optimization problem and after that, using these conditions, generalized KKT conditions are derived. Finally, the proposed approach is demonstrated by numerical examples.


Filomat ◽  
2016 ◽  
Vol 30 (8) ◽  
pp. 2121-2138 ◽  
Author(s):  
Izhar Ahmad ◽  
Deepak Singh ◽  
Bilal Dar

In this paper, some interval valued programming problems are discussed. The solution concepts are adopted from Wu [7] and Chalco-Cano et al. [34]. By considering generalized Hukuhara differentiability and generalized convexity (viz. ?-preinvexity, ?-invexity etc.) of interval valued functions, the KKT optimality conditions for obtaining (LS and LU) optimal solutions are elicited by introducing Lagrangian multipliers. Our results generalize the results of Wu [7], Zhang et al. [11] and Chalco-Cano et al. [34]. To illustrate our theorems suitable examples are also provided


Author(s):  
Tadeusz Antczak ◽  
Gabriel Ruiz-Garzón

In this paper, a new class of nonconvex nonsmooth multiobjective programming problems with directionally differentiable functions is considered. The so-called G-V-type I objective and constraint functions and their generalizations are introduced for such nonsmooth vector optimization problems. Based upon these generalized invex functions, necessary and sufficient optimality conditions are established for directionally differentiable multiobjective programming problems. Thus, new Fritz John type and Karush-Kuhn-Tucker type necessary optimality conditions are proved for the considered directionally differentiable multiobjective programming problem. Further, weak, strong and converse duality theorems are also derived for Mond-Weir type vector dual programs.


Author(s):  
Nazih Abderrazzak Gadhi ◽  
Aissam Ichatouhane

A nonsmooth semi-infinite interval-valued vector programming problem is solved in the paper by Jennane et all. (RAIRO-Oper. Res. doi: 10.1051/ro/2020066, 2020). The necessary optimality condition obtained by the authors, as well as its proof, is false. Some counterexamples are given to refute some results on which the main result (Theorem 4.5) is based. For the convinience of the reader, we correct the faulty in those results, propose a correct formulation of Theorem 4.5 and give also a short proof.


Sign in / Sign up

Export Citation Format

Share Document