Syllabus

MA40013
Course name	Non Linear Programming
Offered by	Mathematics
Credits	4
L-T-P	3-1-0
Previous Year Grade Distribution
	{{{grades}}}
Semester	Spring

Syllabus mentioned in ERP

Prerequisite: Operations ResearchConvex 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.

Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

Additional Resources