Farkas-Minkowski systems in semi-infinite programming

DOI10.1007/BF01442122zbMath0438.90054OpenAlexW2069235686MaRDI QIDQ1142158

Jesus T. Pastor, Marco A. López, Miguel Angel Goberna

Publication date: 1981

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01442122

zbMATH Keywords

Lagrange multipliersoptimality conditionsconvex conenecessary and sufficient conditionssemi-infinite programmingconstraint qualificationregular pointsaddle-point conditionFarkas-Minkowski systemsKuhn-Tucker type conditionHaar duality theoremsystem of infinite linear inequalities

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (16)

Una caracterización dual de optimalidad para optimización convexa ⋮ Efficient and weakly efficient solutions for the vector topical optimization ⋮ Optimal value function in semi-infinite programming ⋮ Boundedness relations in linear semi-infinite programming ⋮ A theory of linear inequality systems ⋮ Results of farkas type ⋮ Locally polyhedral linear inequality systems ⋮ Dimension and finite reduction in linear semi-infinite programming ⋮ An optimality test for semi-infinite linear programming ⋮ Reduction and Discrete Approximation in Linear Semi-Infinite Programming ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On strong and total Lagrange duality for convex optimization problems ⋮ Stability in disjunctive linear optimization I: continuity of the feasible set ⋮ Selected applications of linear semi-infinite systems theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing a perfect duality in infinite programming
• On infinite systems of linear inequalities
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Convex Analysis

This page was built for publication: Farkas-Minkowski systems in semi-infinite programming