A robust algorithm for generalized geometric programming

Authors:
Peiping Shen;Yuan Ma;Yongqiang Chen
Affiliations:
College of Mathematics and Information Science, Henan Normal University, Xinxiang, P.R.China 453007;College of Mathematics and Information Science, Henan Normal University, Xinxiang, P.R.China 453007;College of Mathematics and Information Science, Henan Normal University, Xinxiang, P.R.China 453007
Venue:
Journal of Global Optimization
Year:
2008

Citing 5
Cited 1

Geometric programming based robot control design

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Effectiveness of a geometric programming algorithm for optimization of machining economics models

Computers and Operations Research
Monotonic Optimization: Problems and Solution Approaches

SIAM Journal on Optimization
Robust Solution of Nonconvex Global Optimization Problems

Journal of Global Optimization
Global optimization of generalized geometric programming

Computers & Mathematics with Applications

Global optimization for the generalized polynomial sum of ratios problem

Journal of Global Optimization

Quantified Score

Hi-index	0.02

Visualization

Abstract

Most existing methods of global optimization for generalized geometric programming (GGP) actually compute an approximate optimal solution of a linear or convex relaxation of the original problem. However, these approaches may sometimes provide an infeasible solution, or far from the true optimum. To overcome these limitations, a robust solution algorithm is proposed for global optimization of (GGP) problem. This algorithm guarantees adequately to obtain a robust optimal solution, which is feasible and close to the actual optimal solution, and is also stable under small perturbations of the constraints.