First Course in Optimization Techniques
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 UpdatesFirst Course in Optimization Techniques Syllabus — Unit-wise Content
The official GTU curriculum for First Course in Optimization Techniques (subject code 2712704) as prescribed for EAC( · Semester 1 divides the course into 6 units, covering 41 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 (2712704)Unit 1 Introduction to Optimization
- Mathematical formulation
- Classification of optimization problems
- Engineering applications of optimization
Unit 2 Classical Optimization Techniques
- Single variable optimization
- Constrained and unconstrained multivariable optimization
- Direct substitution method
- Lagrange’s method of multipliers
- Karush-Kuhn-Tucker conditions
Unit 3 Linear Programming
- Standard form of an LPP, Geometry of LPP, Simplex algorithm
- Two phases of the Simplex method
- Revised Simplex method
- Dual Simplex method
- Assignment problem
- Transportation problem
Unit 4 Nonlinear Programming (One-dimensional)
- Unimodal function
- Unrestricted search
- Exhaustive search
- Dichotomous search
- Interval halving method
- Fibonacci method
- Golden section method
- Quadratic interpolation method
- Cubic interpolation method
- Newton method
- Quasi-Newton method
- Secant method
Unit 5 Nonlinear Programming (Multidimensional unconstrained)
- Direct search methods: Random search methods
- Grid search method
- Univariate method
- Hooke and Jeeves method
- Powell’s method Indirect search methods: Steepest descent method
- Fletcher- Reeves method
- Newton’s method
- Test problems
Unit 6 Nonlinear Programming (Constrained)
- Random search methods
- Sequential linear programming
- Sequential quadratic programming
- Transformation techniques
- Basic approach of penalty function methods
- Interior and exterior penalty function methods
- Test problems+
Study on Android App:
