A New Global Optimization Algorithm for Solving Generalized Geometric Programming | Zendy

Sanyang Liu | Zendy; Chunfeng Wang | Zendy; Lixia Liu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Global Optimization Algorithm for Solving Generalized Geometric Programming

Author(s) -

Sanyang Liu,

Chunfeng Wang,

Lixia Liu

Publication year - 2010

Publication title -

mathematical problems in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.262

H-Index - 62

eISSN - 1026-7077

pISSN - 1024-123X

DOI - 10.1155/2010/346965

Subject(s) - convergence (economics) , linearization , mathematical optimization , pruning , algorithm , geometric programming , global optimization , mathematics , computer science , current (fluid) , nonlinear system , engineering , physics , electrical engineering , quantum mechanics , agronomy , economics , biology , economic growth

A global optimization algorithm for solving generalized geometric programming (GGP) problem is developed based on a new linearizationtechnique. Furthermore, in order to improve the convergence speed of this algorithm, a new pruning technique is proposed, which can be used to cut away alarge part of the current investigated region in which the global optimal solution does not exist. Convergence of this algorithm is proved, and some experimentsare reported to show the feasibility of the proposed algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research