A Branch and Bound Algorithm for Generalized Polynomial Programming Problems

In this paper a branch and bound algorithm is proposed for polynomial programming problems (P) that arise in various practical problems. By utilizing an exponential variable transformation and the mean value theorem a linear relaxation of the (P) is then obtained. Through the successive refinement o...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Information Engineering and Computer Science pp. 1 - 4
Main Authors Qigao Feng, Hanping Mao, Juntao Wang, Hongwei Jiao
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2009
Subjects
Approximation algorithms
Electronic mail
Embedded computing
Linear approximation
Linear programming
Mathematical programming
Mathematics
Optimization methods
Polynomials
Standards development
Online AccessGet full text

Cover

More Information
Summary:In this paper a branch and bound algorithm is proposed for polynomial programming problems (P) that arise in various practical problems. By utilizing an exponential variable transformation and the mean value theorem a linear relaxation of the (P) is then obtained. Through the successive refinement of a linear relaxation of feasible region of the objective function and the solutions of a series of linear programming problems the proposed algorithm is convergent to the global minimum of the (P). At finally numerical results indicate the feasibility of the proposed algorithm.
ISBN:9781424449941
1424449944
ISSN:2156-7379
2156-7387
DOI:10.1109/ICIECS.2009.5365116