A new version of Farkas' lemma and global convex maximization

DOI10.1016/0893-9659(93)90097-7zbMath0818.90088OpenAlexW1974461145WikidataQ124900500 ScholiaQ124900500MaRDI QIDQ1312036

V. Pereyra

Publication date: 19 January 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(93)90097-7

zbMATH Keywords

constrained convex maximizationnonlinear extension of Farkas' Lemmareverse convex inequality

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Related Items (4)

Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization ⋮ A generl farkas type lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Farkas lemma for difference sublinear systems and quasidifferentiable programming
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981

This page was built for publication: A new version of Farkas' lemma and global convex maximization