Basic Introduction Title: Management Operations Research Author: Meng, Ding Sibo, Li Fengting ISBN :9787302264255 Pricing: 38 yuan Press: Tsinghua University Press? Publication date: 2011.09.01Management Operations Research is an important professional basic course for economic management majors in colleges and universities. Mastering the idea of overall optimization of operational research and some optimization skills of quantitative analysis, so as to correctly use various models to analyze and solve complex practical problems, is to cultivate and improve students' scientific thinking, scientific methods, practical skills and skills. This book selects a large number of cases, and systematically introduces the most widely used theories and methods in economic management, such as linear programming, dual theory and sensitivity analysis, integer programming, objective programming, transportation problems, graph theory and network analysis, dynamic programming, storage theory, decision analysis, game theory and so on, under the principle of giving consideration to both applications and algorithms. Each chapter is equipped with multimedia courseware, exercises and answers, instructions for the use of computer algorithm software, etc. This book integrates theory with practice and focuses on cultivating students' ability to solve practical problems. It can be used as a teaching material for undergraduates and MBA students majoring in economic management in colleges and universities, and also as a self-study reference book for engineers and technicians and managers of industrial and commercial enterprises. Table of Contents Chapter 1 Introduction 1 Section 1 Origin and Development of Operational Research 1 1. Origin of Operational Research 1 2. Origin of Operational Research. The development of operational research 3 Section 2 Interpretation and branches of operational research 4 i. Interpretation of operational research 4 II. Branches of operations research 6 Section 3 Models and research methods of management operations research 7 Section 4 Application of management operations research 9 Chapter 2 Linear programming 12 Section 1 Presentation of linear programming problems 12 Section 2 Mathematical model of linear programming problems 14 I. Mathematical model of investment problems 14 II. Mathematical model of batching problems. Mathematical model of human resource problems. Mathematical model of reasonable cutting problem 18 V. Mathematical model of transportation problem 20 Graphical solution of two-variable problem in the third quarter 2 1 Standard form of linear programming problem in the fourth quarter 24 Concept and properties of solution of linear programming problem in the fifth quarter 26 Basic principle of simplex method in the sixth quarter 28 i. Ideas of simplex method 28 2. Determine the initial basic feasible solution 3 1 3. Optimality test 32 4. Further discussion on simplex method in section 8 of simplex table 34 of basis transformation 33 39 1. Big m method 39 2. Two-stage method 4 1 WinQSB solution to the ninth section linear programming problem 43 Exercise 46 Chapter III Dual Theory and Sensitivity Analysis 49 Matrix Description of Simplex Method in Section I 49 Dual Problem of Linear Programming in Section II 52 Relationship between Primitive Problem and Dual Problem in Section III 55 I. Symmetric Dual Linear Programming 55 II. The Basic Properties of Asymmetric Dual Linear Programming 56 Section IV Dual Problems 58 I. Symmetry 58 II. Weak duality 59 III. Theorem of the best criterion 59. Duality Theorem 60 Section 5 Economic Significance of Duality Problem 60 Section 6 Dual Simplex Method 64 Section 7 Sensitivity Analysis 66 I. Sensitivity Analysis of Value Coefficient in Objective Function 66 II. Sensitivity analysis of resource coefficient under constraint conditions. Sensitivity analysis of coefficient matrix with constraint 7 1 IV. Sensitivity analysis of adding a new variable 74 V. Sensitivity analysis of adding constraints 75 Section 8 Sensitivity analysis of WinQSB 76 Exercise 8 1 Chapter 4 Integer Programming 85 Section 1 Example of Integer Programming 85 I. Cutting Problem 85 II. Knapsack problem 86 II. Branch and bound method. Section method 92 IV Integer programming 96 I. Complete enumeration 96 II. Implicit enumeration method for planning 97 v. Assignment problem 10 1 1. Standard form and mathematical model of assignment problem 10 1 2. Standard form and mathematical model of assignment problem. WinQSB 102 of Hungarian Law, Section VI Solving Integer Programming 104 Exercise 106 Chapter V Goal Planning 108 Section I Problem Proposition 108, Basic Concepts of Goal Planning 109 2, Mathematical Model of Goal Planning/ 2 Graphical method of objective planning in the second quarter/KOOC-0/65438+NQSB solution/KOOC-0/2/KOOC-0/exercise/KOOC-0/24 Chapter VI Transportation problem/KOOC-0/27 Section I Mathematical model of transportation problem/KOOC-0/27 I. Description of the problem/KOOC-. Mathematical model 127 iii. Model Features 129 Section II Table Operation Method to Determine the Feasible Solution of Initial Basis 130 II. Distinguish the optimal solution 138 III. Improvement of feasible solution based on 14 1 Section III Transportation Problem with Unbalanced Production and Marketing 143 Application of Transportation Problem in Section IV 146 Solution to WinQSB Transportation Problem in Section V 157 Exercise 160 Chapter VII Graph Theory and Network Analysis/kloc Basic concepts in graph theory. The shortest path problem 168 I. Dixto algorithm for solving the shortest path problem 168 II. Application of the Shortest Path Problem 17 1 Section 4 Minimum Spanning Tree Problem 175 I. Cycle-breaking Algorithm and Cycle-avoiding Algorithm for Solving Minimum Spanning Tree Problem 175 II. Application of Minimum Spanning Tree Problem 179 Section 5 Maximum Flow Problem 180 I. Mathematical Model of Maximum Flow 65438+ Network Graph Theory Solution of Maximum Flow Problem18/Section 6 Minimum Cost Maximum Flow Problem 185 I. Mathematics of Minimum Cost Maximum Flow Problem Network Graph Theory Solution of Minimum Cost and Maximum Flow 187 Section VII China Postman Problem 19 1 1. The Seven Bridges in Konigsberg and Euler 19 1 2. The problem of the postman in China 192 III. Odd-even graph operation method for solving China postal route problem and its improvement192 solution of graph theory problem in section VIII of WinQSB 194 I. Minimum spanning tree problem 194 II. Equipment update 195 iii. Maximum flow problem 197 iv. Minimum cost and maximum flow problem 198 Exercise 200 Chapter 8 Dynamic Programming 202 Section 1 Optimization of Multi-stage Decision-making Process Example 202 Section 2 Basic concepts, optimization principles and basic methods of dynamic programming 205 I. Basic concepts 205 II. Optimization Principles and Basic Methods of Dynamic Programming 207 Section III Basic Requirements and Solution Steps for Establishing Dynamic Programming Model 208 I Basic Requirements for Establishing Dynamic Programming Model 208 II. Solution steps of dynamic programming 209 Section 4 Application of dynamic programming 2 10 1. Resource allocation problem 2 10 2. Knapsack problem 2 13 3. Production and storage problems 2 15 iv. Equipment update problem 2 18 V. System reliability problem 22 1 Section 5 WinQSB solves dynamic programming problem 223 I. Shortest path problem 223 II. Production and storage problems. Knapsack Problem 225 Exercise 226 Chapter 9 Storage Theory 229 Section 1 Basic Concepts of Storage Theory 229 I. Problem Description 229 II. Basic Concepts 230 Section 2 Deterministic Storage Model 233 I. Model 1: No Shortage, Instant Replenishment 233 II. Model 2: No Shortage, Consumption while Replenishment 236 III. Model 3: Allow Shortage, Instant Replenishment 239 IV. Replenish goods while consuming 242 V. Model 5: Storage model with discounted price 245 Section 3 Single-cycle random storage model 222 Model 2: Demand is continuous random variable 25 1 Section 4 Other storage problems 252 I. Storage problems with limited storage capacity 252 II. Storage of perishable goods. Storage problem with probability constraints. Storage problem of multi-variety and multi-level inventory 256 V. Storage problem in supply chain 257 Section 5 WinQSB solution of storage model 260 I. Solving deterministic storage model 26 1 II. Solving. Solving the problem of single-cycle random storage model 264 exercises 265 Chapter 10 Decision analysis 267 Section 1 Concept of decision analysis 267 I. Natural state 267 II. Programme 267 III. Income 268. Decision criteria 268 Section 2 Decision under uncertain conditions 268 I Optimistic criteria 269 II. Pessimism standard. Moderately optimistic standard. Equal Probability Criterion 270 V. Regret Value Criterion 27 1 Section III Risk Decision 27 1 1. Maximum Possibility Criterion 272 II. Expected return standard 272 III. Bayesian decision 272. Decision Tree 274 Section IV Utility Theory 276 I Utility Function 276 II. Utility curve 277 III. Types and applications of utility curves Section 5 Analytic Hierarchy Process and its application 279 I. Overview of Analytic Hierarchy Process 280 II. The construction of judgment matrix 28 1 III. Single-level sorting and consistency checking. Approximate calculation 283 V. Overall ranking and consistency check of hierarchical structure 283 Section VI WinQSB solution for decision analysis 287 I. Benefit table analysis 288 II. Decision Tree Diagram 289 Exercise 290 Chapter XI Game Theory 292 Section I Concept and Classification of Game 292 I Player 293 II. Policy set 293 III. Interests of participants 294. Structure and classification of games. Matrix game 295 I. Mathematical description 295i. Mixed strategy game. The nature of the optimal strategy 300 Section III General solution of matrix game 302 I. Simplification of matrix game 302 II. Linear programming solution of matrix game 303 III. Special Solution 304 Section 4 Two-person Finite Non-zero-sum Game 308 I. Basic Concepts and Theorems 308 II. Noncooperative game 3 1 1 3. Cooperative Countermeasures 3 13 Section 5 WinQSB Solution of Game Theory 3 16 Exercise 3 17 Appendix Exercise Reference Answer 3 19 Reference 336