On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
type: Item
instance of: scholarly article
title: On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
zbMATH Open document ID: 1270.90058
author: M. M. Rizvi
author: R. S. Burachik
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-14T00:00:00Z
review text: The paper deals with smooth multiobjective optimization problems with inequality constraints. The following concepts are considered. Weak Kuhn-Tucker (WKT) optimality conditions are said to hold when not all the multipliers of the objective functions are zero, while strong Kuhn-Tucker (SKT) conditions are said to hold when all the multipliers of the objective functions are positive. The aim of the paper is to establish weak and strong Kuhn-Tucker necessary conditions for multiobjective optimization problems under the Guignard regularity condition (GRC) and the generalized Abadie regularity condition (GARC), respectively. The authors prove that GARC ensures SKT conditions for Geoffrion-properly efficient points. They show that GARC does not guarantee SKT for efficient points. For the special case, in which the feasible set is polyhedral and the objective functions are linear, they show that the assumption on Geoffrion-properly efficiency can be relaxed. It is shown that the condition GRC ensures WKT conditions for efficient points.
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6136271
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: regularity conditions
zbMATH Keywords: optimality conditions for efficient and Geoffrion-properly efficient solution
zbMATH Keywords: weak and strong Kuhn-Tucker conditions
reviewed by: Francisco Guerra Vazquez
MaRDI profile type: Publication
full work available at URL: s10957-012-0078-6
OpenAlex ID: W2048057532
Wikidata QID: Q58048439
cites work: Q3967376
cites work: Optimality conditions in multiobjective differentiable programming
cites work: Constrained qualifications in multiobjective optimization problems: Differentiable case
cites work: Regularity conditions in vector optimization
cites work: Regularity Conditions and Optimality in Vector Optimization
cites work: On constraint qualification in multiobjective optimization problems: Semidifferentiable case
cites work: Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
cites work: Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
cites work: Q4326385
cites work: Regularity conditions in differentiable vector optimization revisited
cites work: Proper efficiency and the theory of vector maximization
cites work: Proper Efficient Points for Maximizations with Respect to Cones
cites work: The Vector Maximization Problem: Proper Efficiency and Stability
cites work: An improved definition of proper efficiency for vector maximization with respect to cones
cites work: Efficiency and proper efficiency in vector maximization with respect to cones
cites work: On the cones of tangents with applications to mathematical programming
cites work: Regularity conditions for the linear separation of sets
cites work: Q3100596
cites work: Concepts of proper efficiency
DOI: 10.1007/S10957-012-0078-6
description: scientific article; zbMATH DE number 6136271