A Global Optimization Approach for Solving the D.C. Multiplicative Programming Problem

Article Preview

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

1196-1199

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] C.D. Maranas, I.P. Androulakis, C.A. Floudas, A.J. Berger, J.M. Mulvey, Solving long-term financial planning problems via global optimization. Journal of Economic Dynamics and Control. 21 (1997) 1405-1425.

DOI: 10.1016/s0165-1889(97)00032-8

Google Scholar

[2] M.C. Dorneich, N.V. Sahinidis, Global optimization algorithms for chip design and compaction. Engineering Optimization. 25(2) (1995) 131-154.

DOI: 10.1080/03052159508941259

Google Scholar

[3] H. Konno, T. Kuno, Y. Yajima, Global optimization of a generalized convex multiplicative function. Journal of Global Optimization. 4 (1994) 47-62.

DOI: 10.1007/bf01096534

Google Scholar

[4] X.G. Zhou, K. Wu, A method of acceleration for a class of multiplicative programming problems with exponent, Journal of Computational and Applied Mathematics, 223 (2009) 975-982.

DOI: 10.1016/j.cam.2008.03.031

Google Scholar

[5] R.T. Rockafellar, R.J. -R. Wets, Variational Analysis, Springer, (1998).

Google Scholar

[6] Konno, H., and Yamashita, H., Minimizing Sums and Products of Linear Fractional Functions ouer a Polytope, Naval Research Logistics, 46 (1999) 583-596.

DOI: 10.1002/(sici)1520-6750(199908)46:5<583::aid-nav8>3.0.co;2-5

Google Scholar