To date, large geometric programs have been difficult to solve. This paper presents a simplex-based approach to the solution of such programs which is indifferent to the degree of difficulty of the problem. Furthermore, unlike many gradientsearch techniques its success is not dependent upon a "good" starting point.
No takes yet. Share an insight, caveat, or question.
Kochenberger et al. (1973) studied this question.