| Article ID: | iaor19981875 |
| Country: | China |
| Volume: | 18 |
| Issue: | 3 |
| Start Page Number: | 321 |
| End Page Number: | 328 |
| Publication Date: | Jul 1995 |
| Journal: | Acta Mathematicae Applicatae Sinica |
| Authors: | Sui S.L., He G.P. |
Some decomposition methods for a special class of geometric programming problems were given in some earlier articles. In this paper, the authors present a direct separating method which can be used to project a kind of primal algorithm for posynomial geometric programming of large size and of high degree of difficulty, and give several numerical examples.