Solution to geometric programming problems by transformation to convex programming problems
暂无分享,去创建一个
Abstract Structural optimization problems which can be transformed to geometric programming problems can be easily solved by a further simple transformation to convex programming problems. Non-zero degree of difficulty geometric programming problems can be solved as easily as those with zero degree of difficulty.
[1] A. Morris. Structural optimization by geometric programming , 1972 .
[2] Janusz S. Kowalik,et al. Iterative methods for nonlinear optimization problems , 1972 .
[3] Clarence Zener,et al. Geometric Programming : Theory and Application , 1967 .
[4] Douglass J. Wilde,et al. Foundations of Optimization. , 1967 .
[5] R. R. Hocking,et al. CONVEX PROGRAMMING BY TANGENTIAL APPROXIMATION , 1963 .