ISSN:
1573-2878
Keywords:
Nonlinear programming
;
geometric programming
;
computation
;
comparisons
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Numerous algorithms for the solution of geometric programs have been reported in the literature. Nearly all are based on the use of conventional programming techniques specialized to exploit the characteristic structure of either the primal or the dual or a transformed primal problem. This paper attempts to elucidate, via computational comparisons, whether a primal, a dual, or a transformed primal solution approach is to be preferred.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00933403
Permalink