SCHEME/SYLLABUS : MCA(SE)
(Second Semester)

Code No: BA 610
Paper : Mathematics II

Linear programming : graphical methods for two dimensional problems – central problem of linear programming – various definitions – statements of basic theorems and properties – phase i and phase ii of the simplex method – revised simplex method –primal and dual – dual simplex method – sensitivity analysis – transportation problem and its solution – assignment problem and its solution by Hungarian method.

Integer programming: Gomory cutting plane methods – branch and bound method.

Queuing theory: characteristics of queuing systems – steady state m/m/1,m/m/1/k and m/m/c queuing models.

Replacement theory : replacement of items that deteriorate – replacement of items that fail group replacement and individual replacement.

Inventory theory : costs involved in inventory problems – single item deterministic models – economic lot size models without shortages and with shortages having partition rate infinite and finite.

Pert and CP/M : arrow network- time estimates – earliest expected time, latest allowable occurrence time, latest allowable occurrence time and slack – critical path – probability of meeting scheduled date of completion of project – calculation of CP/M network – various floats for activities – critical path – updating project – operation time cost trade off curve – selection of schedule based on cost analysis

References:

1. Gillet, B.E.., “Introduction to Operation Research : a computer oriented algorithmic approach “ Tata McGraw Hill, NY.
2. Gross D., and Harris, C. M., “Fundamentals of queueing theory “, John Willey and Sons, NY.
3. Hillier F., and Lieberman, G. J. , “Introduction to Operation Research”, Holden Day , NY.
4. Kambo, N.S., “Mathematical Programming Techniques”, McGraw Hill.
5. Kanti Swaroop, Gupta P. K., Man Mohan, “Operations Research”, Sultan Chand and Sons.
6. Taha, H. A., “Operations Research – An Introduction”, McMillan Publishing Company, NY.

Go back to MCA(SE) Syllabi Page