Scribd
Upload
25 views1 page

Ma 9128

This document outlines the units and topics covered in the course MA9128 Operations Research. The five units cover queueing models, advanced queueing models, simulation techniques, linear programming, and non-linear programming. Key concepts include Poisson processes, Markovian queues, simulation methods like Monte Carlo, the simplex method for linear programming, and conditions for non-linear programs like Kuhn-Tucker. Recommended textbooks and references are also provided.

Uploaded by

Sathish Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
25 views1 page

Ma 9128

This document outlines the units and topics covered in the course MA9128 Operations Research. The five units cover queueing models, advanced queueing models, simulation techniques, linear programming, and non-linear programming. Key concepts include Poisson processes, Markovian queues, simulation methods like Monte Carlo, the simplex method for linear programming, and conditions for non-linear programs like Kuhn-Tucker. Recommended textbooks and references are also provided.

Uploaded by

Sathish Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

MA9128 OPERATIONS RESEARCH 3104

UNIT I QUEUEING MODELS 9

Poisson Process – Markovian Queues – Single and Multi-server Models – Little’s


formula – Machine Interference Model – Steady State analysis – Self Service Queue.

UNIT II ADVANCED QUEUEING MODELS 9

Non- Markovian Queues – Pollaczek Khintchine Formula – Queues in Series – Open


Queueing Networks –Closed Queueing networks.

UNIT III SIMULATION 9

Discrete Even Simulation – Monte – Carlo Simulation – Stochastic Simulation –


Applications to Queueing systems.

UNIT IV LINEAR PROGRAMMING 9

Formulation – Graphical solution – Simplex method – Two phase method -


Transportation and Assignment Problems.

UNIT V NON-LINEAR PROGRAMMING 9

Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn – Tucker


conditions – Quadratic Programming.

L + T: 45+15 =60
TEXT BOOKS

1. Winston.W.L. “Operations Research”, Fourth Edition, Thomson – Brooks/Cole,


2003.
2. Taha, H.A. “Operations Research: An Introduction”, Ninth Edition, Pearson
Education Edition, Asia, New Delhi, 2002.

REFERENCES

1. Robertazzi. T.G. “Computer Networks and System s – Queuing Theory and


Performance Evaluation”, Third Edition, Springer, 2002 Reprint.
2. Ross. S.M., “Probability Models for Computer Science”, Academic Press, 2002.

You might also like