Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Tung (2019)
Karush–Kuhn–Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functionsJournal of Applied Mathematics and Computing, 62
N. Kanzi (2013)
Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problemsJournal of Global Optimization, 56
Zhao Quan (2015)
Strong Kuhn-Tucker optimality in nonsmooth multiobjective optimization problems
M. Ehrgott (2005)
Multicriteria Optimization
RS Burachik, MM Rizvi (2014)
Proper effciency and proper Karush–Kuhn–Tucker conditions for smooth multiobjective optimization problemsVietnam J. Math., 42
G Caristi, N Kanzi (2015)
Karush–Kuhn–Tucker type conditions for optimality of nonsmooth multiobjective semi-infinite programmingInt. J. Math. Anal., 9
M. Goberna, M. López (1998)
Linear Semi-Infinite Optimization
(2017)
Optimality and regularity conditions using Mordukhovich’s subdifferential
MA Goberna, N Kanzi (2017)
Optimality conditions in convex multiobjective SIPMath. Program., 164
X. Long, Xianfu Wang, Z. Peng (2016)
Characterizations ofthe solution set for nonconvex semi-infinite programming problems
Klaudia Beich (2016)
Theory Of Vector Optimization
T. Maeda (1994)
Constraint qualifications in multiobjective optimization problems: Differentiable caseJournal of Optimization Theory and Applications, 80
N. Kanzi (2014)
On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian dataOptimization Letters, 9
E. Constantin (2018)
First-order necessary conditions in locally Lipschitz multiobjective optimizationOptimization, 67
Truong Ha (2012)
The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives
L. Tung (2020)
Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential SubdifferentialsNumerical Functional Analysis and Optimization, 41
D. Luu (2019)
Necessary Efficiency Conditions for Vector Equilibrium Problems with General Inequality Constraints via ConvexificatorsBulletin of the Brazilian Mathematical Society, New Series
RT Rockafellar (1970)
Convex Analysis. Princeton Mathematical Series
N. Kanzi (2018)
Necessary and Sufficient Conditions for (Weakly) Efficient of Non-Differentiable Multi-Objective Semi-Infinite Programming ProblemsIranian Journal of Science and Technology, Transactions A: Science, 42
Alireza Kabgani, M. Soleimani-damaneh (2018)
Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificatorsOptimization, 67
N. Kanzi, S. Nobakhtian (2013)
Optimality conditions for nonsmooth semi-infinite multiobjective programmingOptimization Letters, 8
F. Giannessi (2006)
Variational Analysis and Generalized DifferentiationJournal of Optimization Theory and Applications, 131
T. Chuong, J. Yao (2014)
Isolated and Proper Efficiencies in Semi-Infinite Vector Optimization ProblemsJournal of Optimization Theory and Applications, 162
T. Chuong, Do Kim (2014)
Nonsmooth Semi-infinite Multiobjective Optimization ProblemsJournal of Optimization Theory and Applications, 160
(2018)
On optimality conditions forHenig efficiency and superefficiency in vector equilibrium problems
Yogendra Pandey, S. Mishra (2016)
On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraintsOper. Res. Lett., 44
M. Goberna, F. Vázquez, M. Todorov (2016)
Constraint qualifications in convex vector semi-infinite optimizationEur. J. Oper. Res., 249
N. Kanzi (2014)
Two Constraint Qualifications for Non-Differentiable Semi-Infinite Programming Problems Using Fr´echet and Mordukhovich SubdifferentialsJournal of Mathematical Extension, 8
J. Borwein (1977)
Proper Efficient Points for Maximizations with Respect to ConesSiam Journal on Control and Optimization, 15
A. Guerraggio, E. Molho, A. Zaffaroni (1994)
On the notion of proper efficiency in vector optimizationJournal of Optimization Theory and Applications, 82
T. Chuong, Do Kim (2016)
Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applicationsAnnals of Operations Research, 267
F. Clarke (1983)
Optimization And Nonsmooth Analysis
R. Burachik, M. Rizvi (2012)
On Weak and Strong Kuhn–Tucker Conditions for Smooth Multiobjective OptimizationJournal of Optimization Theory and Applications, 155
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
L. Tung (2018)
Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferentialRAIRO Oper. Res., 52
TDX Ha (2011)
Recent Advances in Vector Optimization, Chapter 12
In this paper, we study strong Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming. By using some regularity conditions in the sense of Mordukhovich subdifferentials and Clarke subdifferentials, we obtain some strong necessary optimality conditions for Borwein properly efficient solutions. Some examples are also provided to illustrate that our regularity conditions have more advantages than the previous regularity conditions in some cases. Keywords Multiobjective semi-infinite programming · Mordukhovich subdifferentials · Clarke subdifferentials · Borwein properly efficient solutions · Strong KKT optimality conditions Mathematics Subject Classification 90C46 · 90C29 · 90C34 · 49J52 1 Introduction The multiobjective optimization problem (MOP) with an infinite number of constraints is called multiobjective semi-infinite programming (MSIP). Due to the nature of con- flict over the objectives, it is hard to find an ideal solution that optimizes all the objectives simultaneously. Hence, Pareto efficient solutions and many types of proper efficient solutions were introduced, see e.g. the books (Ehrgott 2005;Luc 1989), the review (Guerragio et al. 1994), the recent paper (Ha 2011) and references therein. To find the efficient solutions, weak and strong Karush–Kuhn–Tucker (KKT) optimality conditions were studied. Strong KKT optimality conditions give more information Le Thanh Tung lttung@ctu.edu.vn Department
Bulletin of the Brazilian Mathematical Society, New Series – Springer Journals
Published: Dec 13, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.