Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces

DOI10.1007/BF01874130zbMath0808.90108OpenAlexW1975724713MaRDI QIDQ1320449

Hang-Chin Lai, Péter Szilágyi

Publication date: 24 April 1994

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01874130

zbMATH Keywords

alternative theoremssaddle point results

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Related Items (5)

New optimality conditions for a nondifferentiable fractional semipreinvex programming problem ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ On minimax fractional programming of generalized convex set functions ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Necessary and sufficient conditions for minimax fractional programming

Cites Work

• Unnamed Item
• Optimization theory for n-set functions
• Optimal constrained selection of a measurable subset
• Duality in mathematical programming of set functions: On Fenchel duality theorem
• On multiple objective programming problems with set functions
• Duality theorem of nondifferentiable convex multiobjective programming
• Proper D-solutions of multiobjective programming problems with set functions
• Epigraphs of convex set functions
• Convex programming with set functions
• Strong duality for infinite-dimensional vector-valued programming problems
• Moreau-Rockafellar type theorem for convex set functions
• Optimality for set functions with values in ordered vector spaces
• A duality theorem for a convex programming problem in order complete vector lattices
• Second order optimality conditions for mathematical prograramming with set functions
• The Fenchel-Moreau Theorem for Set Functions
• Saddle point and duality in the optimization theory of convex set functions
• Generalizations of Farkas’ Theorem

This page was built for publication: Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces