Please use this identifier to cite or link to this item:
Title: Controlled dual perturbations for central path trajectories in geometric programming
Authors: Zhu, J. 
Kortanek, K.O.
Huang, S.
Keywords: Duality gap
Geometric programming
Perturbation method
Primal-dual algorithm
Issue Date: 1994
Citation: Zhu, J.,Kortanek, K.O.,Huang, S. (1994). Controlled dual perturbations for central path trajectories in geometric programming. European Journal of Operational Research 73 (3) : 524-531. ScholarBank@NUS Repository.
Abstract: A dynamic perturbation algorithm is developed building on the work of Fang, Peterson and Rajasekera, who introduced simple lower bounds as perturbations in an equivalent dual pair to the posynomial geometric programming primal and dual programs. In their approach, a duality gap tolerance is pre-specified, and then the perturbations are determined from additional information, such as a current feasible point and a bound for the optimal program value. Our approach updates the perturbation vector in at most O(In ε{lunate}) outer loop iterations, while requiring no more than a 50% reduction in the current duality gap in each inner loop iteration. One of the advantages of our approach is that the perturbation bound tends to stay away from zero in a way that results in more stable computations. © 1994.
Source Title: European Journal of Operational Research
ISSN: 03772217
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Sep 22, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.