On feasible sets defined through Chebyshev approximation

DOI10.1007/BF01194400zbMath0948.90136OpenAlexW1982061606MaRDI QIDQ1298746

Francisco Guerra, Miguel A. Jiménez

Publication date: 22 August 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

semi-infinite programmingconstraint qualificationChebyshev approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34)

Related Items (6)

On Proper Efficiency in Multiobjective Semi-infinite Optimization ⋮ Characterization of the feasible set mapping in one class of semi-infinite optimization problems. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear semi-infinite programming theory: an updated survey ⋮ γ-Active Constraints in Convex Semi-Infinite Programming

Cites Work

• Semi-infinite optimization: Structure and stability of the feasible set
• An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
• On equivalent stability properties in semi-infinite optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On feasible sets defined through Chebyshev approximation