Recursive formulae for ladder-network optimisation

The analysis, the gradient and the Hessian matrix of a ladder-network structure may be derived precisely from a family recursive formulae. The method is well suited to computer programming and extremely efficient computationally. The formulae might be included in a c.a.d. programme as a self-contained block and may be used to solve optimisation problems of certain ladder networks employing Newton-Raphson techniques.