Optimization Theory and Practice
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
English Book & Chapters
English Book Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesGTU Previous Year Papers
Papers Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesOptimization Theory and Practice Syllabus — Unit-wise Content
The official GTU curriculum for Optimization Theory and Practice (subject code 2724712) as prescribed for M · Semester 2 divides the course into 7 units, covering 38 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (2724712)Unit 1 Introduction to Optimization
- Historical Development
- Engineering applications of Optimization
- Design vector and constraints
- Constraint surface
- Objective function
- Classification of Optimization Problems 03 7.5
Unit 2 Classical Optimization Techniques
- Single variable optimization
- Constrained and unconstrained multi-variable optimization
- Direct substitution method
- Lagrange’s method of multipliers
- Karush-Kuhn-Tucker conditions
Unit 3 Linear Programming
- Statement of an LP problem
- Graphical Solution of an LP problem
- Simplex method
- Dual simplex method
Unit 4 Non-linear Programming
- One-dimensional minimization method Unimodal function
- Unrestricted search
- Exhaustive search
- Dichotomous search
- Interval halving method
- Fibonacci method
- Golden section method
- Direct root methods
Unit 5 Non-linear Programming
- Unconstrained Optimization Techniques Direct Search Methods: Random search methods
- Grid search method
- Univariate method
- Hookes and Jeeves’ method
- Powell’s method Indirect Search Methods: Steepest descent method
- Fletcher-Reeves method
- Newton’s method
Unit 6 Non-linear Programming
- Constrained Optimization Techniques Direct Methods: Random search method
- Sequential linear programming Indirect methods: Transformation techniques
- Exterior penalty function method
- Interior penalty function method
Unit 7 Evolutionary Algorithms
- An overview of evolutionary algorithms
- Simulated annealing algorithm
- Genetic algorithm
- Particle swarm optimization
Study on Android App:
