Around a Farkas type lemma
From MaRDI portal
Publication:6648846
DOI10.1080/02331934.2023.2252848MaRDI QIDQ6648846
Miguel Angel Goberna, Unnamed Author, Michel Volle
Publication date: 5 December 2024
Published in: Optimization (Search for Journal in Brave)
Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Characterizations of solution sets of convex vector minimization problems
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- New Farkas-type constraint qualifications in convex infinite programming
- Fundamentals of Convex Analysis and Optimization
This page was built for publication: Around a Farkas type lemma