p.1177
p.1181
p.1186
p.1190
p.1196
p.1200
p.1205
p.1210
p.1214
A Global Optimization Approach for Solving the D.C. Multiplicative Programming Problem
Abstract:
In this paper, we present a global optimization algorithm for solving the D.C. multiplicative programming (DCMP) over a convex compact subset. By introducing auxiliary variables, we give a transformation under which both the objective and the feasible region turn to be d.c.Then we solve equivalent D.C. programming problem by branch and bound method and outer approximation algorithm.
Info:
Periodical:
Pages:
1196-1199
Citation:
Online since:
September 2013
Authors:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: