The Analytic Hierarchy Process: Planning, Priority Setting, Resource AllocationMcGraw-Hill International Book Company, 1980 - 287 páginas |
Dentro del libro
Resultados 1-3 de 31
Página 85
... graph theory . Definition 4-7 Let the nodes of a directed graph G be denoted by 1 , 2 , ... , n . With every directed arc x ;; from node i to node j , we associate a nonnegative number , 0 < qij < 1 , called the intensity of the arc ...
... graph theory . Definition 4-7 Let the nodes of a directed graph G be denoted by 1 , 2 , ... , n . With every directed arc x ;; from node i to node j , we associate a nonnegative number , 0 < qij < 1 , called the intensity of the arc ...
Página 268
... graph on n vertices . A graph is called bipartite if its vertices can be partitioned into two disjoint sets such that the only edges in the graph are those which connect vertices from one set to those in the other . ( See Fig . A - 6 ...
... graph on n vertices . A graph is called bipartite if its vertices can be partitioned into two disjoint sets such that the only edges in the graph are those which connect vertices from one set to those in the other . ( See Fig . A - 6 ...
Página 269
... graph in the plane without intersections of edges at points that are not vertices ) , and nonplanarity of graphs are related to connectivity . By reducing the number of edges of a nonplanar graph , it can be made planar . There are also ...
... graph in the plane without intersections of edges at points that are not vertices ) , and nonplanarity of graphs are related to connectivity . By reducing the number of edges of a nonplanar graph , it can be made planar . There are also ...
Contenido
PART ONE THE ANALYTIC HIERARCHY PROCESS | 1 |
A formal approach | 4 |
Instructive examples | 37 |
Derechos de autor | |
Otras 12 secciones no mostradas
Otras ediciones - Ver todas
The Analytic Hierarchy Process: Planning, Priority Setting, Resource Allocation Thomas L. Saaty Vista de fragmentos - 1990 |
Términos y frases comunes
a₁ activities allocation alternatives Amax analysis Analytic Hierarchy Process applications approach b₁ binary matrix C₁ clusters coefficients column vector compared complete graph components composite consistency corresponding cost criteria D₁ decision defined denote derived determine diagonal directed graph dominance edges eigenvalue problem elements entries equal equation estimate example factors given gives goal graph hence hierarchy level impact importance influence irreducible judgments least squares left eigenvector linear mathematical measurement method Multidimensional Scaling multiple nonnegative normalized Note objectives obtain outcome overall pairwise comparison pairwise comparison matrix perturbation positive primitive matrix priority vector PROOF rank ratio scale reciprocal matrix relations relative respect result right eigenvector root mean square row sums scenario solution stochastic matrix structure Sudan supermatrix Table Theorem theory unity utility function v₁ variables vertex vertices w₁ weights zero