کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4635899 | 1340716 | 2006 | 9 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Linearization method for a class of multiplicative programming with exponent Linearization method for a class of multiplicative programming with exponent](/preview/png/4635899.png)
This paper presents a global optimization algorithm for a class of multiplicative programming with exponent under multiplicative constraints (MPE). By utilizing equivalent problem of MPE in the sense that they have the same optimal solution, tangential hypersurfaces and concave envelope approximations a linear relaxation of equivalent problem is received. Thus the initial nonconvex programming problem (MPE) is reduced to a sequence of linear programming problems through the successive refinement of a linear relaxation of feasible region of the objective function. The proposed algorithm is convergent to the globally optimal solution of MPE by means of the subsequent solutions of a series of linear programming problems. Numerical results indicate that the proposed algorithm is extremely robust and can be used successfully to solve global minimum of MPE on microcomputer.
Journal: Applied Mathematics and Computation - Volume 183, Issue 1, 1 December 2006, Pages 328–336