Farkas-type results for max-functions and applications

DOI10.1007/S11117-005-0003-4zbMath1110.49031OpenAlexW2008790278MaRDI QIDQ865005

Gert Wanka, Radu Ioan Boţ

Publication date: 13 February 2007

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-005-0003-4

zbMATH Keywords

dualitytheorems of the alternativeFarkas-type resultsminmax programmingset containment

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (4)

Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities ⋮ Convex robust sum optimization problems with conic and set constraints: duality and optimality conditions revisited ⋮ Dual semidefinite programs without duality gaps for a class of convex minimax programs ⋮ Some new Farkas-type results for inequality systems with DC functions

Cites Work

• Duality for minmax programs
• Strong duality for generalized convex optimization problems
• Set containment characterization
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Farkas-Type Results With Conjugate Functions
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Farkas-type results for max-functions and applications