Informacja

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

Wyszukujesz frazę "pay-off matrix" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Thoughts on the Inconclusive Zone in Comparison Question Test (CQT)
Autorzy:
Ginton, Avital
Powiązania:
https://bibliotekanauki.pl/articles/2179254.pdf
Data publikacji:
2022
Wydawca:
Krakowska Akademia im. Andrzeja Frycza Modrzewskiego
Tematy:
Comparison Question Test
CQT
Inconclusive Zone
Polygraph
True score theory
Pay-off matrix in polygraph decisions
Opis:
The Inconclusive Zone, in one form or another, is an integral part of almost any data analysis method of CQT. It represents the existence of built-in uncertainties in the test and indicates how the test, in general, and the examiners, in particular, bear this limitation in practice. Unfortunately, it is so common that most examiners tend not to spend too much time and attention wondering about its meaning. The following are some reflections on the concept of an Inconclusive Zone, and its actual use, including some resulting recommendations. That includes internal aspects of the test, such as the relation between the extent of using multiple comparison points between relevant and comparison questions and the optimal Inconclusive Zone size. External aspects affecting the Inconclusive Zone’s size and shape are also stressed when looking at the CQT through a prism of aiding decision-making rather than a mere means to sort truth from lies.
Źródło:
European Polygraph; 2022, 16, 2(56); 9-21
1898-5238
2380-0550
Pojawia się w:
European Polygraph
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem
Autorzy:
Arora, R.
Gupta, K.
Powiązania:
https://bibliotekanauki.pl/articles/1403683.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
bilevel programming
indefinite quadratic programming
multi-objective programming
pay-off matrix
Taylor series approximation
LINGO 17.0
Opis:
Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem. In this paper, a multi-objective indefinite quadratic bilevel programming problem (MOIQBP) is presented. The defined problem (MOIQBP) has multi-objective functions at both the levels. The followers are independent at the lower level. A fuzzy goal programming methodology is employed which minimizes the sum of the negative deviational variables of both the levels to obtain highest membership value of each of the fuzzy goal. The membership function for the objective functions at each level is defined. As these membership functions are quadratic they are linearized by Taylor series approximation. The membership function for the decision variables at both levels is also determined. The individual optimal solution of objective functions at each level is used for formulating an integrated pay-off matrix. The aspiration levels for the decision makers are ascertained from this matrix. An algorithm is developed to obtain a compromise optimal solution for (MOIQBP). A numerical example is exhibited to evince the algorithm. The computing software LINGO 17.0 has been used for solving this problem.
Źródło:
Archives of Control Sciences; 2020, 30, 4; 683-699
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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