A general Farkas lemma

DOI10.1007/BF00938427zbMath0543.49010WikidataQ125045249 ScholiaQ125045249MaRDI QIDQ796092

Charles W. Swartz

Publication date: 1985

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

conessubgradientsabstract Farkas lemma

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) General theory of locally convex spaces (46A03) Optimality conditions for problems in abstract spaces (49K27) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items

Pshenichnyi's theorem for vector minimization ⋮ Results of farkas type ⋮ Solvability results for sublinear functions and operators ⋮ An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains ⋮ The conjugate of a difference of functions defined on different spaces ⋮ A generl farkas type lemma ⋮ A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Farkas' theorem and optimization of infinitely constrained problems
• A generalization of the Farkas lemma and applications to convex programming
• A Solvability Theorem for Homogeneous Functions
• A programming problem with an L_p norm in the objective function
• A Gradient Inequality for a Class of Nondifferentiable Functions
• Duality in complex homogeneous programming