On linear inequality systems with smooth coefficients
From MaRDI portal
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.
Recommendations
Cites work
- A purification algorithm for semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- Analytical linear inequality systems and optimization
- Conjugacy for closed convex sets
- New descent rules for solving the linear semi-infinite programming problem
- Optimality theory for semi-infinite linear programming∗
- Representability of convex sets by analytical linear inequality systems.
Cited in
(6)- Representability of convex sets by analytical linear inequality systems.
- Relaxation methods for solving linear inequality systems: converging results
- On C^m solutions to systems of linear inequalities
- scientific article; zbMATH DE number 4136128 (Why is no real title available?)
- Quasipolyhedral sets in linear semiinfinite inequality systems
- Separating the solution sets of analytical and polynomial systems
This page was built for publication: On linear inequality systems with smooth coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777594)
