A Comparison Between a Primal and a Dual Cutting Plane Algorithm for Polynomial Geometric-programming Problems

Cole, F.; Gochet, W.; Smeers, Yves

doi:10.1007/BF00940767

A Comparison Between a Primal and a Dual Cutting Plane Algorithm for Polynomial Geometric-programming Problems

Cole, F.

;

Gochet, W.

;

Smeers, Yves

(1985) Journal of Optimization Theory and Applications — Vol. 47, n° 2, p. 159-180 (1985)

Files

pdfdocument.pdf

Restricted Access
Adobe PDF
820.71 KB

Request a copy

Details

Authors

Cole, F.
Author
Gochet, W.
Author
Smeers, YvesUCLouvain
Author

Affiliations

UCLouvainFSA/INMA - Département d'ingénierie mathématique

Citations

APA
Chicago
FWB

Cole, F., Gochet, W., & Smeers, Y. (1985). A Comparison Between a Primal and a Dual Cutting Plane Algorithm for Polynomial Geometric-programming Problems. Journal of Optimization Theory and Applications, 47(2), 159-180. https://doi.org/10.1007/BF00940767 (Original work published 1985)