MA41010: Non Linear Programming
Jump to navigation
Jump to search
| MA41010 | |||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Course name | Non Linear Programming | ||||||||||||||||||||||||||
| Offered by | Mathematics | ||||||||||||||||||||||||||
| Credits | 4 | ||||||||||||||||||||||||||
| L-T-P | 3-1-0 | ||||||||||||||||||||||||||
| Previous Year Grade Distribution | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| Semester | Spring | ||||||||||||||||||||||||||
Syllabus
Syllabus mentioned in ERP
Prerequisite: Operations Research Convex set, Convex function, Generalized convex functions. Fritz John and Karush- Kuhn – Tucker optimality condition, duality, Convex programming problems, Quadratic programming, Fractional programming, Separable programming, Non linear integer programming. Constrained Optimization: One dimensional search methods, Multi-dimensional search methods. Unconstrained optimization: Conjugate gradient method, Generalized reduced gradient methods, Method of feasible direction.