A new global optimization approach for convex multiplicative programming

GaoYuelin,WuGuorong,MaWeimin

A new global optimization approach for convex multiplicative programming

2010

GaoYuelin
WuGuorong
MaWeimin

In this paper, by solving the relaxed quasiconcave programming problem in outcome space, a new global optimization algorithm for convex multiplicative programming is presented. Two kinds of techniq...

Keywords:

Mathematical optimization
Quasiconvex function
Global optimization
Regular polygon
Branch and bound
Mathematics
multiplicative programming
global optimization algorithm

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations