References for Further Reading Bazaraa M et al (1990) Linear programming and network flows, 2nd edn. Wiley, New Chelst KR, Edwards TG (2004) Does this line ever move? Everyday applications of operations research. Key Curriculum Press, Berlin Chvatal V (1983) Linear programming. W.H. Freeman Publications, New Dantzig GB, Thapa MN (1997) Linear programming I: Introduction. Springer, New DiSanza JR, Legge NJ (2012) Business and professional communication: plans, processes, and performance. Pearson, London Dixit AK (1999) Games of strategy. W. W. Norton & Company, New Dixit AK, Nalebuff BJ (1991) Thinking strategically: the competitive edge in business, politics, and everyday life. W. W. Norton & Company, New Eiselt HA, Sandblom C-L (2010) Operations Research: a model-based approach. Springer, New Evans JR, Minieka E (1992) Optimization algorithms for networks and graphs, 2nd edn. Marcel Dekker, New Ficken FA (1961) The simplex method of linear programming. Holt, Rinehart and Winston, New Fourer R, Gay DM, Kernighan BW (2002) AMPL: a modeling language for mathematical programming (chapter 3). Duxbury Press/Brooks/Cole Publishing Company, North Scituate Gass SI (2003) Linear programming: methods and applications. Courier Dover Publications, New Gen M, Cheng R, Lin L (2008) Network models and optimization: multiobjective genetic algorithm approach. Springer, New Gintis H (2009) Game theory evolving: a problem-centered introduction to modeling strategic interaction. Princeton University Press, Princeton Gross D, Shortle JF, Thompson JM, Harris CM (2008) Fundamentals of queueing theory, 4th edn. Wiley, New Haghighi AM, Mishev DP (2008) Queuing models in industry and business. Nova Publishers, New Koneru A (2008) Professional communication. Tata McGraw-Hill Education, New Delhi Kuhn HW (2010) The Hungarian method for the assignment problem, 50 years of integer programming 1958 2008. Springer, New Maros I (2003) Computational techniques of the simplex method. Springer, New Murty K (1992) Network programming. Prentice Hall, Upper Saddle River Sinha SM (2006) Mathematical programming (chapter 20). Elsevier Science, Amsterdam Tulsian PC, Pandey V (2006) Quantitative techniques: theory and problems. Pearson Education India, New Delhi Vanderbei RJ (1997) Linear programming: foundations and extensions. Springer Publications, New R. Srinivasan, Strategic Business Decisions, DOI: 10.1007/978-81-322-1901-9, Ó Springer India 2014 305
306 References for Further Reading von Neumann J, Morgenstern O (2007) Theory of games and economic behavior. Princeton University Press, Princeton Wagner HM (1975) Principles of operations research: with applications to managerial decisions. Prentice Hall, Englewood Cliffs Whalen DJ, Ricca TM (2006) The professional communications toolkit. Sage Publications, New
Index A Adaptive mode, 246 Airline crew problem, 127 Alternate optimal/multiple optimal solution, 66 Application of duality, 51 Assignment problem, 79, 80, 107, 108, 113, 119, 130, 134, 137, 139 B Base technologies, 250 Big M method, 23, 25, 39, 48 C Column minima method, 83, 86 Comparative statements, 293 Comparative statements of a profession, 293 Computational procedure of simplex method, 25 Contract types, 272 Cooperation strategies, 272, 275 Crashing, 139, 150 155, 159 Critical path method, 139, 142, 143, 159, 285 D Degeneracy, 24, 42, 69 71, 84, 94-96, 98, 101, 102 Degeneracy in transportation problems, 94 Determination of net values (U, V method), 89 Differences between PERT and CPM, 142 Dominance principle, 171, 172, 174, 175, 193 Duality, 23, 49 Dual simplex method, 53, 54, 57 E Elements of crashing, 151 Elements of queuing model, 195 Empirical queuing models, 206 Entrepreneurial mode, 246 Engineering as a profession, 229 Engineering management, 229, 233, 234, 238, 241 Entrepreneurship and intrapreneurship, 255 Evolution of OR, 3 Excess of availability, 101 Exponential smoothing, 251 F Flow in networks, 156 Forecasting, 250, 252, 255, 260 Foundations of technology management, 250, 254 Functional organizational structure, 287 Functions of managers, 232 G Game theory, 163, 184-186, 189, 192, 237 Games with pure strategies, 183 Generalized Poisson queuing model, 203 Generalized transportation problem, 107 Graphical evaluations and review technique (GERT), 287 Graphical representation of degeneracy, 72 Graphical representation of infeasible solution, 61 Graphical representation of unbounded solution space with finite solution, 66 Graphical solution for a minimization problem, 19 R. Srinivasan, Strategic Business Decisions, DOI: 10.1007/978-81-322-1901-9, Ó Springer India 2014 307
308 Index Graphical solution for m 9 2 games, 180 Graphical solution to a LP model, 17 Multiple regression model, 253 Multiple server models, 217 H Hungarian method, 108, 134 I Implementation, 5 7, 143, 250, 259, 260, 264, 277 Infeasible solution, 14, 60, 61, 73 Internal communication, 283, 293-295, 298, 304 Introduction of a constant, 47 Introduction to engineering management, 229 K Key technologies, 250 L Limitations of game theory, 163, 183 Logical incrementalisation, 247 M Management, 3, 4, 135, 142, 143, 229-235, 237, 238, 241, 242, 244, 246, 249, 250, 254-256, 258, 259, 261-264, 279-285, 289, 291, 292, 295, 298-300, 304 Management by objectives (MBO), 247, 248, 256 Management levels, 230, 238 Management thoughts, 229, 234, 238 Managerial roles, 231 Managing technological change, 255 Managing projects, 280 Mathematical formulation, 79 Matrix minima method (Least cost cell method), 86 Matrix structure, 288 Maximization in transportation problems, 99 Methods to solve transportation problems, 94 Minimal spanning tree algorithm, 139 Mintzberg s model, 246 Mixed strategy games, 164, 178, 180 Model construction, 6 Models, 4 6, 9, 163, 195, 196, 236, 241, 247, 252, 255, 261 Model solution, 6, 7 Model validation, 6 Moving towards optimality, 88 N Network models, 5, 139 North West corner rule, 84, 131 O Objectives and goals, 242, 243 OR defined, 4 Origin and growth of engineering management, 233 P PERT and CPM, 142, 143, 286, 287 Phases in PERT/CPM, 142 Phases of OR study, 6, 7 Planning mode, 247, 249 Preparation of reports, 293 Problem definition, 6 Professional communication, 293 Program strategies, 243, 245 Project characteristics, 280, 291 Project driven organization, 279 Project evaluation and review technique (PERT), 142, 159 Project planning tools, 279, 285, 291 Project performance, 291 Projectized organization, 289, 291 Pure birth model, 196, 200 Pure death model, 200, 201 Purpose and mission, 242, 256 Q Qualitative methods, 250 Quantitative methods, 251, 255 Queuing and simulation models, 6 Queuing systems, 195 R Regression models, 252 Representation using network diagram, 140 Research & Development mix, 250 strategy, 267, 268, 271 275, 277 Resolving degeneracy at the initial stage, 94 Restrictions in assignment, 117 Row Minima method, 83, 85, 86, 130 Rules for drawing a network diagram, 140
Index 309 S Scope and effectiveness of communication, 293 Sensitivity in assignments problems, 119 Shortage of availability, 101, 103 Simple moving average, 251 Simple regression models, 252 Simplex method, 3, 23, 25, 32, 34, 35, 42, 44, 48, 52, 60 Simulation, 6, 7, 287 Single server models, 207 Solving the OR model, 3, 5 Solving the transportation problem, 82, 83 Some people/task matrix approaches, 237 Spacing technologies, 250 Span of control, 279, 280 Special cases of LP, 60 Stimulus of strategy, 245 Strategic decision making, 241, 246, 247 Strategic IT investment, 257, 259, 264 Strategic management process, 241, 249, 255, 281, 282 Strategic planning, 241, 250, 255, 260 Strategies for managing technology, 254, 255 SWOT, 276 T Technological forecasting, 241, 253, 254, 256 Tech strategy, 276 Tests of a winning strategy, 261 Transhipment problem, 104 Transportation model, 79 Traveling salesman problem, 120 Two-variable LP model, 9 Types of assignment problems, 108 Types of transportation problems, 80 U Unbalanced assignment problem, 125 Unbalanced transportation problem, 80, 101, 102, 108 Unbounded solution space with finite solution, 64 Unbounded solution, 62 64, 66, 73 Unrestricted variables, 43 V Variations in assignment problem, 113 Vogels approximation method (VAM), 88, 93, 98, 100, 102, 106, 130, 131 W Weighted moving average, 251