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ę "Pareto optimal solutions" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Optimality conditions in multiobjective programming problems with interval valued objective functions
    Autorzy:
    Ahmad, I.
    Singh, D.
    Dar, B. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/206566.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    interval valued functions
    gH-differentiablity
    Pareto optimal solutions
    pseudoconvexity
    KKT optimality conditions
    Opis:
    We devote this paper to study of multiobjective programming problems with interval valued objective functions. For this, we consider two order relations LU and LS on the set of all closed intervals and propose several concepts of Pareto optimal solutions and generalized convexity. Based on generalized convexity (viz. LU and LS-pseudoconvexity) and generalized differentiability (viz. gHdifferentiablity) of interval valued functions, the KKT optimality conditions for aforesaid problems are obtained. The theoretical development is illustrated by suitable examples.
    Źródło:
    Control and Cybernetics; 2015, 44, 1; 19-45
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Improved Differential Evolution Algorithm to solve multi-objective of optimal power flow problem
    Autorzy:
    Al-Kaabi, Murtadha
    Hasheme, Jaleel Al
    Al-Bahrani, Layth
    Powiązania:
    https://bibliotekanauki.pl/articles/2135728.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Multi-objective Improved Differential Evolution Algorithm
    MOIDEA
    optimal power flow
    OPF
    set of Pareto front solutions
    multi-objective function problems
    fuel costs considering emissions
    fuel costs considering real power losses
    fuel costs considering voltage deviation
    Opis:
    This article presents a new efficient optimization technique namely the Multi- Objective Improved Differential Evolution Algorithm (MOIDEA) to solve the multiobjective optimal power flow problem in power systems. The main features of the Differential Evolution (DE) algorithm are simple, easy, and efficient, but sometimes, it is prone to stagnation in the local optima. This paper has proposed many improvements, in the exploration and exploitation processes, to enhance the performance of DE for solving optimal power flow (OPF) problems. The main contributions of the DE algorithm are i) the crossover rate will be changing randomly and continuously for each iteration, ii) all probabilities that have been ignored in the crossover process have been taken, and iii) in selection operation, the mathematical calculations of the mutation process have been taken. Four conflicting objective functions simultaneously have been applied to select the Pareto optimal front for the multi-objective OPF. Fuzzy set theory has been used to extract the best compromise solution. These objective functions that have been considered for setting control variables of the power system are total fuel cost (TFC), total emission (TE), real power losses (RPL), and voltage profile (VP) improvement. The IEEE 30-bus standard system has been used to validate the effectiveness and superiority of the approach proposed based on MATLAB software. Finally, to demonstrate the effectiveness and capability of the MOIDEA, the results obtained by this method will be compared with other recent methods.
    Źródło:
    Archives of Electrical Engineering; 2022, 71, 3; 641--657
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On localizing global Pareto solutions in a given convex set
    Autorzy:
    Drwalewska, Agnieszka
    Gajek, Lesław
    Powiązania:
    https://bibliotekanauki.pl/articles/1338686.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    sufficient and necessary conditions for optimality
    Pareto optimal solutions
    dual cones
    feasible directions
    Opis:
    Sufficient conditions are given for the global Pareto solution of the multicriterial optimization problem to be in a given convex subset of the domain. In the case of maximizing real valued-functions, the conditions are sufficient and necessary without any convexity type assumptions imposed on the function. In the case of linearly scalarized vector-valued functions the conditions are sufficient and necessary provided that both the function is concave and the scalarization is increasing with respect to the cone generating the preference relation.
    Źródło:
    Applicationes Mathematicae; 1999, 26, 4; 383-394
    1233-7234
    Pojawia się w:
    Applicationes Mathematicae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    How Quantum Prisoner’s Dilemma Can Support Negotiations
    Autorzy:
    Szopa, Marek
    Powiązania:
    https://bibliotekanauki.pl/articles/430038.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet w Białymstoku. Wydawnictwo Uniwersytetu w Białymstoku
    Tematy:
    game theory
    quantum game
    prisoner’s dilemma
    Nash equilibrium
    Pareto optimal solutions
    Opis:
    Decision-making by the two negotiating parties is simulated by a prisoner’s dilemma game. The game is formulated in a quantum manner, where players strategies are unitary transformations of qubits built over the basis of opposite decision options. Quantum strategies are correlated through the mechanism of quantum entanglement and the result of the game is obtained by the collapse of the resulting transformed state. The range of strategies allowed for quantum players is richer than in case of a classical game and therefore the result of the game can be better optimized. On the other hand, the quantum game is save against eavesdropping and the players can be assured that this type of quantum arbitration is fair. We show that quantum prisoner’s dilemma has more favorable Nash equilibria than its classical analog and they are close to the Pareto optimal solutions. Some economical examples of utilizing quantum game Nash equilibria are proposed.
    Źródło:
    Optimum. Economic Studies; 2014, 5(71)
    1506-7637
    Pojawia się w:
    Optimum. Economic Studies
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      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