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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of the Chinese Institute of Industrial Engineers Ročník 17; číslo 2; s. 223 - 232
Hlavný autor:	Yang, Hsu-Hao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis Group 01.03.2000
Predmet:	geometric programming problem Interior point methods path-following algorithm path-following演算法 內點法 幾何規劃問題
ISSN:	1017-0669, 2151-7606
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!