A theorem of the alternative with application to convex programming: optimality, duality, and stability

DOI10.1016/0022-247X(73)90240-0zbMath0252.90047MaRDI QIDQ2557650

Mokhtar S. Bazaraa

Publication date: 1973

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Related Items (10)

Convexlike alternative theorems and mathematical programming ⋮ Theorems of the alternative for multifunctions with applications to optimization: General results ⋮ Generalized Motzkin theorems of the alternative and vector optimization problems ⋮ Primal and dual optimality criteria in convex programming ⋮ Optimality conditions using sum-convex approximations ⋮ KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions ⋮ On nonlinear programming in complex spaces ⋮ On fuzzy convexity and parametric fuzzy optimization ⋮ Theorems of the alternative and optimality conditions ⋮ Extension of optimality conditions via supporting functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lagrange multipliers and nonlinear programming
• Systems of Inequalities Involving Convex Functions
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• A Gradient Inequality for a Class of Nondifferentiable Functions
• A Necessary and Sufficient Qualification for Constrained Optimization
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

This page was built for publication: A theorem of the alternative with application to convex programming: optimality, duality, and stability