Strong unicity and alternation for linear optimization
type: Item
instance of: scholarly article
title: Strong unicity and alternation for linear optimization
zbMATH Open document ID: 0702.90086
DOI: 10.1007/BF00940642
published in: Journal of Optimization Theory and Applications
publication date: 1991-01-01T00:00:00Z
review text: We consider linear semi-infinite optimization problems and prove characterizations for strong unicity. One of these is a weak alternation property. This result suggests to introduce regular strong unicity, which is equivalent to a stronger alternation property. The theorems are used in order to prove a Haar-type theorem for linear optimization problems. An application to best Chebyshev approximation is given.
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 41A52
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 4152175
zbMATH Keywords: Haar's theorem
zbMATH Keywords: linear semi-infinite optimization
zbMATH Keywords: strong unicity
zbMATH Keywords: alternation
zbMATH Keywords: best Chebyshev approximation
author: Thomas Fischer
MaRDI profile type: Publication
cites work: A refinement of an optimality criterion and its application to parametric programming
cites work: Q3939127
cites work: Global unicity in semi-infinite optimization
cites work: A local version of haar's theorem in approximation theory
cites work: Some theorems on Cebysev approximation
cites work: Duality in semi-infinite programs and some works of Haar and Carathéodory
cites work: An Infinite Linear Program with a Duality Gap
cites work: Q5547653
cites work: Q3999912
cites work: Characterizations of strong unicity in approximation theory
cites work: Uniqueness and Differential Characterization of Approximations from Manifolds of Functions
cites work: A Unified Approach to Certain Problems of Approximation and Minimization
cites work: Q5529652
cites work: Q3895980
description: scientific article; zbMATH DE number 4152175