MSc (Mathematics and Computing) Programme:Advanced Optimization TechniquesThapar University
Price on request
Real Analysis – I
Fundamentals of Computer Science and C Programming
Discrete Mathematical Structure
Real Analysis –II
Advanced Abstract Algebra
Computer Oriented Numerical Methods
Data Based Management Systems
Computer Based Optimization Techniques
Advanced Optimization Techniques
Nonlinear programming: Convex sets and convex functions, their properties, convex programming problem, generalized convexity, Pseudo and Quasi convex functions, KT conditions.
Goal Programming: Graphical solution.
Separable programming, Geometric programming, Problems with positive coefficients up to one degree of difficulty, Generalized method for the positive and negative coefficients.
Search Techniques: Direct search and gradient methods, Unimodal functions, Fibonacci method, Golden Section method, Method of steepest descent, Newton-Raphson method, Hooke's and Jeeve's method, Conjugate gradient methods.
Dynamic Programming: Deterministic and Probabilistic Dynamic Programming, Discrete and continuous dynamic programming, simple illustrations.
Multiobjective Programming: Efficient solutions, Domination cones