Dynamiczny algorytm optymalizacji hipotetycznej - możliwości zastosowania w eksploatacji obiektów mieszkalnych
MetadataShow full item record
The DAHO (Dynamic Algorithm of Hypothetical Optimization ) is a combinations algorithm based on multistage recurrence and utilizing elements of the dynamic programming theory. It may be used for solving optimization problems with are latively small number of decision-making variables (number of variables exerts its in fluence on time of calculations) but a big number of constraints. Hence, it may be useful especially for solving production-exploitation optimization problems (e. g. in exploitation of dwellings characterized by a big number of constraints). Due to the fact that it does not as sume fundamental as sumptions for functions of goal (as well as constraining conditions) it is quite a universal algorithm allowing to solve problems of both non-linear and linear programming. The DАНO consists of five procedures: 1) transformation of starting model, 2) determining variables (hypothetical factors), 3) optimal steering (including the determining of conditional and nonconditional optimal steering), 4) retransformation (including the determining of values of decision-making variables and admissibility of values of decision-making variables with boundary conditions and left-sided constraints of the model), 5) checking admissibility of solutions due to remaining constraints and choosing the best solution with regard to the function of goal.