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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Network Dimensioning with Maximum Revenue Efficiency for the Fairness Index
    Autorzy:
    Zalewski, G.
    Ogryczak, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/307749.pdf
    Data publikacji:
    2016
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    allocation problem
    decision problems
    dimensioning networks
    fair-optimization
    linear programming
    maximization
    multi-criteria
    Opis:
    Network dimensioning is a specific kind of the resource allocation problem. One of the tasks in the network optimization is to maximize the total flow on given pairs of nodes (so-called demands or paths between source and target). The task can be more complicated when different revenue/profit gained from each unit of traffic stream allocated on each demand is taken into account. When the total revenue is maximized the problem of starvation of less attractive paths can appear. Therefore, it is important to include some fairness criteria to preserve connections between all the demands on a given degree of quality, also for the least attractive paths. In this paper, a new bicriteria ratio optimization method which takes into account both, the revenue and the fairness is proposed. Mathematical model is built in a form of linear programming. The solutions are analyzed with some statistical measures to evaluate their quality, with respect to fairness and efficiency. In particular, the Gini’s coefficient is used for this purpose.
    Źródło:
    Journal of Telecommunications and Information Technology; 2016, 4; 15-21
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-method and multi-criteria decision analysis of objects in a computerized decision support system
    Autorzy:
    Becker, J.
    Becker, A.
    Budziński, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/406607.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    multi-criteria decision analysis
    ranking
    grouping
    allocation of resources
    computerized decision support system
    DSS
    Opis:
    A multimethod approach to the multicriteria analysis and assessment of objects (rankings, grouping, econometric assessments) have been presented. This issue is a field of research and engineering associated with the construction and application of a computerized decision support system (DSS 2.0). In terms of the proposed approach, the functionality of the developed prototype has been illustrated based on a practical example of the assessment of employees and the analysis of remuneration. The Electre TRI method of grouping derived from a relational model complements ranking methods well (e.g., AHP) based on the functional model. Grouping reveals cases, where all or the vast majority of objects in a ranking were clustered within one class (e.g., in the best or the worst one).
    Źródło:
    Operations Research and Decisions; 2017, 27, 3; 21-33
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of Selected Fair-optimization Methods for Flow Maximization between Given Pairs of Nodes in Telecommunications Network
    Autorzy:
    Zalewski, G.
    Ogryczak, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/308874.pdf
    Data publikacji:
    2016
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    allocation problem
    decision problems
    fair-optimization
    linear programming
    multi-criteria
    networks
    ordered weighted averaging
    OWA
    reference point method
    RPM
    Opis:
    Dimensioning of telecommunications networks requires the allocation of the ows (bandwidth) to given trac demands for the source-destination pairs of nodes. Unit ow allocated to the given demand is associated with revenue that may vary for dierent demands. Problem the decision-making basic algorithms to maximize the total revenue may lead to the solutions that are unacceptable, due to "starvation" or "locking" of some demand paths less attractive with respect to the total revenue. Therefore, the fair optimization approaches must be applied. In this paper, two fair optimization methods are analyzed: the method of ordered weighted average (OWA) and the reference point method (RPM). The study assumes that ows can be bifurcated thus realized in multiple path schemes. To implement optimization model the AMPL was used with general-purpose linear programming solvers. As an example of the data, the Polish backbone network was used.
    Źródło:
    Journal of Telecommunications and Information Technology; 2016, 3; 18-24
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On multi-criteria approaches to bandwidth allocation
    Autorzy:
    Ogryczak, W.
    Wierzbicki, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/970491.pdf
    Data publikacji:
    2004
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optymalizacja wielokryterialna
    efektywność
    alokacja zasobów
    multiple criteria optimization
    efficiency
    fairness
    equity
    reference point method
    resource allocation
    network design
    elastic traffic
    Opis:
    Modern telecommunication networks face an increasing demand for services. Among these, an increasing number are services that can adapt to available bandwidth, and are therefore referred to as elastic traffic. Nominal network design for elastic traffic becomes increasingly significant. Typical resource allocation methods are concerned with the allocation of limited resources among competing activities so as to achieve the best overall performance of the system. In the network dimensioning problem for elastic traffic, one needs to allocate bandwidth to maximize service flows and simultaneously to reach a fair treatment of all the elastic services. Thus, both the overall efficiency (throughput) and the fairness (equity) among various services are important. In such applications, the so-called Max-Min Fairness (MMF) solution concept is widely used to formulate the resource allocation scheme. This approach guarantees fairness but may lead to significant losses in the overall throughput of the network. In this paper we show how the concepts of multiple criteria equitable optimization can be effectively used to generate various fair resource allocation schemes. We introduce a multiple criteria model ecluivalent to equitable optimization and we develop a corresponding reference point procedure to generate fair efficient bandwidth allocations. The procedure is tested on a sample network dimensioning problem and its abilities to model various preferences are demonstrated.
    Źródło:
    Control and Cybernetics; 2004, 33, 3; 427-448
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    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ł
      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