Theory and Computational methods of Nonlinear Programming are discussed. Recent developments are also given. Unconstrained and constrained problems are considered. Major topics include: Gradient method, Penalty and Barrier method, Interior point method, Kuhn-Tucker condition, Saddle point and Duality. (Prerequisite: IE531 Linear Programming or permission of Instructor)