Separating the solution sets of analytical and polynomial systems
type: Item
instance of: scholarly article
title: Separating the solution sets of analytical and polynomial systems
zbMATH Open document ID: 1112.90086
DOI: 10.1007/BF02579058
author: Miguel Angel Goberna
author: L. A. Hernández
author: Maxim Ivanov Todorov
published in: Top
publication date: 2006-04-04T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 15A39
Mathematics Subject Classification ID: 52A20
zbMATH DE Number: 5017195
zbMATH Keywords: Linear semi-infinite programming
zbMATH Keywords: linear systems
zbMATH Keywords: convex sets
MaRDI profile type: Publication
cites work: An extension of the simplex algorithm for semi-infinite linear programming
cites work: On linear inequality systems with smooth coefficients
cites work: Analytical linear inequality systems and optimization
cites work: On the stability of the boundary of the feasible set in linear optimization
cites work: Q4357206
cites work: Representability of convex sets by analytical linear inequality systems.
full work available at URL: https://doi.org/10.1007/bf02579058
OpenAlex ID: W2077978657
description: scientific article; zbMATH DE number 5017195