Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "function optimization" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Identification of preferences in decision support systems
    Autorzy:
    Beskorovainyi, V.
    Berezovskyi, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/411106.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    decision support
    multi-criteria optimization
    utility function of partial criteria
    Opis:
    In this work we obtained the solution of increasing of adequacy of models of multicriteria evaluation for the project and management decision support systems. Modifications of the utility functions of partial criteria and the procedure for calculating their values are proposed, which makes it possible to improve the accuracy of approximation of the preferences of the person making the decision, as well as significantly reduce the time for calculating their values. For the parametric synthesis of universal multicriteria estimation models based on the Kolmogorov-Gabor polynomial, an improvement in the method of comparator identification by calculating the Chebyshev point and the discrepancy vector is proposed.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2017, 6, 4; 15-20
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of linear functions on a cyclic permutation. Based on the random search
    Autorzy:
    Grebennik, I.
    Baranov, O.
    Chorna, A.
    Gorbacheva, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/411110.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    combinatorial optimization
    linear function
    cyclic permutations
    random search
    branch and bound algorithm
    parallel computing
    Opis:
    For creating adequate mathematical models of combinatorial problems of constructing optimal cyclic routes, mathematical modeling and solving a number of planning and control tasks solutions of optimization problems on the set of cyclic permutations are required. Review of the publications on combinatorial optimization demonstrates that the optimization problem on the cyclic permutations have not been studied sufficiently. This paper is devoted to solving optimization problem of a linear function with linear constraints on the set of cyclic permutations. For solving problems of this class using of known methods, taking into account the properties of a combinatorial set of cyclic permutations, is proposed. For this purpose we propose a method based on the ideology of random search. Heuristic method based on the strategy of the branch and bound algorithm is proposed to solve auxiliary optimization problem of a linear function without constraints on the set of cyclic permutations. Since application of the branch and bound algorithm immediately leads to an exponential growth of the complexity with increasing the dimension of the problem a number of modifications are suggested. Modifications allow reducing computational expenses for solving higher dimension problems. The effectiveness of the proposed improvements is demonstrated by computational experiments.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 3; 211-216
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Determination of Approaches for Project Costs Minimization with Use of Dual Problems
    Autorzy:
    Chernov, S.
    Titov, S.
    Chernova, L.
    Kunanets, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/410624.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    linear optimization
    primal problem
    dual problem
    duality
    objective function
    constraint system
    pairs of dual problems
    Opis:
    For determining ways of company development, ensuring the growth of profit in manufacture and sales of certain products, it has been proposed to use an algorithm of constructing a problem being inverse to primal-dual one, for minimization of the project costs. The primal and the inverse problems contribute to improving the efficiency of calculation when determining approaches for minimization of costs. This pair of problems is mutually conjugate. The proposed rigorous approach to obtaining the algorithm of constructing a dual problem is based on the following statement: a problem being inverse to a dual one is a primal (original) problem. The authors have proposed and rigorously proven the algorithm of a general approach to the construction of conjugate problem pairs. Formalization of the algorithm developed allows obtaining easily correct pairs of known dual problems. This permitted proposing and proving the truth of the algorithm of constructing a dual problem for the arbitrary form of a primal problem representation.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2019, 8, 2; 61-68
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies