Optimisation Techniques (EE476)
Programme:
B.Tech (E&E)
Semester:
Eighth
Category:
Programme Specific Electives (PSE)
Credits (L-T-P):
04 (3-1-0)
Content:
Linear Programming: Simplex method and extensions. Network models: Shortest path, maximum flow and minimum cost problems. Dynamic programming: resource allocation, production scheduling and equipment replacement problem. Non-linear programming: selected unconstrained and constrained non-linear programming algorithms like quasi Newton, reduced gradient and gradient projection methods. Penalty function methods, Quadratic programming.
References:
1. Lueneburger , Linear and Non linear Programming, McGraw-Hill.
2. Fletcher, Optimization techniques, John Wiley and Sons.
Department:
Electrical and Electronics Engineering