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

Full description

Bibliographic Details

Published in:	Journal of the Chinese Institute of Industrial Engineers Vol. 17; no. 2; pp. 223 - 232
Main Author:	Yang, Hsu-Hao
Format:	Journal Article
Language:	English
Published:	Taylor & Francis Group 01.03.2000
Subjects:	geometric programming problem Interior point methods path-following algorithm path-following演算法 內點法 幾何規劃問題
ISSN:	1017-0669, 2151-7606
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!