The Analytic Hierarchy Process: Planning, Priority Setting, Resource AllocationRWS Publications, 1990 - 287 páginas Planning, priority setting & resource allocation using the multicriteria decision making approach of the Analytic Hierarchy Process (AHP). Discover how to structure complex multi-person, multi-criteria, multi-time period problems with uncertainty & risk in hierarchic form, set priorities for the elements in each level according to their impact on the criteria or objectives of the next higher level, articulate your judgments through a series of pairwise comparisons, obtain a precise numerical measurement of the priority of each element, & synthesize all the judgments within the hierarchy to reach a best decision. THE ANALYTIC HIERARCHY PROCESS is a simple, yet powerful decision-making tool for planning, structuring priorities, weighing alternatives, allocating resources, analyzing policy impacts & resolving conflicts. This is the classical book on the AHP giving a complete grounding in the theory along with examples & applications. New theoretical results have been included in this revised & extended edition. |
Dentro del libro
Resultados 1-3 de 14
Página 265
... vertices or nodes and a set of simple curves E called edges with a rule ( of incidence ) which associates each edge with vertices which are called its end points . The vertices are said to be incident with the edge . An open edge is ...
... vertices or nodes and a set of simple curves E called edges with a rule ( of incidence ) which associates each edge with vertices which are called its end points . The vertices are said to be incident with the edge . An open edge is ...
Página 267
... vertices . A graph of n + 1 vertices is n - tuply connected if the removal of n- 1 or less vertices does not dis- connect it . Two chains are said to be disjoint if they have no vertices in common , except perhaps for their end points ...
... vertices . A graph of n + 1 vertices is n - tuply connected if the removal of n- 1 or less vertices does not dis- connect it . Two chains are said to be disjoint if they have no vertices in common , except perhaps for their end points ...
Página 268
... vertices are isomorphic we speak of the complete 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 ...
... vertices are isomorphic we speak of the complete 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 ...
Contenido
PART ONE THE ANALYTIC HIERARCHY PROCESS | 1 |
A formal approach | 4 |
Instructive examples | 37 |
Derechos de autor | |
Otras 11 secciones no mostradas
Otras ediciones - Ver todas
The Analytic Hierarchy Process: Planning, Priority Setting, Resource Allocation Thomas L. Saaty Vista de fragmentos - 1980 |
Términos y frases comunes
a₁ activities allocation alternatives Amax analysis Analytic Hierarchy Process applications approach average C₁ clusters coefficients column compared comparison matrix components composite considered consistency corresponding cost criteria criterion D₁ decision decision problem dependence derived desired directed graph Dirichlet distribution dominance elements entries equal equation estimate example factors forward process geometric mean given gives goal graph hence impact importance inconsistency intensity irreducible judgments left eigenvector linear mathematical method multiple nonnegative normalized objectives obtain outcome overall pairwise comparisons perturbation policies positive preferred primitive matrix priority vector projects PROOF rank reversal ratio scale reciprocal matrix relation relative measurement respect result right eigenvector Saaty satisfy scenario solution stochastic matrix structure subcriteria Sudan supermatrix Table Theorem theory v₁ variables vertex vertices w₁ weights zero