Professional Documents
Culture Documents
Introduction To Management Science: Modelling, Optimisation and Probability
Introduction To Management Science: Modelling, Optimisation and Probability
Introduction To Management Science: Modelling, Optimisation and Probability
net/publication/329877634
CITATIONS READS
2 3,896
1 author:
Wolfgang Garn
University of Surrey
28 PUBLICATIONS 122 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Wolfgang Garn on 23 December 2018.
I Modelling
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1 Aim and Objectives 3
1.2 Grand Example 4
1.3 Disciplines 7
1.4 Structure 8
2 Modelling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.1 Introduction 9
2.2 The Analysis Process 10
2.3 Break-Even Analysis 13
2.4 Techniques and Applications 15
2.5 Computer Lab – Modelling 18
2.6 Problems 27
2.7 Summary 27
2.8 Annotated Bibliography 28
II Optimisations
3 Mathematical Programming . . . . . . . . . . . . . . . . 31
3.1 Introduction 31
3.2 Problem Formulation 32
3.3 Mathematical Model 33
3.4 Feasible and Infeasible Regions 35
3.5 Optimal Solution 36
3.6 Applications 38
3.7 Computer Lab – Optimisations 43
3.8 Problems 48
3.9 Summary 50
3.10 Annotated Bibliography 50
4 Transportation Models . . . . . . . . . . . . . . . . . . . . . . 53
4.1 Introduction 53
4.2 Transportation Model 54
4.2.1 Data Collection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
4.2.2 Network Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
4.2.3 Linear Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
4.2.4 Feasible and Optimal Solution . . . . . . . . . . . . . . . . . . . . 59
4.3 Transshipment Model 60
4.4 Assignment Model 66
4.5 Applications and Examples 72
4.6 Computer Lab – Transportation 72
4.7 Problems 76
4.8 Summary 80
4.9 Annotated Bibliography 81
5 Network Flows . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
5.1 Introduction 83
5.2 Graph Theory 84
5.3 Minimum Spanning Tree 86
5.3.1 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
5.3.2 Kruskal’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 90
5.3.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
5.4 Shortest Path 94
5.4.1 Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
5.4.2 Dijkstra’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
5.4.3 0-1 Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
5.4.4 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104
5.5 Maximum Flow 106
5.5.1 Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
5.5.2 Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
5.5.3 Integer Program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
5.5.4 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112
5.6 Computer Lab – SP & MF 113
5.7 Problems 120
5.8 Summary 125
5.9 Annotated Bibliography 126
IV Final Part
Solutions to Problems . . . . . . . . . . . . . . . . . . . . . . 233
Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 273