SELECTION OF A LEADER FOR A COMPANY BY USING PRIORITIZATION METHODS OF ANALYTIC HIERARCHY PROCESS AN ILLUSTRATION
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2015, Vol 10, Issue 7
Abstract
This paper aims at selection of a leader for a company (whose founder is about to retire) with one of the popular decision making techniques. Analytic Hierarchy Process is an approach to decision making that involves structuring multiple criteria into hierarchy. There are several methods to calculate the priority vectors. Three prioritization methods are used to select a leader among three alternatives and four criteria. It is observed that Dick stands first in ranking and Tom stands second and Harry stands third in rankings. Consistency Ratio (C.R) also calculated for all pair-wise comparison matrices and analyzed.
Authors and Affiliations
voruganti shyam prasad, P Kousalya
Keywords
Related Articles
- EP ID EP651457
- DOI 10.24297/jam.v10i7.1767
- Views 147
- Downloads 0
PG-Continuous frames in Banach space
In this paper, we introduce pg-continuous frames and study the operators associated with a give pg-continuous frames. We also show many useful properties with corresponding notions, pg-continuous frames and pg-frames in...
A New Five Parameter Lifetime Distribution: Properties and Application
This paper deals with a new generalization of the Weibull distribution. This distribution is called exponentiated exponentiated exponential-Weibull (EEE-W) distribution. Various structural properties of the new probabili...
Max-fully cancellation modules
Let R be a commutative ring with identity and let M be a unital an R`-module. We introduce the concept of max-fully cancellation R-module , where an R-module M is called max-fully cancellation if for every nonzero maxima...
Symmetry problem 1
A symmetry problem is solved. A new method is used. The idea of this methodis to reduce to a contradiction the PDE and the over-determined boundary data on the boundary.The new method allows one to solve other symmetry p...
SOME RESULTS OF LABELING ON BROOM GRAPH
A Broom Graph Bn,d is a graph of n vertices, which have a path P with d vertices and (n-d) pendant vertices, all of these being adjacent to either the origin u or the terminus v of the path P. Here we consider...