Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
type: Item
instance of: scholarly article
title: Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
zbMATH Open document ID: 0808.90108
DOI: 10.1007/BF01874130
published in: Acta Mathematica Hungarica
publication date: 1994-04-24T00:00:00Z
review text: Some alternative theorems and saddle point results for convex set functions with values in an ordered vector space are given. These results are generalizations of some similar convex versions in finite dimensions by Farkas, Ky Fan and two saddle point theorems of the Lagrangian.
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 556289
zbMATH Keywords: alternative theorems
zbMATH Keywords: saddle point results
author: Hang-Chin Lai
author: Péter Szilágyi
reviewed by: Stefan Mititelu
MaRDI profile type: Publication
cites work: On multiple objective programming problems with set functions
cites work: Second order optimality conditions for mathematical prograramming with set functions
cites work: Epigraphs of convex set functions
cites work: Convex programming with set functions
cites work: Optimization theory for n-set functions
cites work: Generalizations of Farkas’ Theorem
cites work: Q3236243
cites work: Proper D-solutions of multiobjective programming problems with set functions
cites work: Saddle point and duality in the optimization theory of convex set functions
cites work: Duality in mathematical programming of set functions: On Fenchel duality theorem
cites work: Duality theorem of nondifferentiable convex multiobjective programming
cites work: Moreau-Rockafellar type theorem for convex set functions
cites work: The Fenchel-Moreau Theorem for Set Functions
cites work: Optimality for set functions with values in ordered vector spaces
cites work: Strong duality for infinite-dimensional vector-valued programming problems
cites work: Optimal constrained selection of a measurable subset
cites work: A duality theorem for a convex programming problem in order complete vector lattices
full work available at URL: https://doi.org/10.1007/bf01874130
OpenAlex ID: W1975724713
Recommended article: Saddlepoints for convex programming in order vector spaces
Recommended article: Q3780031
Recommended article: Q3007172
Recommended article: Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
Recommended article: Theorems of the alternative and optimization with set-valued maps
Recommended article: Q3537209
Recommended article: A set-valued Lagrange theorem based on a process for convex vector programming
Recommended article: A theorem of the alternative and its application to the optimization of set-valued maps
Recommended article: Q4025367
Recommended article: Q5158617
description: scientific article; zbMATH DE number 556289