A generl farkas type lemma

DOI10.1080/10652469608819102zbMath0860.90099OpenAlexW1993347385WikidataQ124810313 ScholiaQ124810313MaRDI QIDQ4716309

Wen Song

Publication date: 26 November 1996

Published in: Integral Transforms and Special Functions (Search for Journal in Brave)

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

zbMATH Keywords

Lipschitz functioninvexgeneral Farkas lemma for nonlinear systemsLipschitz set-valued mapping

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25)

Related Items

Necessary and sufficient conditions for solving infinite-dimensional linear inequalities

Cites Work

• A general Farkas lemma
• Farkas' theorem of nonconvex type and its application to a min-max problem
• A generalization of the Farkas lemma and applications to convex programming
• A new version of Farkas' lemma and global convex maximization
• A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
• Invex multifunctions and duality
• Optimization and nonsmooth analysis
• Results of farkas type
• Regularity, calmness and support principle
• A generalized Farkas lemma with applications to quasidifferentiable programming
• Generalized invexity and duality theories with multifunctions
• Invexity in multifunction optimization
• Set-valued analysis

This page was built for publication: A generl farkas type lemma