Algoritmos para o problema de localização de uma facilidade com distâncias limitadas e restrições de atendimento

The objective in the facility location problem with limited distances is to minimize the sum of distance functions from the facility to the customers, but with a limit on each distance, after which the corresponding function becomes constant. The problem has applications in situations where the service provided by the facility is insensitive after a given threshold distance (eg. fire station location). In this work, we propose a global optimization algorithm for the case in which there are lower and upper limits on the numbers of customers that can be served

Os artigos de Euler sobre os números amigáveis

Among the many methodological resources that the mathematics teacher can use in the classroom, we can cite the History of Mathematics which has contributed to the development of activities that promotes students curiosity about mathematics and its history. In this regard, the present dissertation aims to translate and analyze, mathematically and historically, the three works of Euler about amicable numbers that were writed during the Eighteenth century with the same title: De numeris amicabilibus. These works, despite being written in 1747 when Euler lived in Berlin, were published in different times and places. The first, published in 1747 in Nova Acta Eruditorum and which received the number E100 in the Eneström index, summarizes the historical context of amicable numbers, mentions the formula 2nxy & 2nz used by his precursors and presents a table containing thirty pairs of amicable numbers. The second work, E152, was published in 1750 in Opuscula varii argument. It is the result of a comprehensive review of Euler s research on amicable numbers which resulted in a catalog containing 61 pairs, a quantity which had never been achieved by any mathematician before Euler. Finally, the third work, E798, which was published in 1849 at the Opera postuma, was probably the first among the three works, to be written by Euler

The Interval Constructor on classes of ML-algebras

Monoidal logic, ML for short, which formalized the fuzzy logics of continuous t-norms and their residua, has arisen great interest, since it has been applied to fuzzy mathematics, artificial intelligence, and other areas. It is clear that fuzzy logics basically try to represent imperfect or fuzzy information aiming to model the natural human reasoning. On the other hand, in order to deal with imprecision in the computational representation of real numbers, the use of intervals have been proposed, as it can guarantee that the results of numerical computation are in a bounded interval, controlling, in this way, the numerical errors produced by successive roundings. There are several ways to connect both areas; the most usual one is to consider interval membership degrees. The algebraic counterpart of ML is ML-algebra, an interesting structure due to the fact that by adding some properties it is possible to reach different classes of residuated lattices. We propose to apply an interval constructor to ML-algebras and some of their subclasses, to verify some properties within these algebras, in addition to the analysis of the algebraic aspects of them