Linear semi-infinite programming theory: an updated survey
type: Item
instance of: scholarly article
title: Linear semi-infinite programming theory: an updated survey
zbMATH Open document ID: 1058.90067
DOI: 10.1016/S0377-2217(02)00327-2
author: Marco Antonio López Cerdá
author: Miguel Angel Goberna
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 49K40
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 1832952
zbMATH Keywords: Linear and convex semi-infinite programming
zbMATH Keywords: Linear and convex inequality systems
zbMATH Keywords: Convex sets
zbMATH Keywords: Stability
zbMATH Keywords: Well-posedness
zbMATH Keywords: Parametric optimization
zbMATH Keywords: Constraint qualifications
zbMATH Keywords: Global error bound
MaRDI profile type: Publication
cites work: Two logarithmic barrier methods for convex semi-infinite problems.
cites work: A dynamic model for component testing
cites work: Strong duality for inexact linear programming
cites work: Locally polyhedral linear inequality systems
cites work: Simplex-like trajectories on quasi-polyhedral sets.
cites work: An extension of the simplex algorithm for semi-infinite linear programming
cites work: Q3770273
cites work: Q4219221
cites work: On closed convex sets without boundary rays and asymptotes
cites work: Q4277838
cites work: Robust convex optimization
cites work: Methods for Global Prior Robustness under Generalized Moment Conditions
cites work: On the illumination of smooth convex bodies
cites work: Stability of the feasible set for linear inequality systems: A carrier index set approach
cites work: Stability and Well-Posedness in Linear Semi-Infinite Programming
cites work: Solving strategies and well-posedness in linear semi-infinite programming
cites work: DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
cites work: Duality in semi-infinite programs and some works of Haar and Carathéodory
cites work: On some applications of LSIP to probability and statistics.
cites work: Well-posed optimization problems
cites work: Q3991512
cites work: \(\ell_1\)-minimization with magnitude constraints in the frequency domain
cites work: Locally Farkas-Minkowski systems in convex semi-infinite programming
cites work: Linear programming with fuzzy coefficients in constraints
cites work: LIMINAL NUMBER OF A CONVEX BODY WITH A SMOOTH BOUNDARY
cites work: Continuous Convex Sets.
cites work: Geometric fundamentals of the simplex method in semi-infinite programming
cites work: Analytical linear inequality systems and optimization
cites work: On the characterization of some families of closed convex sets
cites work: Q3840137
cites work: Recent contributions to linear semi-infinite optimization
cites work: Separation by hyperplanes: a linear semi-infinite programming approach.
cites work: On feasible sets defined through Chebyshev approximation
cites work: Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
cites work: Q4349353
cites work: Q4386858
cites work: A relaxed cutting plane algorithm for solving fuzzy inequality systems
cites work: Perturbation analysis of global error bounds for systems of linear inequalities
cites work: Competitive equilibrium with search frictions: a general equilibrium approach
cites work: Q4547603
cites work: One-parameter families of feasible sets in semi-infinite optimization
cites work: Semi-infinite optimization: Structure and stability of the feasible set
cites work: Minimal spherical shells and linear semi-infinite optimization.
cites work: Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
cites work: Path-following proximal approach for solving ill-posed convex semi-infinite programming problems
cites work: Proximal interior point method for convex semi-infinite programming
cites work: Q4369266
cites work: Asymptotic constraint qualifications and global error bounds for convex inequalities.
cites work: On extreme points of bounded sets of generalized finite sequence spaces
cites work: On constraint sets of infinite linear programs over ordered fields
cites work: On Linear Semi-Infinite Programming Problems: An Algorithm
cites work: A multi-local optimization algorithm
cites work: On the numerical treatment of linearly constrained semi-infinite optimization problems
cites work: Optimization under uncertainty and linear semi-infinite programming: a survey.
cites work: Q4257334
cites work: Constraint qualifications for semi-infinite systems of convex inequalities
cites work: Asymptotic constraint qualifications and error bounds for semi-infinite systems of convex inequalities.

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: A dual parameterization approach to linear-quadratic semi-infinite programming problems

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Stability of the feasible set mapping in convex semi-infinite programming.

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: A New Algorithm for State-Constrained Separated Continuous Linear Programs

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Quasipolyhedral sets in linear semiinfinite inequality systems

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Combinatorial problems on the illumination of convex bodies

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Accelerated polynomial approximation of finite order entire functions by growth reduction

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Q3701215

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Semi-infinite linear programming: A unified approach to digital filter design with time- and frequency-domain specifications

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Locally Farkas-Minkowski linear inequality systems

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Q4948599

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Q3840143

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Variational Analysis

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Semi-infinite assignment and transportation games.

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Pointwise versions of the maximum theorem with applications in optimization

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Estimation and testing in constrained covariance component models

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: The Owen set and the core of semi-infinite linear production situations.

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Q3832314

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Visible Shorelines

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Semi-infinite transportation problems

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: A perturbation method for solving linear semi-infinite programming problems

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Analytic center based cutting plane method for linear semi-infinite programming.

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Q5525616

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Stability in linear programming models: An index set approach

Linear semi-infinite programming theory: an updated survey (cites work)
cites work: Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping

Linear semi-infinite programming theory: an updated survey (full work available at URL)
full work available at URL: s0377-2217(02)00327-2

Linear semi-infinite programming theory: an updated survey (OpenAlex ID)
OpenAlex ID: W2083247753