Abstract
Abstract This paper presents a detailed survey of the latest techniques for solving large geometric programs. Geometric programming is a very powerful method for solving a large class of nonlinear programming problems, but it has been severely restricted in practice due to the inability to handle even moderate sized problems; that is, those possessing more than a few degrees of difficulty. During the past two years, a number of significant break-throughs have taken place in regard to handling both large problems and the general signomial, or signed programs. Several new algorithms, some untested in practice, are presented and discussed in this paper.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
