## (Español) El CIO acoge el IX Seminario Internacional en Optimización y Análisis Variacional

2 September, 2019 | ||

10:00 am | a | 1:30 pm |

2 September, 2019 | ||

10:00 am | a | 1:30 pm |

16 July, 2019 | ||

12:30 pm | a | 1:30 pm |

**Speaker:** Magdalena Kapelko (Wrocław University of Economics)

**Title:** “Modelling Environmental Inefficiency under a Quota System”

**Date:** Tuesday, July 16, 12:30 a.m.

**Localication:** CIO Seminar Room (Torretamarit Building)

**Abstract.** This paper introduces the methodology necessary to evaluate inefficiency of regulated decision making units that operate under quotas through Data Envelopment Analysis (DEA), accounting for both quotas’ restrictions and negative environmental externalities of production. Three technical inefficiency measures are proposed: inefficiency in the production of marketed output, environmental inefficiency, and inefficiency with quotas. It is then shown how to aggregate these measures in order to obtain indicators of overall performance. The new approach is illustrated through a numerical example that uses real data available for the European Union dairy sector. The results show that considerable differences in inefficiencies could be found when quotas restrictions are accounted for in the model than in the model without quota imposition, indicating that not accounting explicitly for quotas when measuring performance in regulated sectors may lead to a not accurate estimation of firms’ technical inefficiency.

17 June, 2019 | ||

12:30 pm | a | 1:30 pm |

**Speaker:** Miriam G. Báez Hernández (Veracruzana University of Mexico)

**Title:** “Approach schemes for some Infinite Linear Programming problems”

**Date:** Monday, July 17, 12:30 a.m.

**Localication:** CIO Seminar Room (Torretamarit Building)

**Abstract.** In this talk we will present approximation schemes for problems of Infinite Linear Programming. Some examples of problems brought to Infinite Linear Programming are: the Problem of Mass Transfer, Semi-Infinite Linear Programming, the Transboundary Problem and the Markov Control Problem. One of the most important techniques of Infinite Linear Programming is the approach theory, for which it is necessary to look for conditions under which there are solutions for a particular problem. Hernández-Lerma and Lasserre propose a general approximation scheme for infinite linear programs, which requires two procedures: aggregation-relaxation of the constraints and internal approximation of the variable of interest. Applying the above, the Infinite Linear Programming problem is discretized. In this talk, we will show the computational implementation of the scheme proposed by Hernández-Lerma and Lasserre, to the Problem of Mass Transfer of Monge-Kantorovich. We will end the talk with an approximation scheme for the Markov Control Problem with discount criteria. Hernández-Lerma and Lasserre prove that the Markov Control Problem with discount criteria is equivalent to an Infinite Linear Programming problem when using occupation measures, using the equivalent linear programming problem and under the proposed algorithm for the Transfer Problem of Masses of Monge-Kantorovich proposed by Gabriel-Argüelles, López-Martínez and González-Hernádez we will show an approximation scheme in compact spaces.

3 July, 2019 | ||

11:00 am | a | 12:00 pm |

**Speaker:** Justo Puerto (University of Seville)

**Title:** “Revisiting some models of data analysis in the hand of location theory”

**Date:** Wednesday, July 3, 11:00 am.

**Localication:** Classrooms 0.1 and 0.2 of the CIO (Torretamarit Building)

**Abstract.** This talk presents connections between localization theory and some basic aspects of data analysis. For this, the problem of locating dimensional structures that replace point servers will be addressed. Among the large number of problems that have been studied, we will focus on locating hyperplanes in finite dimension spaces due to their implications in the adjustment of data sets and in the supervised classification. We will approach two hyperplane localization models that give rise to two models of data analysis: the problem of grouping and adjusting, and the problem of supervised learning on datasets with more than two classes. We will present the models and their properties and analyze the computational results on known databases.

19 June, 2019 | ||

12:30 pm | a | 1:30 pm |

10 June, 2019 | ||

12:30 pm | a | 1:30 pm |