|Start Page Number:||155|
|End Page Number:||181|
|Publication Date:||Jan 1997|
|Authors:||Ye Yinyu, Kortanek K.O., Xu Xiaojie|
In this paper an algorithm is presented for solving the classical posynomial geometric programming dual pair of problems simultaneously. The approach is by means of a primal–dual infeasible algorithm developed simultaneously for (i) the dual geometric program after logarithmic transformation of its objective function, and (ii) its Lagrangian dual program. Under rather general assumptions, the mechanism defines a primal–dual infeasible path from a specially constructed, perturbed Karush–Kuhn–Tucker system.