Decision-making management a tutorial and applications
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
London
Academic Press, an imprint of Elsevier
[2017]
|
Ausgabe: | First edition |
Schlagworte: | |
Online-Zugang: | EBSCOhost ScienceDirect Connect to MyiLibrary resource Click here to view book http://ezaccess.libraries.psu.edu/login?url=http://www.sciencedirect.com/science/book/9780128115404 |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Inhaltsangabe:
- Chapter 1: Introduction; 1.1. Background; 1.2. Introduction to the Decision Making; 1.3. Overview of Approaches for Decision Making; 1.4. Management Planning and Control; 1.5. Logical Decision Trees; 1.6. Types of Logical Decision Trees; 1.7. Terminology of Complex Logical Decision Trees; Chapter 2: Logical Decision Tree Analysis; 2.1. Introduction; 2.2. Stages of the Analysis; 2.2.1. System Definition
- 2.2.2. Construction of Logical Decision Trees; 2.2.3. Qualitative Evaluation; 2.2.4. Quantitative Evaluation; 2.3. Importance Analysis; 2.3.1. Fussell-Vesely; 2.3.2. Birnbaum; 2.3.3. Criticality; 2.3.4. Structural Importance; 2.3.5. AND Method; 2.3.6. Other Importance Measures; 2.4. Sensitivity Analysis and Uncertainty Analysis; 2.5. Common Cause Occurrences; 2.6. Limitations of Conventional Methods for Tree Analysis; Chapter 3: Binary Decision Diagrams; 3.1. Introduction; 3.1.1. Definition; 3.1.2. Shannon's Theorem and ITE Sentences; 3.2. BDDs Rules and Operations; 3.2.1. Operation Rules
- 3.2.2. Reduction Rules3.2.3. Gate Transformation Rules; 3.2.4. Reduction Rules; 3.2.5. Expansion Rules; 3.2.6. Absorption Rules; 3.2.7. Relations to Change the Order; 3.3. Variable Ranking; 3.3.1. Importance of the Variable Ordering; 3.3.2. Ranking Methods; 3.3.3. A Novel Ranking Method; 3.3.4. Case Study; 3.4. Evaluation of Binary Decision Diagrams; 3.4.1. Cut Sets and Critical Paths; 3.4.2. Probability of the Top Event; 3.4.3. Sensitivity Analysis and Importance Measures; 3.5. Advantages of the Binary Decision Diagrams; Chapter 4: Case Studies; 4.1. LDT Without MOEs
- 4.2. LDT With a MOE at the Same Level; 4.3. LDT With MOEs at Different Levels; 4.4. LDT Alternating AND and OR Gates at Different Levels; 4.5. LDT With Several MOEs at Different Levels; 4.6. New Approach to Reduce Computational Cost; Chapter 5: Dynamic Analysis of LDT; 5.1. Introduction; 5.2. Case Study 1; 5.2.1. Probability Functions; 5.2.1.1. Constant Probability; 5.2.1.2. Exponential Increasing Probability; 5.2.1.3. Linear Decreasing Probability; 5.2.1.4. Periodic Probability; 5.2.2. Importance Measure Analysis; 5.3. Case Study 2; 5.3.1. Probability Set; 5.3.2. Dynamic Analysis Example
- 5.3.3. Dynamic Importance Measure; Chapter 6: DM Optimization; 6.1. Introduction; 6.2. DM Approach; 6.3. Mathematical NLPP Background; 6.4. Approach to the Optimization Problem; 6.5. Example; 6.6. Dynamic Analysis and Optimization; 6.7. Example; 6.8. Real Case Study; Annex A: Boolean Algebra; Annex B: Symbology of the Logical Decision Tree; Annex C: Probability Theory; Annex D: Importance Analysis: Practical Cases