Generalized Farkas' theorem and optimization of infinitely constrained problems

DOI10.1007/BF00933510zbMath0494.90062MaRDI QIDQ1169404

Ryu Katayama, Eitaro Aiyoshi, Kiyotaka Shimizu

Publication date: 1983

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

zbMATH Keywords

necessary optimality conditionstheorem of the alternativesystem of linear inequalitiesmin-max problemsgeneralization of Farkas' theoreminfinitely constrained problemsmax operationssatisfaction conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35)

Related Items

Farkas' theorem of nonconvex type and its application to a min-max problem ⋮ Results of farkas type ⋮ KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions ⋮ The Farkas lemma of Shimizu, Aiyoshi and Katayama ⋮ A general Farkas lemma ⋮ Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions

Cites Work

• Unnamed Item
• Infinitely constrained optimization problems
• Necessary conditions and sufficient conditions for static minmax problems
• Necessary conditions for min-max problems and algorithms by a relaxation procedure
• Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
• The Theory of Max-Min, with Applications
• Necessary and Sufficient Optimality Conditions for the Fritz John Problem with Linear Equality Constraints