Resumen de Upper semicontinuity of the fesible set mapping in linear semi-infinite programming

María Josefa Cánovas Cánovas, Marco A. López Cerdá, Juan Parra López

• We deal with this property in two different frameworks: a 'non-parametric one', (identifying each linear inequality system with its coefficient functions), and a parametic setting, where the coefficients continuosly depend on an external parameter (ranging in a metric space). In both cases, it turns out that the upper semicontinuity of the feasible set mapping strongly relies on the recession properties of the feasible set corresponding to the nominal problem, and the approach comes through the idea of the so-called reinforced systems.