Global optimization for signomial discrete programming problems in engineering design

Engineering Optimization

Volumn 34, Issue 6, 2002, Pages 613-622

  Tsai, Jung Fa ^a   Li, Han Lin ^a   Hu, Nian Ze ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Convexification; Global optimization; Signomial discrete programming problem

Indexed keywords

BOUNDARY VALUE PROBLEMS; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING;

ENGINEERING DESIGN;

COMPUTER PROGRAM LISTINGS;

EID: 0036913354     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052150215719     Document Type: Article

References (21)

1. Borchers, B. and Mitchell, J.E. (1994). An improved branch and bound algorithm for mixed integer nonlinear programs. Computers and Operations Research, 21(4), 359-367.
2. Cardoso, M.F., Salcedo, R.L. and Feyo de Azevedo, S. (1996). The simplex-simulated annealing approach to continuous nonlinear optimization. Computers and Chemical Engineering, 20, 1065-1080.
3. Cha, J. and Mayne, R. (1989). Optimization with discrete variables via recursive quadratic programming: Part 2. Transactions of the ASME, 111, 130-136.
4. Duan, M. and Grossmann, I.E. (1986). An outer-approximation algorithm for a class of mixed integer nonlinear programs. Mathematical Programming, 36, 307-339.
5. Floudas, C.A. (1995). Nonlinear and Mixed Integer Optimization: Fundamentals and Applications. Oxford University Press, New York.
6. Floudas, C.A. (1999). Global optimization in design and control of chemical process systems. Journal of Process Control, 10, 125-134.
7. Floudas, C.A. (1999). Recent advances in global optimization for process synthesis, design and control: Enclosure of all solutions. Computer and Chemical Engineering, 23, 963-974.
8. Floudas, C.A. (2000). Deterministic Global Optimization: Theory, Methods and Application. Kluwer Academic Publishers, Boston.
9. Floudas, C.A. and Pardalos, P.M. (1996). State of the Art in Global Optimization: Computational Methods and Applications. Kluwer Academic Publishers, Boston.
10. Fu, J.F., Fenton, R.G. and Cleghom, W.L. (1991). A mixed integer-discrete-continuous programming method and its application to engineering design optimization. Engineering Optimization, 17(3), 263-280.
11. Li, H.L. and Chang, C.T. (1998). An approximate approach of global optimization for polynomial programming problems. European Journal of Operational Research, 107, 625-632.
12. Li, H.L. and Chou, C.T. (1994). A global approach for nonlinear mixed discrete programming in design optimization. Engineering Optimization, 22, 109-122.
13. LINGO Release 7.0. (2001). LINDO System Inc., Chicago.
14. Maranas, C.D. and Floudas, C.A. (1997). Global optimization in generalized geometric programming. Computer and Chemical Engineering, 21, 351-370.
15. Michelon, P. and Maeulan, N. (1991). Lagrangean decomposition for integer nonlinear programming with linear constraints. Mathematical Programming, 52, 303-313.
16. Pörn, R., Harjunkoski, I. and Westerlund, T. (1999). Convexification of different classes of non-convex MINLP problems. Computers and Chemical Engineering, 23, 439-448.
17. Rinnooy, K. and Timmer, G. (1987). Towards global optimization methods (I and II). Mathematical Programming, 39, 27-78.
18. Salcedo, R.L., Goncalves, M.J. and Feyo de Azevedo, S. (1990). An improved random-search algorithm for nonlinear optimization. Computer and Chemical Engineering, 14, 1111-1126.
19. Sandgren, E. (1990). Nonlinear integer and discrete programming in mechanical design optimization. Journal of Mechanical Design, 112, 223-229.
20. Shin, D.K., Gurdal, Z. and Griffin, O.H., Jr. (1990). A penalty approach for nonlinear optimization with discrete design variables. Engineering Optimization, 16(1), 29-42.
21. Wang, H.F. and Liao, Y.C. (1998). A hybrid approach to resolving a differentiable integer program. Computers and Operations Research, 25(6), 505-517.