What you will learn

• Linear programming
• Gradient methods
• Genetic algorithms
• Optimization

Course content (22 lessons)

1. Unit 1.1: Intro & Applications — Unit 1.1: Introduction & Engineering Applications 1. Introduction to Optimization Definition: Optimization is the act of obtaining the best result under given circumstances. In…
2. Unit 1.2: Problem Statement — Unit 1.2: Statement of an Optimization Problem An optimization problem can be mathematically stated as finding a vector of design variables X that minimizes (or maximizes) an…
3. Unit 1.3: Problem Formulation — Unit 1.3: Optimal Problem Formulation Formulating a problem is often more difficult than solving it. It involves translating a descriptive physical problem into a purely…
4. Unit 1.4: Classification — Unit 1.4: Classification of Optimization Problems Optimization problems are classified based on the nature of equations, constraints, and variables involved. Classification Table…
5. Unit 1.5: Global vs Local Optima — Unit 1.5: Global and Local Optima A major challenge in optimization is distinguishing between the "best in the neighborhood" and the "best in the world." 1. Local Minimum A point…
6. Unit 1.6: Optimality Criteria — Unit 1.6: Optimality Criteria How do we mathematically prove a point is a minimum? We use Calculus. A. Single Variable Functions f(x) 1. Necessary Condition (First Order) If x is…
7. Unit 2.1: Intro to Gradient Methods — Unit 2.1: Gradient-Based Methods for Unconstrained Optimization 1. Introduction Gradient-based methods are iterative algorithms that use the derivative (gradient) of the objective…
8. Unit 2.2: Steepest Descent Method — Unit 2.2: Cauchy’s Steepest Descent Method This is the oldest and simplest gradient-based method, proposed by Cauchy in 1847. 1. Concept At any point X , the function value…
9. Unit 2.3: Newton’s Method — Unit 2.3: Newton’s Method Newton’s method is a "Second-Order" method. It tries to fix the slow convergence of Steepest Descent by using curvature information. 1. Concept Steepest…
10. Unit 2.4: Conjugate Gradient — Unit 2.4: Conjugate Gradient Method (Fletcher-Reeves) This method bridges the gap between Steepest Descent (Simple but Slow) and Newton’s Method (Fast but Heavy). 1. Concept It…
11. Unit 2.5: Comparison & Summary — Unit 2.5: Comparison of Algorithms This comparative analysis is essential for selecting the right method for a given engineering problem. 1. Comparison Table Feature Steepest…
12. Unit 3.1: Intro to Constrained Optimization — Unit 3.1: Introduction to Constrained Optimization 1. The Problem Unconstrained methods (Unit 2) assume we can search anywhere. Constrained optimization restricts the search to a…
13. Unit 3.2: Direct Methods — Unit 3.2: Direct Methods Direct methods handle constraints by explicitly keeping the search point within the feasible region (the area where all constraints are satisfied). If a…
14. Unit 3.3: Indirect Methods (Penalty) — Unit 3.3: Indirect Methods: Penalty Function Penalty function methods transform a constrained problem into an unconstrained problem by adding a "penalty" term to the objective…
15. Unit 3.4: Gradient Projection — Unit 3.4: Steepest Descent for Constrained Problems While Steepest Descent is typically unconstrained, it is adapted for constrained problems using the Gradient Projection Method…
16. Unit 3.5: Applications & Summary — Unit 3.5: Engineering Applications & Summary Optimization is critical in engineering to improve efficiency and reduce costs. Engineering Applications 1. Structural Engineering…
17. Unit 4.1: Intro to Modern Methods — Unit 4.1: Modern (Non-Traditional) Optimization 1. Introduction Traditional methods (like Newton's method) rely on mathematical derivatives and often get stuck in local optima .…
18. Unit 4.2: Genetic Algorithms (GA) — Unit 4.2: Genetic Algorithms(GA) Definition: Genetic Algorithms are search heuristics that mimic the process of natural selection(Charles Darwin’s theory of evolution). Key…
19. Unit 4.3: Simulated Annealing — Unit 4.3: Simulated Annealing(SA) Definition: Inspired by the process of annealing in metallurgy , where a metal is heated and then slowly cooled to reduce defects(minimizing…
20. Unit 4.4: Swarm & Tabu Search — Unit 4.4: Ant Colony & Tabu Search 1. Ant Colony Optimization(ACO) Inspired by the behavior of ants searching for food. The Mechanism: 1. Foraging: Ants search randomly. 2.…
21. Unit 4.5: Neural & Fuzzy Optimization — Unit 4.5: Neural & Fuzzy Optimization 1. Neural - Network Based Optimization Uses Artificial Neural Networks(ANNs), like Hopfield Networks . The problem is mapped onto the "Energy…
22. Unit 4.6: Comparison & Summary — Unit 4.6: Comparison of Modern Methods Comparison Table Feature Genetic Algorithm(GA) Simulated Annealing(SA) Ant Colony(ACO) : --- : --- : --- : --- Inspiration Biological…

Unit 1.1: Intro & Applications

Unit 1.1: Introduction & Engineering Applications

1. Introduction to Optimization

Definition: Optimization is the act of obtaining the best result under given circumstances. In mathematics and engineering, it is strictly defined as the process of finding the conditions that give the maximum or minimum value of a function.

• "Best" can mean: Cheapest (Cost), Lightest (Weight), Strongest (Stress), or Fastest (Time).
• It is the bridge between "designing a working system" and "designing a perfect system."

Historical Development

• Newton & Leibniz (17th Century): Foundations of Calculus (finding maxima/minima using derivatives).
• Cauchy (19th Century): Steepest Descent method.
• Dantzig (1947): Simplex Method for Linear Programming (Revolutionized operations research).
• Karush-Kuhn-Tucker (KKT): Conditions for constrained optimization.

2. Engineering Applications

Optimization is used in almost all engineering disciplines.

Continue reading: Unit 1.1: Intro & Applications →

Frequently asked questions

Is the Engineering Optimization course really free?

Yes. The entire Engineering Optimization course on Siksha Sarovar is free to read with no account required. You can optionally sign in with Google to save your progress.

Do I get a certificate for Engineering Optimization?

Yes — finish the lessons and pass the quiz to earn a free, verifiable certificate you can share on LinkedIn or with recruiters.

Can I run code while learning?

Yes. The built-in online compiler runs C, C++, Python, Java, PHP, JavaScript, C# and SQL directly in your browser — no installation needed.