Resource Management Techniques

Lecture Notes, Study Materials and Important questions answers

Subject : Resource Management Techniques

LINEAR PROGRAMMING
1. What Is Operations Research? - Answer (click here)
2. Operations Research Models - Answer (click here)
3. Solving The OR Model - Answer (click here)
4. Queuing and Simulation Models - Answer (click here)
5. Art of Modeling - Answer (click here)
6. More than Just Mathematics - Answer (click here)
7. Phases of an OR Study - Answer (click here)
8. Modeling with Linear Programming - Answer (click here)
9. Two-Variable LP Model - Answer (click here)
10. Graphical LP Solution: Solution of a Maximization Model - Answer (click
here)
11. Graphical LP Solution: Solution of a Minimization Model - Answer (click
here)
12. Selected LP Applications: Urban planning - Answer (click here)
13. Selected LP Applications: Currency Arbitrage - Answer (click here)
14. Selected LP Applications: Investment - Answer (click here)
15. Selected LP Applications: Production Planning and Inventory Control -
Answer (click here)
16. Selected LP Applications: Blending and Refining - Answer (click here)
17. Selected LP Applications: Manpower Planning - Answer (click here)
18. Selected LP Applications: Additional Applications - Answer (click here)
19. Computer Solution With Solver and AMPL - Answer (click here)
20. The Simplex Method and Sensitivity Analysis - Answer (click here)
21. LP Model in Equation Form - Answer (click here)
22. Transition from Graphical to Algebraic Solution - Answer (click here)
23. The Simplex Method - Answer (click here)
24. Artificial Starting Solution: M-Method and Two-Phase Method - Answer
(click here)
25. Special Cases in the Simplex Method - Answer (click here)
26. Graphical Sensitivity Analysis - Answer (click here)
27. Algebraic Sensitivity Analysis-Changes in the Right-Hand Side - Answer
(click here)
28. Algebraic Sensitivity Analysis-objective Function - Answer (click here)
29. Sensitivity Analysis with TORA, Solver, and AMPL - Answer (click here)

DUALITY AND NETWORKS

1. Duality and Post-Optimal Analysis - Answer (click here)
2. Definition of the Dual Problem - Answer (click here)
3. Primal-Dual Relationships - Answer (click here)
4. Economic Interpretation of Duality - Answer (click here)
5. Additional Simplex Algorithms: Dual Simplex Method and Generalized
Simplex Algorithm - Answer (click here)
6. Post-Optimal Analysis - Answer (click here)
7. Transportation Model and its Variants - Answer (click here)
8. Definition of the Transportation Model - Answer (click here)
9. Nontraditional Transportation Models - Answer (click here)
10. The Transportation Algorithm - Answer (click here)
11. The Assignment Model and The Hungarian Method - Answer (click here)
12. Transshipment Model - Answer (click here)
13. Network Models - Answer (click here)
14. Scope and Definition of Network Models - Answer (click here)
15. Minimal Spanning Tree Algorithm - Answer (click here)
16. Examples of the Shortest-Route Applications or Problem - Answer (click
here)
17. Shortest-Route Algorithms - Answer (click here)
18. Linear Programming Formulation of the Shortest-Route Problem -
Answer (click here)
19. Maximal flow model - Answer (click here)
20. CPM (Critical Path Method) and PERT (Program Evaluation and
Review Technique) - Answer (click here)
21. CPM AND PERT: Network Representation - Answer (click here)
22. CPM AND PERT: Critical Path (CPM) Computations - Answer (click here)
23. CPM AND PERT: Construction of the Time Schedule - Answer (click here)
24. CPM AND PERT: linear Programming Formulation of CPM - Answer
(click here)
25. CPM AND PERT: PERT Networks - Answer (click here)

INTEGER PROGRAMMING
1. Integer Linear Programming - Answer (click here)
 2. Capital Budgeting- Integer Linear Programming Illustrative Applications
- Answer (click here)
3. Set Covering Problem- Integer Linear Programming Illustrative
Applications - Answer (click here)
4. Fixed Charge Problem- Integer Linear Programming Illustrative
Applications - Answer (click here)
5. Either Or and If Then Constraints- Integer Linear Programming
Illustrative Applications - Answer (click here)
6. Integer Programming Algorithms - Answer (click here)
7. Branch-and-Bound (B&B) Algorithm - Answer (click here)
8. Cutting-Plane Algorithm - Answer (click here)
9. Computational Considerations in ILP - Answer (click here)
10. Traveling Salesperson Problem (TSP) - Answer (click here)
11. Heuristic Algorithms: nearest neighbor and subtour reversal algorithms -
Traveling Salesperson Problem (TSP) - Answer (click here)
12. B&B Solution Algorithm - Traveling Salesperson Problem (TSP) -
Answer (click here)
13. Cutting Plane Algorithm - Traveling Salesperson Problem (TSP) -
Answer (click here)
14. Deterministic Dynamic Programming - Answer (click here)
15. Recursive Nature of Computations in DP(Dynamic Programming) -
Answer (click here)
16. Forward and Backward Recursion- Dynamic Programming - Answer (click
here)
17. Selected Dynamic Programming(DP) Applications - Answer (click here)
18. Knapsack/Fly-Away/Cargo Loading Model- Dynamic
Programming(DP) Applications - Answer (click here)
19. Work Force Size Model- Dynamic Programming(DP) Applications -
Answer (click here)
20. Equipment Replacement Model- Dynamic Programming(DP)
Applications - Answer (click here)
21. Investment Model- Dynamic Programming(DP) Applications - Answer
(click here)
22. Problem of Dimensionality- Dynamic Programming - Answer (click here)

CLASSICAL OPTIMISATION THEORY

1. Classical Optimization Theory - Answer (click here)
2. Unconstrained Problems -Classical Optimization Theory - Answer (click
here)
3. Necessary and Sufficient Conditions -Unconstrained Problems - Answer
(click here)
 4. Newton Raphson Method -Unconstrained Problems - Answer (click here)
5. Constrained Problems: Equality Constraints - Answer (click here)
6. Inequality Constraints-Karush-Kuhn-Tucker (KKT) Conditions - Answer
(click here)

OBJECT SCHEDULING
Operations Research An Introduction by Hamdy A Taha
Chapter 1 What Is Operations Research
1. What Is Operations Research? - Answer (click here)
2. Operations Research Models - Answer (click here)
3. Solving The OR Model - Answer (click here)
4. Queuing and Simulation Models - Answer (click here)
5. Art of Modeling - Answer (click here)
6. More than Just Mathematics - Answer (click here)
7. Phases of an OR Study - Answer (click here)

Chapter 2 Modeling with Linear Programming

1. Modeling with Linear Programming - Answer (click here)
2. Two-Variable LP Model - Answer (click here)
3. Graphical LP Solution: Solution of a Maximization Model - Answer (click
here)
4. Graphical LP Solution: Solution of a Minimization Model - Answer (click
here)
5. Selected LP Applications: Urban planning - Answer (click here)
6. Selected LP Applications: Currency Arbitrage - Answer (click here)
7. Selected LP Applications: Investment - Answer (click here)
8. Selected LP Applications: Production Planning and Inventory Control -
Answer (click here)
9. Selected LP Applications: Blending and Refining - Answer (click here)
10. Selected LP Applications: Manpower Planning - Answer (click here)
11. Selected LP Applications: Additional Applications - Answer (click here)
12. Computer Solution With Solver and AMPL - Answer (click here)

Chapter 3 The Simplex Method and Sensitivity Analysis

1. The Simplex Method and Sensitivity Analysis - Answer (click here)
2. LP Model in Equation Form - Answer (click here)
3. Transition from Graphical to Algebraic Solution - Answer (click here)
 4. The Simplex Method - Answer (click here)
5. Artificial Starting Solution: M-Method and Two-Phase Method - Answer
(click here)
6. Special Cases in the Simplex Method - Answer (click here)
7. Graphical Sensitivity Analysis - Answer (click here)
8. Algebraic Sensitivity Analysis-Changes in the Right-Hand Side - Answer
(click here)
9. Algebraic Sensitivity Analysis-objective Function - Answer (click here)
10. Sensitivity Analysis with TORA, Solver, and AMPL - Answer (click here)

Chapter 4 Duality and Post Optimal Analysis

1. Duality and Post-Optimal Analysis - Answer (click here)
2. Definition of the Dual Problem - Answer (click here)
3. Primal-Dual Relationships - Answer (click here)
4. Economic Interpretation of Duality - Answer (click here)
5. Additional Simplex Algorithms: Dual Simplex Method and Generalized
Simplex Algorithm - Answer (click here)
6. Post-Optimal Analysis - Answer (click here)

Chapter 5 Transportation Model and Its Variants

1. Transportation Model and its Variants - Answer (click here)
2. Definition of the Transportation Model - Answer (click here)
3. Nontraditional Transportation Models - Answer (click here)
4. The Transportation Algorithm - Answer (click here)
5. The Assignment Model and The Hungarian Method - Answer (click here)
6. Transshipment Model - Answer (click here)

Chapter 6 Network Models

1. Network Models - Answer (click here)
2. Scope and Definition of Network Models - Answer (click here)
3. Minimal Spanning Tree Algorithm - Answer (click here)
4. Examples of the Shortest-Route Applications or Problem - Answer (click
here)
5. Shortest-Route Algorithms - Answer (click here)
6. Linear Programming Formulation of the Shortest-Route Problem -
Answer (click here)
7. Maximal flow model - Answer (click here)
8. CPM (Critical Path Method) and PERT (Program Evaluation and
Review Technique) - Answer (click here)
 9. CPM AND PERT: Network Representation - Answer (click here)
10. CPM AND PERT: Critical Path (CPM) Computations - Answer (click here)
11. CPM AND PERT: Construction of the Time Schedule - Answer (click here)
12. CPM AND PERT: linear Programming Formulation of CPM - Answer
(click here)
13. CPM AND PERT: PERT Networks - Answer (click here)

Chapter 9 Integer Linear Programming

1. Integer Linear Programming - Answer (click here)
2. Capital Budgeting- Integer Linear Programming Illustrative Applications
- Answer (click here)
3. Set Covering Problem- Integer Linear Programming Illustrative
Applications - Answer (click here)
4. Fixed Charge Problem- Integer Linear Programming Illustrative
Applications - Answer (click here)
5. Either Or and If Then Constraints- Integer Linear Programming
Illustrative Applications - Answer (click here)
6. Integer Programming Algorithms - Answer (click here)
7. Branch-and-Bound (B&B) Algorithm - Answer (click here)
8. Cutting-Plane Algorithm - Answer (click here)
9. Computational Considerations in ILP - Answer (click here)
10. Traveling Salesperson Problem (TSP) - Answer (click here)
11. Heuristic Algorithms: nearest neighbor and subtour reversal algorithms -
Traveling Salesperson Problem (TSP) - Answer (click here)
12. B&B Solution Algorithm - Traveling Salesperson Problem (TSP) -
Answer (click here)
13. Cutting Plane Algorithm - Traveling Salesperson Problem (TSP) -
Answer (click here)

Chapter 10 Deterministic Dynamic Programming

1. Deterministic Dynamic Programming - Answer (click here)
2. Recursive Nature of Computations in DP(Dynamic Programming) -
Answer (click here)
3. Forward and Backward Recursion- Dynamic Programming - Answer (click
here)
4. Selected Dynamic Programming(DP) Applications - Answer (click here)
5. Knapsack/Fly-Away/Cargo Loading Model- Dynamic
Programming(DP) Applications - Answer (click here)
6. Work Force Size Model- Dynamic Programming(DP) Applications -
Answer (click here)
 7. Equipment Replacement Model- Dynamic Programming(DP)
Applications - Answer (click here)
8. Investment Model- Dynamic Programming(DP) Applications - Answer
(click here)
9. Problem of Dimensionality- Dynamic Programming - Answer (click here)

Chapter 18 Classical Optimization Theory

1. Classical Optimization Theory - Answer (click here)
2. Unconstrained Problems -Classical Optimization Theory - Answer (click
here)
3. Necessary and Sufficient Conditions -Unconstrained Problems - Answer
(click here)
4. Newton Raphson Method -Unconstrained Problems - Answer (click here)
5. Constrained Problems: Equality Constraints - Answer (click here)
6. Inequality Constraints-Karush-Kuhn-Tucker (KKT) Conditions - Answer
(click here)