My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Syllabus of University of Pune MCA Semester IV-Optimization Techniques
Posted Date: 20 Sep 2008 Resource Type: Articles/Knowledge Sharing Category: Syllabus
|
Posted By: S.Yamininagarajan Member Level: Diamond
Rating:  Points: 2
|
|
|
MT41-Optimization Techniques
Objective : To introduce linear programming, dynamic programming and related
optimization theories to solve real life / simulated problems.
1 Linear Programming
Various definitions, statements of basic
theorems and properties, Advantages,
Limitations and Application areas of Linear
Programming
Linear Programming – The Graphical method
– Graphical Solution methods of Linear
Programming problem, Maximization Linear
Programming problem, Maximization
Problem.
Linear Programming – Simplex Method –
Phase I and Phase II of the Simplex Method,
The Revised Simplex method, Primal and
Dual Simplex Method, Simplex Algorithm for
maximization case, Simplex Algorithm for
minimization case – Two phase method and
the Big –M method.
Transportation Problem and its solution,
Assignment Problem and its solutions by
Hungarian Method
2 Integer Programming
Gomory Cutting Plan Methods – Branch and
Bound Method
3 Queuing Theory
Characteristics of Queuing Models. Transient
and Steady states of the System.
Model – I [ (M/M/1) : (FCFS / ¥ /¥ ) ]
Model II – Generalization of Model [ (M/M/1) :
(FCFS / ¥ / ¥ ) ] (Birth- Death Process)
[(M/M/1) : (FCFC / N/ ¥ ) (Finite Queue
Length Model)
4 Replacement Theory
Replacement of items that deteriorates.
Replacement of items that fails suddenly,
Individuals and Group Replacement- Policy
5 INVENTORY THEORY
Inventory Model Building, Single item
deterministic Model, Inventory Control
Models without strategies and Inventory
Control Models with shortages.
6 PERT & CPM
Basic differences between PERT and CPM.
Arrow Networks, time estimates, earliest
expected time, latest – allowable
occurrences time, Forward Pass
Computation, Backward Pass Computation,
Representation in Tabular Form Critical
Path, Probability of meeting scheduled date
of completion, Calculation on CPM network.
Various floats for activities, Critical path
updating projects. Operation time cost
tradeoff Curve project, Time cost – tradeoff
Curve- Selection of schedule based on Cost
Analysis, Crashing the network
References :
1. Introduction to Operation Research-A Computer Oriented Algorithm Approach
Filet B. E.
2. Fundamental of Queuing Theory
Gross D. and Ilaris C.M.
3. Introduction to Operation Research
Hiller F and Lieberman G. J.
4. Mathematical Programming technique
Kambo N.S.
5. Operations Research
KantiSwarup, Gupta P.K. and ManMohan.
6. Optimization Methods in Operations Research and System Analysis
Mital K.V.
7. The Critical Path Method
Saffer L.R., Fitter J.B. and Meyer W.L.
8. Operation Research
J.K. Sharma
9. Operation Research
Taha H.A.
For more details, visit http://www.unipune.ernet.in/stud_info/Syllabi/Syllabus_2008.html
|
Responses
|
No responses found. Be the first to respond and make money from revenue sharing program.
|
|
Watch TV Channels
|