JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Prerequisite

None

Course Outcomes

After completion of the course, students will be able to:

• Apply the dynamic programming to solve problems of discreet and continuous variables.
• Apply the concept of non-linear programming
• Carry out sensitivity analysis
• Model the real-world problem and simulate it.

UNIT - I

Optimization Techniques, Model Formulation, models, General L.R Formulation, Simplex Techniques, Sensitivity Analysis, Inventory Control Models

UNIT - II

Formulation of a LPP - Graphical solution revised simplex method - duality theory – dual simplex method - sensitivity analysis - parametric programming

UNIT - III

Nonlinear programming problem - Kuhn-Tucker conditions min cost flow problem – max flow problem - CPM/PERT

UNIT - IV

Scheduling and sequencing - single server and multiple server models – deterministic inventory models - Probabilistic inventory control models - Geometric Programming.

UNIT - V

Competitive Models, Single and Multi-channel Problems, Sequencing Models, Dynamic Programming, Flow in Networks, Elementary Graph Theory, Game Theory Simulation

TEXTBOOKS/ REFERENCES:

• 1. H.A. Taha, Operations Research, An Introduction, PHI, 2008
• 2. H.M. Wagner, Principles of Operations Research, PHI, Delhi, 1982.
• 3. J.C. Pant, Introduction to Optimization: Operations Research, Jain Brothers, Delhi, 2008
• 4. Hitler Libermann Operations Research: McGraw Hill Pub. 2009
• 5. Pannerselvam, Operations Research: Prentice Hall of India 2010
• 6. Harvey M Wagner, Principles of Operations Research: Prentice Hall of India 2010 M. Tech – III Semester L T P C 3 0 0 3