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ę "optimality criteria" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Ensuring the economic efficiency of enterprises by multi-criteria selection of the optimal manufacturing process
    Autorzy:
    Kotliar, Alexey
    Basova, Yevheniia
    Ivanov, Vitalii
    Murzabulatova, Olena
    Vasyltsova, Svitlana
    Litvynenko, Mariia
    Zinchenko, Olena
    Powiązania:
    https://bibliotekanauki.pl/articles/406764.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    prismatic part
    multiproduct manufacturing
    machining
    optimality criteria
    optimization
    shaping intensification
    profit intensity
    Opis:
    Technological assurance and improvement of the economic efficiency of production are the first-priority issues for the modern manufacturing engineering area. It is possible to achieve a higher value of economic efficiency in multiproduct manufacturing by multicriteria optimization. A set of optimality criteria based on technological and economic indicators was defined with the aim of selecting the optimal manufacturing process. Competitive variants and a system of optimization were developed and investigated. A comparative analysis of the optimality criteria and their influence on the choice of optimal machining processes was carried out. It was determined that the batch of parts made an impact on the selection of the manufacturing process.
    Źródło:
    Management and Production Engineering Review; 2020, 11, 1; 52-61
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fixed-point iteration based algorithm for a class of nonlinear programming problems
    Autorzy:
    Belegundu, A. D.
    Powiązania:
    https://bibliotekanauki.pl/articles/122443.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    fixed-point iteration
    resource allocation
    nonlinear programming
    optimality criteria
    iteracja punku stałego
    alokacja zasobów
    programowanie nieliniowe
    kryteria optymalizacji dwukierunkowych torów wodnych
    algorytm punktu stałego
    Opis:
    A fixed-point algorithm is presented for a class of singly constrained nonlinear programming (NLP) problems with bounds. Setting the gradient of the Lagrangian equal to zero yields a set of optimality conditions. However, a direct solution on general problems may yield non-KKT points. Under the assumption that the gradient of the objective function is negative while the gradient of the constraint function is positive, and that the variables are positive, it is shown that the fixed-point iterations can converge to a KKT point. An active set strategy is used to handle lower and upper bounds. While fixed-point iteration algorithms can be found in the structural optimization literature, these are presented without clearly stating assumptions under which convergence may be achieved. They are also problem specific as opposed to working with general functions f, g. Here, the algorithm targets general functions which satisfy the stated assumptions. Further, within this general context, the fixed-point variable update formula is given physical significance. Unlike NLP descent methods, no line search is involved to determine step size which involves many function calls or simulations. Thus, the resulting algorithm is vastly superior for the subclass of problems considered. Moreover, the number of function evaluations remains independent of the number of variables allowing the efficient solution of problems with a large number of variables. Applications and numerical examples are presented.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 2; 29-41
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Post-optimal analysis for multicriteria integer linear programming problem with parametric optimality
    Autorzy:
    Emelichev, Vladimir
    Nikulin, Yury
    Powiązania:
    https://bibliotekanauki.pl/articles/2049980.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    post-optimal analysis
    multiple criteria
    quasistability radius
    integer linear programming
    parametric optimality
    Opis:
    This paper addresses a multicriteria problem of integer linear programming with parametric optimality. Parameterizations is introduced by dividing a set of objectives into a family of disjoint subsets, within each Pareto optimality is used to establish dominance between alternatives. The introduction of this principle allows us to connect such classical optimality sets as Pareto and extreme. The parameter space of admissible perturbations in such problem is formed by a set of additive matrices, with arbitrary Hölder’s norms specified in the solution and criterion spaces. The attainable lower and upper bounds for the radii of quasistability are obtained.
    Źródło:
    Control and Cybernetics; 2020, 49, 2; 163-178
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Stability kernel in finite games with perturbed payoffs
    Autorzy:
    Emelichev, Vladimir
    Nikulin, Yury
    Powiązania:
    https://bibliotekanauki.pl/articles/2183484.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    post-optimal analysis
    multiple criteria
    kernel stability radius
    independent perturbations
    finite games
    Pareto optimality
    Nash equilibrium
    Opis:
    The parametric concept of equilibrium in a finite cooperative game of several players in a normal form is introduced. This concept is defined by the partitioning of a set of players into coalitions. Two extreme cases of such partitioning correspond to Pareto optimal and Nash equilibrium outcomes, respectively. The game is characterized by its matrix, in which each element is a subject for independent perturbations., i.e. a set of perturbing matrices is formed by a set of additive matrices, with two arbitrary Hölder norms specified independently in the outcome and criterion spaces. We undertake post-optimal analysis for the so-called stability kernel. The analytical expression for supreme levels of such perturbations is found. Numerical examples illustrate some of the pertinent cases.
    Źródło:
    Control and Cybernetics; 2022, 51, 1; 6--20
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fuzzy Pareto Dominance in Multiple Criteria Project Scheduling Problem
    Autorzy:
    Krzeszowska-Zakrzewska, Bogumiła
    Powiązania:
    https://bibliotekanauki.pl/articles/578536.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Ekonomiczny w Katowicach
    Tematy:
    Algorytmy
    Harmonogram
    Optimum Pareto
    Optymalizacja wielokryterialna
    Planowanie projektu
    Zarządzanie projektem
    Algorithms
    Multiple criteria optimization
    Pareto optimality
    Project management
    Project planning
    Schedule
    Opis:
    Planning is one of the most important aspects of project management. A project plan defines objectives, activities and timeframe for project realization. To be able to define the required timeframe for project realization it is important to prepare its schedule. The purpose of this paper is to present the project scheduling problem as a multiple criteria decision making problem and to solve it using two evolutionary algorithms: SPEA2 and an evolutionary algorithm driven by the fuzzification of Pareto dominance. A comparison of these two approaches is conducted to investigate if it is reasonable to use the fuzzification of the Pareto dominance relation in evolutionary algorithms for the multiple criteria project scheduling problem
    Źródło:
    Multiple Criteria Decision Making; 2015, 10; 93-104
    2084-1531
    Pojawia się w:
    Multiple Criteria Decision Making
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      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