On feasible sets defined through Chebyshev approximation
type: Item
instance of: scholarly article
title: On feasible sets defined through Chebyshev approximation
zbMATH Open document ID: 0948.90136
DOI: 10.1007/BF01194400
author: Francisco Guerra
author: Miguel A. Jiménez
published in: Mathematical Methods of Operations Research
publication date: 1999-08-22T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 41A50
zbMATH DE Number: 1326503
zbMATH Keywords: Chebyshev approximation
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: constraint qualification
MaRDI profile type: Publication
cites work: Q5543516
cites work: Q4349352
cites work: Q3939127
cites work: On equivalent stability properties in semi-infinite optimization
cites work: Q3042868
cites work: Semi-infinite optimization: Structure and stability of the feasible set
cites work: An Extension of the Karush–Kuhn–Tucker Necessity Conditions to Infinite Programming
full work available at URL: https://doi.org/10.1007/bf01194400
OpenAlex ID: W1982061606
description: scientific article; zbMATH DE number 1326503