M.Tech I Year I Semester (R17)
To understand the theory of optimization methods and algorithms developed for
solving various types of optimization problems
The student will be able to understand the basic principles of optimization, and in
a position to formulate optimization models for a wide range of civil engineering problems and able to solve them.
Linear Programming: Introduction and need for optimization in engineering design, formulating linear programs, graphical solution of linear programs, special cases of linear programming.
The Simplex Method: Converting a problem to standard form, the theory of the simplex method, the simplex algorithm, special situations in the simplex algorithm, obtaining initial feasible solution.
Duality and Sensitivity Analysis: Sensitivity analysis, shadow prices, dual of a normal linear program, duality theorems, dual simplex method. Integer Programming: Formulating integer programming problems, the branch-and-bound algorithm for pure integer programs, the branch-and- bound algorithm for mixed integer programs.
Non-linear Programming: Introduction to non-linear programming (NLP), Convex and concave functions, NLP with one variable, Line search algorithms, Multivariable unconstrained problems, constrained problems, Lagrange Multiplier, The Karush-Kuhn-Tucker (KKT) conditions, the method of steepest ascent, convex combination method, penalty function, Quadratic programming,
Dynamic programming: Evolutionary algorithms: Genetic Algorithm, concepts of multiobjective optimization, Markov Process, Queuing Models.
Loading Question Papers
Fetching data from database...