Credits: 3 (3-0-0)
Description
Classical optimization techniques for unconstrained optimization. Kutur Tucker conditions. Sensitivity analysis for linear programming problems. Non-linear programming. Penalty function methods. Sequential linear programming. Feasible direction methods. Quadratic programming. Geometric programming. Integer programming. Application in engineering design.