scientific article; zbMATH DE number 3238144
From MaRDI portal
Publication:5525616
Cited in
(32)- Boundedness relations in linear semi-infinite programming
- A theory of linear inequality systems
- On duality in semi-infinite programming and existence theorems for linear inequalities
- Locally Farkas-Minkowski linear inequality systems
- Locally polyhedral linear inequality systems
- Representability of convex sets by analytical linear inequality systems.
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Linear semi-infinite programming theory: an updated survey
- Stability of the feasible set for linear inequality systems: A carrier index set approach
- On linear systems containing strict inequalities
- Analytical linear inequality systems and optimization
- Selected applications of linear semi-infinite systems theory
- On finite linear systems containing strict inequalities
- Regularity modulus of arbitrarily perturbed linear inequality systems
- Ill-posedness with respect to the solvability in linear optimization
- On the stability of linear systems with an exact constraint set
- On infinite systems of linear inequalities
- Topological stability of linear semi-infinite inequality systems
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- Duality for sets of strong Slater points
- Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems
- Integer optimization by α‐dense curves
- Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
- Primal and dual characterizations for Farkas type lemmas in terms of closedness criteria
- New applications of linear semi-infinite optimization theory in copositive optimization
- Necessary and sufficient conditions for solving infinite-dimensional linear inequalities
- Semi-infinite programming
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- On the equivalence of parametric contexts for linear inequality systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525616)