Você está na página 1de 2

DILLA UNIVERSITY

SCHOOL OF MATHEMATICAL AND COMPUTER SCIENCE

Program of mathematics
Course outline
Course title: Operations Research Course code: Math 451 Credit hours: 3 Contact hrs: 3 Tutorial hrs: 2 Prerequisite: Math 356 Academic year: 2004 E.C Prepared by: Temesgen Tsegaye e-mail: teme6@yahoo.com Course objectives On completion of the course, successful students will be able to: identify the problems that can be solved using quantitative methods, explain steps in quantitative analysis, use computers to perform quantitative analysis, apply quantitative analysis in modelling and solving decision making problems, formulate a decision making problem, develop the use of probability in decision making, apply the method of depicting a series of decisions and outcomes of decisions, use computers to aid decision making, analyze solutions, identify different types of forecast, measure forecast accuracy, apply time-series forecasting models, formulate different types of inventory models, formulate different types of queuing models, relate queuing problems to simulation, apply inventory models to material requirement planning, formulate problems that can be solved using integer programming check feasibility of solutions of an integer programming problem. Chapter 1: Integer programming 1.1 Introduction 1.2 Problem formulation 1.3 Optimal feasible solution Chapter 2 : Deterministic dynamic programming 2.1 Bellman principle 2.2 Forward and backward recursion 2.3 Dynamic programming for Knapsack problem Chapter 3 : Inventory models 3.1 Elements of inventory analysis 3.2 Inventory control systems Chapter 4: Forecasting 4.1 Introduction 4.2 Types of forecast 4.3 Scatter diagram 4.3 Measures of forecasting accuracy Chapter 5: Decision theory 5.1 Decision making without probabilities 1

5.2 Decision making with probabilities 5.3 Utility in decision making 5.4 Solving problems using computer software Chapter 6: Queuing systems 6.1 Single server model 6.2 Multi-server models 6.3 Machine repair models 6.4 Queues in series 6.5 Queues in Priorities 6.6 Queuing simulation 6.6.1 Types of simulation 6.6.2 Elements of discrete event simulation 6.6.3 Manual simulation of a single server model Chapter 7: Simulation modeling 7.1 Random variable 7.2 Monte Carlo simulation 7.3 Different types of simulation 7.4 Applications Teachinglearning methods Three contact hours of lectures and two hours of tutorials per week. Students do home assignment. Some topics of some of the chapters will be given as reading assignments. Assessment methods Continuous assessment (Assignment, project, Test, and quiz) 40% Final examination 60% Teaching materials References: F. S. Hillier and G. J. Lieberman, Introduction to operations research, Holdeday, 2001 H. A. Taha, Operations research, an introduction, Macmillan publishing company, 2002 W. L. Winston, Operations research: Applications and algorithms, Duxbury Press, Belmont, 1994 Eric V. Denardo, The science of decision making: a problem-based approach using Excel, John Wiley & Sons, Inc., 2002 Walter C. Giffin, Queuing Theory and applications, Grid Inc, 1978 Rechard J. Terssine (1994) Principles of inventory and materials th management, 4 edn. Prientice-Hall 1994

Você também pode gostar