Nonlinear alternative theorems and nondifferentiable programming

DOI10.1007/BF01920919zbMath0622.90069MaRDI QIDQ3760302

Vaithilingam Jeyakumar

Publication date: 1984

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

constraint qualificationreal normed linear spacesexistence of dual programsLagrange conditions for optimalitynonlinear Farkas-type theorem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48) Optimality conditions for problems in abstract spaces (49K27)

Related Items

Farkas' theorem of nonconvex type and its application to a min-max problem ⋮ Results of farkas type ⋮ Nondifferentiable programming and duality with modified convexity ⋮ Further generalizations of Farkas' theorem and their applications in optimal control ⋮ On Quasidifferentiable Functions and Non-Differentiable Programming ⋮ Farkas' lemma for separable sublinear inequalities without qualifications ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization ⋮ Nonconvex theorems of the alternative and minimization ⋮ A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence and nonexistence of Lagrange multipliers in Banach spaces
• Foundations of optimization
• An application of Guignard's generalized Kuhn-Tucker conditions
• A generalization of the Farkas lemma and applications to convex programming
• Regularity and stability for the mathematical programming problem in Banach spaces
• Nonlinear programming in locally convex spaces
• On an abstract control problem
• Asymptotic kuhn-tucker conditions in abstract spaces
• A generalized Farkas lemma with applications to quasidifferentiable programming
• Characterizations of optimality without constraint qualification for the abstract convex program
• Extensions of Asymptotic Kuhn–Tucker Conditions in Mathematical Programming
• State Constraints in Convex Control Problems of Bolza
• Normed Convex Processes

This page was built for publication: Nonlinear alternative theorems and nondifferentiable programming