Strong unicity and alternation for linear optimization (Q915659): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1096829 |
||
| Property / author | |||
| Property / author: Thomas Fischer / rank | |||
Revision as of 08:44, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong unicity and alternation for linear optimization |
scientific article |
Statements
Strong unicity and alternation for linear optimization (English)
0 references
1991
0 references
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.
0 references
Haar's theorem
0 references
linear semi-infinite optimization
0 references
strong unicity
0 references
alternation
0 references
best Chebyshev approximation
0 references
