Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization

DOI10.1007/s11750-014-0317-0zbMath1304.90195OpenAlexW2057385360MaRDI QIDQ5965674

Marco A. López

Publication date: 8 October 2014

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-014-0317-0

zbMATH Keywords

nonlinear systemscontinuous optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (5)

A discrete variant of Farkas' lemma ⋮ Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization ⋮ A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals ⋮ A discrete variant of Farkas' lemma and related results ⋮ A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints

Cites Work

• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Convex semi-infinite games
• Locally Farkas-Minkowski linear inequality systems
• Dual characterizations of set containments with strict convex inequalities
• Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
• Non-convex infinite games
• Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
• Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces

This page was built for publication: Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization