Scribd
Upload
48 views

Gradient Search Method

The gradient search method is used for automated transmission system planning to minimize a performance index of a given transmission network. It starts with an initial DC load flow solution and future forecasts. The performance index is calculated and circuit modifications are made using partial derivatives of the performance index with respect to circuit admittances. The process repeats with new DC load flow solutions until no further decrease in the performance index can be obtained.

Uploaded by

Samer Alsadi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
48 views

Gradient Search Method

The gradient search method is used for automated transmission system planning to minimize a performance index of a given transmission network. It starts with an initial DC load flow solution and future forecasts. The performance index is calculated and circuit modifications are made using partial derivatives of the performance index with respect to circuit admittances. The process repeats with new DC load flow solutions until no further decrease in the performance index can be obtained.

Uploaded by

Samer Alsadi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Gradient Search Method

Student : Zaid saify

Prof. Samer Alsadi


Introduction-
The gradient search method is a nonlinear mathematical programming applicable to the socalled •
.automated transmission system planning
Here, the objective function that is to be minimized is a performance index of the given •
transmission network. The method starts with a dc load-flow solution for the initial transmission
.network and future load and generation forecasts
The system performance index is calculated, and the necessary circuit modifications are made •
.using the partial derivatives of the performance index with respect to circuit admittances
Again, a dc load-flow solution is obtained, and the procedure is repeated as many times as •
necessary until a network state is achieved for which no further decrease in the performance
.index can be obtained
Multidimensional Gradient Method overview-

Use information from the derivatives of the optimization function to guide the search- •
Find solutions quicker- •
Good initial estimate of the solution is required- •
The objective function needs to be differentiable- •
Calculations -

when applied to a function it represents the functions directional derivatives- •


the gradient is the special case where the direction of the gradient is the direction of most or - •
the steepest ascent/descent
Hessians-

Hessians is the jacobian matrix of second order partial derivatives of a function- •


: for two dimensional function the hessian matrix is- •
Example-
steepest Ascent/Descent Method-
Example -

You might also like