Around a Farkas type lemma

DOI10.1080/02331934.2023.2252848MaRDI QIDQ6648846zbMATH OpenFDO

Authors Miguel Angel Goberna, M. Volle

Publication date 5 December 2024

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2023.2252848

Mathematics Subject Classification ID

Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15)

Recommendations

• New Farkas-type constraint qualifications in convex infinite programming
• Constraint qualifications and Farkas lemma in convex infinite programming
• Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
• Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
• scientific article; zbMATH DE number 4050399

Cites work

• Characterizations of solution sets of convex vector minimization problems
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Farkas' lemma: three decades of generalizations for mathematical optimization
• From linear to convex systems: consistency, Farkas' lemma and applications
• Fundamentals of Convex Analysis and Optimization
• New Farkas-type constraint qualifications in convex infinite programming

This page was built for publication: Around a Farkas type lemma

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648846)