On linear inequality systems with smooth coefficients (Q1777594): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An extension of the simplex algorithm for semi-infinite linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A purification algorithm for semi-infinite programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analytical linear inequality systems and optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New descent rules for solving the linear semi-infinite programming problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimality theory for semi-infinite linear programming<sup>∗</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conjugacy for closed convex sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representability of convex sets by analytical linear inequality systems. / rank | |||
Normal rank |
Latest revision as of 11:47, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On linear inequality systems with smooth coefficients |
scientific article |
Statements
On linear inequality systems with smooth coefficients (English)
0 references
24 May 2005
0 references
The authors consider linear inequality systems of the form \(\sigma=\{a_t\,x\geq b_t,\;t\in T\}\), where \(T\subset\mathbb{R}\) is compact, and \(b_t=b(t)\in\mathbb{R}\), \(a_t=a(t)=(a_1(t),\dots,a_n(t))\in\mathbb{R}^n\) are polynomial (resp. analytical) functions. Sufficient conditions are given for certain subsets \(F\) of \(\mathbb{R}^n\) to be solutions of an analytical or polynomial system. Several examples are given as applications of the characterizations obtained.
0 references
linear inequality systems
0 references
closed convex sets
0 references
linear semi-infinite programming
0 references