Książka = Book ; KS/6/2005/T42R01P04
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
[6], 61-69 stron ; 21 cm ; Bibliografia s. 69
The paper deals with the problem of the efficient allocation of financial means to air pollution sources (mainly power and heating plants) located in a given region. The problem consists in minimization of the function, reflecting environmental losses due to air pollution, subject to costs constraints. Minimal value of the function can be achieved by optimal selection of the desulfurization technologies for each emission source, since the analysis is made on the example of sulfur oxides, which are the main air pollutants in Poland. Since both the number of emission sources and the number of desulfurization technologies are limited, the task belongs to a class of integertype optimization problems. The full enumeration of all assignments of technologies to emission sources cannot be implemented due to the huge number of variables. The paper presents a dynamic programming method approach for solving the problem. The method was tested on the case of Silesia Region (Poland) with the set of major power plants, and the number of desulfurization technologies. Solving the relaxation of the integer problem, using the classical continuous-type gradient optimization algorithm, assesses the quality of solutions given by the dynamic programming method.
Licencja Creative Commons Uznanie autorstwa 4.0
Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -
Instytut Badań Systemowych Polskiej Akademii Nauk
Biblioteka Instytutu Badań Systemowych PAN
Oct 15, 2021
Jul 19, 2021
42
https://rcin.org.pl/publication/234640
Holnicki, Piotr Kałuszko, Andrzej
Holnicki, Piotr Kałuszko, Andrzej
Holnicki, Piotr Kałuszko, Andrzej
Kałuszko, Andrzej Holnicki, Piotr
Holnicki, Piotr Kałuszko, Andrzej Nahorski, Zbigniew (1945– )