Department of Computer Science and Engineering
Optimization Techniques
(2150412)
COURSE OBJECTIVES:
● Understand the role of optimization in engineering applications.
● Define optimization problems and emphasize the importance of clear problem statements.
● Categorize optimization problems based on their characteristics and constraints.
● Differentiate between global and local optima and their implications in optimization.
● Explore concepts related to optimal design and their significance in engineering.
Unit 1: Introduction to Optimization
Overview of Optimization: Understanding the role of optimization in engineering applications.
Problem Formulation: Defining optimization problems, emphasizing the importance of clear problem statements.
Classification: Categorizing optimization problems based on their characteristics and constraints.
Unit 2: Optimum Design
Optimal Design Concepts: Exploring concepts related to optimal design and their significance in engineering.
Global vs. Local Optima: Differentiating between global and local optima, and their implications in optimization.
Optimality Criteria: Introduction to criteria used to evaluate optimality, ensuring a comprehensive understanding.
Basic Calculus Review: Revisiting fundamental calculus concepts relevant to optimization problems.
Global Optimality: Examining the concept of global optimality and its application in engineering scenarios.
Unit 3: Linear Programming
Introduction to linear programming (LP), Formulation of linear programming problems, Graphical method for
solving two-variable LP problems, Matrix notation and operations, Vector spaces and linear independence
Unit 4: Optimization Algorithms for Unconstrained and Constrained Optimization Problems
The distinction between constrained and unconstrained optimization.
Basics of Gradient Descent: Introduction to gradient-based optimization, Gradient Descent algorithm.
Steepest Descent: Understanding the steepest descent method, Comparison with traditional gradient descent,
Applications and limitations.
Newton's Method: Second-order optimization with Newton's method, Hessian matrix and convergence analysis.
Unit 5: Modern Methods of Optimization
Genetic Algorithms: Introduction to genetic algorithms and their role in optimization.
Simulated Annealing: Exploring the principles and applications of simulated annealing in optimization problems.
Ant Colony Optimization: Understanding the concepts and applications of ant colony optimization.
Fuzzy Optimization Techniques: Introduction to fuzzy optimization techniques and their practical applications.
RECOMMENDED BOOKS:
● Jorge Nocedal , Stephen J. Wright: Numerical Optimization.
● Andreas Antoniou, Wu-Sheng Lu: Practical_Optimizatopn
● Stephen Boyd, and Lieven Vandenberghe: Convex Optimization
COURSE OUTCOMES:
After completing this course, the students will be able to:
CO1: Describe fundamental concepts of optimization, including its role in engineering applications.
CO2: Describe a clear understanding of the importance of formulating optimization problems.
CO3: Apply their knowledge by classifying optimization problems, formulating linear programming
problems.
CO4: Analyze optimization algorithms such as gradient descent, steepest descent, Newton's method,
and direct methods for constrained optimization.
CO5: Evaluate optimization methods, comparing their efficiency, limitations, and practical
applications.
