Journal article
Controlled dual perturbations for central path trajectories in geometric programming
European journal of operational research, Vol.73(3), pp.524-531
03/24/1994
DOI: 10.1016/0377-2217(94)90248-8
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 ϵ) 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.
Details
- Title: Subtitle
- Controlled dual perturbations for central path trajectories in geometric programming
- Creators
- J Zhu - National University of SingaporeK.O. Kortanek - University of IowaS. Huang - Hong Kong University of Science and Technology
- Resource Type
- Journal article
- Publication Details
- European journal of operational research, Vol.73(3), pp.524-531
- DOI
- 10.1016/0377-2217(94)90248-8
- ISSN
- 0377-2217
- eISSN
- 1872-6860
- Publisher
- Elsevier B.V
- Number of pages
- 8
- Language
- English
- Date published
- 03/24/1994
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963218202771
Metrics
2 Record Views