Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
View through CrossRef
Abstract
This paper deals with a robust multiobjective optimization problem involving nonsmooth/nonconvex real-valued functions. Under an appropriate constraint qualification, we establish necessary optimality conditions for weakly robust efficient solutions of the considered problem. These optimality conditions are presented in terms of Karush-Kuhn-Tucker multipliers and convexificators of the related functions. Examples illustrating our findings are also given.
Title: Necessary Optimality Conditions for Robust Nonsmooth Multiobjective Optimization Problems
Description:
Abstract
This paper deals with a robust multiobjective optimization problem involving nonsmooth/nonconvex real-valued functions.
Under an appropriate constraint qualification, we establish necessary optimality conditions for weakly robust efficient solutions of the considered problem.
These optimality conditions are presented in terms of Karush-Kuhn-Tucker multipliers and convexificators of the related functions.
Examples illustrating our findings are also given.
Related Results
Robust Optimality and Duality for Nonsmooth Multiobjective Programming Problems with Vanishing Constraints under Data Uncertainty
Robust Optimality and Duality for Nonsmooth Multiobjective Programming Problems with Vanishing Constraints under Data Uncertainty
This article investigates robust optimality and duality for a class of nonsmooth multiobjective programming problems with vanishing constraints under data uncertainty (in short, UN...
Second Order Optimality Conditions in Vector Optimization Problems.
Second Order Optimality Conditions in Vector Optimization Problems.
We are interested in proving optimality conditions for optimization problems. By
means of different second-order tangent sets, various second-order necessary optimality
conditions ...
Duality for a class of nonsmooth multiobjective programming problems using convexificators
Duality for a class of nonsmooth multiobjective programming problems using convexificators
As duality is an important and interesting feature of optimization problems,
in this paper, we continue the effort of Long and Huang [X. J. Long, N. J.
Huang, Optimality cond...
Multi-objective optimization in graphical models
Multi-objective optimization in graphical models
Many real-life optimization problems are combinatorial, i.e. they concern a choice of the best solution from a finite but exponentially
large set of alternatives. Besides, the sol...
Performance evaluation of a multiobjective optimization algorithm for the design of water distribution networks
Performance evaluation of a multiobjective optimization algorithm for the design of water distribution networks
<p>Multiobjective water distribution networks (WDNs) are a very lively area of research (Marques et al., 2018). To evaluate the performance of these algorithms, diffe...
Multiobjective Salp Swarm Algorithm Approach for Transmission Congestion Management
Multiobjective Salp Swarm Algorithm Approach for Transmission Congestion Management
In the newly emerged electric supply industry, the profit maximizing tendency of market participants has developed the problem of transmission congestion as the most crucial issue....
Estimation of Parameters and Optimality of Second-Order Spherical Designs Using Quadratic Function Relative to Non-Spherical Face centered CCD
Estimation of Parameters and Optimality of Second-Order Spherical Designs Using Quadratic Function Relative to Non-Spherical Face centered CCD
The study presented the estimation of parameters and optimality of second-order spherical designs using quadratic model in comparison to the non-spherical face centered CCD for var...
Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming
Optimality conditions for nonsmooth interval-valued and multiobjective semi-infinite programming
We consider a nonsmooth semi-infinite interval-valued vector programming problem, where the objectives and constraint functions need not to be locally Lipschitz. Using Abadie’s con...