Power System Management & Optimization
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 UpdatesPower System Management & Optimization Syllabus — Unit-wise Content
The official GTU curriculum for Power System Management & Optimization (subject code 2720717) as prescribed for EE · Semester 2 divides the course into 5 units, covering 35 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 (2720717)Unit 1 Introduction Optimal problem formulation, Design variables,
- Objective function
- Variable bounds
- Optimization algorithms
Unit 2 Linear Programming Formulation of LPP, Graphical method, Simplex
- The use of artificial variables
- Big-M method
- Sensitivity analysis and duality theory
Unit 3 Non linear Programming I Single-Variable optimization algorithms,
- Optimality criteria
- Exhaustive search method
- Bounding phase method
- Region-Elimination methods
- Interval halving method
- Fibonacci search method
- Golden Section search method
- Point-Estimation method
- Successive quadratic estimation method
- Gradient based methods
- Newton-Raphson method
- Bisection method
- Secant method
- Cubic search method
Unit 4 Non linear Programming II
- Multivariable optimization algorithms
- optimality criteria
- Direct search methods
- Hooke and Jeeve’s method
- Powell’s conjugate direction method
- Simplex method
- Indirect search (descent) method
- Cauchy’s (steepest descent) method
- Conjugate gradient (Fletcher-Reeves) method
- Newton’s method
Unit 5 Non linear Programming III
- Multivariable constrained optimization algorithms
- Generalized reduced gradient method
- Gradient projection method
- Box-Complex algorithm
- Kuhn-Tucker conditions, and Penalty function methods