Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps
type: Item
instance of: scholarly article
title: Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps
zbMATH Open document ID: 1486.90161
author: Renying Zeng
published in: Journal of Applied Analysis
publication date: 2021-12-13T00:00:00Z
review text: The author proposes several variations of affine set-valued maps, viz., affinelike, preaffinelike, nearaffinelike, and prenearaffinelike. Examples show that these notions are different from each other. A theorem of the alternative of Farkas-Minkowski type is then derived. As applications, Lagrangian multipliers for constrained set-valued optimization problems are discussed and optimality conditions for weakly efficient solutions are obtained.
reviewed by: K. C. Sivakumar
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 7442625
zbMATH Keywords: real topological spaces
zbMATH Keywords: generalized affine set-valued maps
zbMATH Keywords: generalized convex set-valued maps
zbMATH Keywords: theorem of alternative
zbMATH Keywords: Lagrangian multipliers
MaRDI profile type: Publication
full work available at URL: jaa-2020-2042
OpenAlex ID: W3121804175
cites work: Q3932576
cites work: Q5090588
cites work: Multivalued convexity and optimization: A unified approach to inequality and equality constraints
cites work: Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
cites work: Optimization and nonsmooth analysis
cites work: Existence and Lagrangian duality for maximization of set-valued functions
cites work: Q5185568
cites work: The infinite dimensional Lagrange multiplier rule for convex optimization problems
cites work: Minimax Theorems
cites work: Theorems of the alternative for set-valued functions in infinite-dimensional spaces
cites work: Point-to-Set Maps in Mathematical Programming
cites work: Q4551944
cites work: Q3220809
cites work: A theorem of the alternative and its application to the optimization of set-valued maps
cites work: Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
cites work: Lagrange multipliers and saddle points in multiobjective programming
cites work: Optimization of set-valued functions
cites work: Stability Theory for Systems of Inequalities. Part I: Linear Systems
cites work: A theorem of the alternative with an arbitrary number of inequalities and quadratic programming
cites work: Theorems of the alternative and optimization with set-valued maps
cites work: Q5332803
cites work: Q5591247
cites work: A General Gordan Alternative Theorem with Weakened Convexity and Its Application
cites work: Generalized Motzkin theorems of the alternative and vector optimization problems
cites work: Existence of augmented Lagrange multipliers for cone constrained optimization problems
DOI: 10.1515/JAA-2020-2042
description: scientific article; zbMATH DE number 7442625