Farkas' theorem of nonconvex type and its application to a min-max problem

DOI10.1007/BF00938544zbMath0621.49015MaRDI QIDQ1089906

Y. Ishizuka

Publication date: 1988

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

zbMATH Keywords

optimality conditionsdirectional derivativesmin-max problemgeneralization of Farkas' theorem

Mathematics Subject Classification ID

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

Related Items

A simple approach to optimality conditions in minmax programming ⋮ Necessary optimality conditions in pessimistic bilevel programming ⋮ A generl farkas type lemma ⋮ Optimality conditions for directionally differentiable multi-objective programming problems

Cites Work

• Unnamed Item
• Generalized Farkas' theorem and optimization of infinitely constrained problems
• Necessary conditions and sufficient conditions for static minmax problems
• A generalization of the Farkas lemma and applications to convex programming
• Directional derivative of the marginal function in nonlinear programming
• Optimality conditions and algorithms for parameter design problems with two-level structure
• Nonlinear alternative theorems and nondifferentiable programming
• Minimization of a quasi-differentiable function in a quasi-differentiable set
• Differential properties of the marginal function in mathematical programming
• Convex Analysis

This page was built for publication: Farkas' theorem of nonconvex type and its application to a min-max problem