Minimização da Frequência de uma Programação Geométrica com Restriçõoes Pré-Fijadas

Abstract

Being the functions convex, ordered for the best by algorithms of the not linear programming, the not convex functions, in his turn, are attended by other techniques as the Dynamic Programming. These techniques are not always practicable and many times they are slow.
The Geometric Prgramming went far to order for the best of these functions.
The word aid the spiral spring design, writing down as a basic discretion the highest value of the original frequency, using the geometric programming, ordering for the best by a interaction number in a pref-fixed interval of restriction.