《Management Operations Research》Syllabus

Course Number:           2104607150 

Course Name:               Managerial Operations Research

Instructors:                    Zhu Jiulong

Required Text:     HAN Botang. Management Operations Research (Fourth Edition)[M].Beijing: Higher Education Press Society, 2018

Course Description:   Managerial Operations Research is a compulsory course for business administration majors. It is the application of analysis, experiment, quantitative methods, the economic management system in the human, material, financial resources and other resources for the overall arrangement, for the management decision-makers to provide a basis for the best plan, to achieve the most effective management. Through the study of this course, students will understand the basic concepts of management operations research, take the management operations research methodology as the guide, master the functions and attributes of basic models such as linear programming, integer programming, graphs and networks, be familiar with the basic conditions, steps and application skills of various methods and models, be able to abstract operations research models according to actual social and economic development problems, initially have the ability to manage operations research ideas and solve practical problems, and on this basis, understand the common software use skills of management operations research.

Credits/Teaching Hours

Outline of UG CPC Topics Covered in this Course:  (2.5 Credits/40 Teaching Hours)

Chapter 1 Linear Programming and Its Solution                6 Teaching Hours

Section 1 Course Introduction

Section 2 Linear Programming and Nonlinear Programming

Section 3 Feasible and Optimal Solutions

Section 4 Diagrammatic Method

Section 5 Sensitivity Analysis

In-Class Practice 1: Computer Solving for Linear Programming

Chapter 2 Application of Linear Programming in Business Administration

4 Teaching Hours

Section 1 Allocation of Human Resources

Section 2 Production Planning Issues

Section 3 Blanking and Blanking Problems

Section 4 Ingredient Issues

Section 5 Investment Issues

Chapter 3 Simplex Method                                 8 Teaching Hours

Section 1 The Basic Ideas and Principles of The Simplex Method

Section 2 Tabular Form of The Simplex Method

Section 3 Finding the Linear Programming Problem with The Smallest Objective Function

Section 4 Several Special Circumstances

In-Class Practice: Construction of Linear Programming Models

Chapter 4 Transport Issues                                 6 Teaching Hours

Section 1 General Forms of Production and Marketing Balance Transportation Issues

Section 2 Transportation Problems of Balance and Imbalance of Production and Sales

Section 3 Procedures on The Table

In-Class Practice: Modeling and Solving Transportation Problems

Chapter 5 Integer Planning                                 2 Teaching Hours

Section 1 Graphical and Computer Solving of Integer Programming

Section 2 Application of Integer Programming

Chapter 6 Goal Planning                                   2 Teaching Hours

Section 1 Graphical Approach to Goal Planning

Section 2 Goal Planning in Complex Situations

Chapter 7 Graph and Network Modeling                      8 Teaching Hours

Section 1 Basic Concepts of Graphs and Networks

Section 2 Shortest Circuit

Section 3 Minimal Spanning Tree Problem

Section 4 Maximum Flow Problem

Section 5 Minimum Cost and Maximum Flow

In-Class Practice: Network Model Construction and Computer Solving

Chapter 8 Theory of Countermeasures                        4 Teaching Hours

Section 1 Basic Concepts of Countermeasure Theory

Section 2 Optimal Pure Strategy for Matrix Countermeasures

Section 3 Mixed Strategies for Matrix Countermeasures

Section 4 Introduction to Other Types of Countermeasures

Total (Teaching Hours)                                                                          40 

 Summary of UG CPC Topics Covered in this Course:             (40Teaching Hours)