Resumen de The current state-of-the-art of algorithms and computer software for geometric programming
This paper attempts to consolidate over 15 years of attempts at designing algorithms for geometric programming (GP) and its extensions. The pitfalls encounteres when solving GP's and some proposed remedies are discussed in detail. A comprehensive summary of published software for the solution of GP problems is included. Also included, is a numerical comparison of some of the more promising recently developed computer codes for geometric programming, on a specially chosen set of GP test problems. The relative performance of these codes is measured in terms of their robustness as well as speed of computation. The performance of some general nonlinear programming (NLP) codes on the same set of test problems is also given and compared with the results for the GP codes. The paper concludes with some suggestions for future research.
