Path-Following Algorithms for Posynomial Geometric Programming Problems

Geometric programming (GP) is a class of optimization problems with a nonlinear objective function subject to a set of nonlinear constraints. The problems considered in this paper are posynomial GP problems, whose solutions can be obtained by solving a dual linear programing problem. The primary pur...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of the Chinese Institute of Industrial Engineers Jg. 17; H. 2; S. 223 - 232
1. Verfasser:	Yang, Hsu-Hao
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Taylor & Francis Group 01.03.2000
Schlagworte:	geometric programming problem Interior point methods path-following algorithm path-following演算法內點法幾何規劃問題
ISSN:	1017-0669, 2151-7606
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Geometric programming (GP) is a class of optimization problems with a nonlinear objective function subject to a set of nonlinear constraints. The problems considered in this paper are posynomial GP problems, whose solutions can be obtained by solving a dual linear programing problem. The primary purpose of this paper is to investigate the quality of solutions found by, the application of a path-following algorithm, which is one of interior point methods. Two majorr approches to solve posynomial GP problems are investigated. One is dual GP as Generalized Lmear Programming (GLP) and the other is the traditional dual GP. The test results suggest that dual GP as GLP approach is advantageous over the posynomial one in the event that high a~curacy of the solution is required or critically important.
ISSN:	1017-0669 2151-7606
DOI:	10.1080/10170669.2000.10433300