An optimization approach for solving signomial discrete programming problems with free variables

Computers and Chemical Engineering

Volumn 30, Issue 8, 2006, Pages 1256-1263

  Tsai, Jung Fa ^a   Lin, Ming Hua ^b  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b SHIH CHIEN UNIVERSITY   (Taiwan)

Author keywords

Convexification; Free variables; Global optimization; Signomial discrete programming

Indexed keywords

FINITE DIFFERENCE METHOD; GLOBAL OPTIMIZATION; MACHINE DESIGN; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

CONVEX INTEGER PROGRAMS; CONVEXIFICATION; FREE VARIABLES; SIGNOMIAL DISCRETE PROGRAMMING (SDP);

MATHEMATICAL PROGRAMMING;

FINITE DIFFERENCE METHOD; GLOBAL OPTIMIZATION; MACHINE DESIGN; MATHEMATICAL PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

EID: 33646804140     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2006.02.013     Document Type: Article

References (32)

1. Biegler L.T., and Grossmann I.E. Retrospective on optimization. Computers and Chemical Engineering 28 (2004) 1169-1192
2. Björk K.-M., Lindberg P.O., and Westerlund T. Some convexifications in global optimization of problems containing signomial terms. Computers and Chemical Engineering 27 (2003) 669-679
3. Borchers B., and Mitchell J.E. An improved branch and bound algorithm for mixed integer nonlinear programs. Computers and Operations Research 21 4 (1994) 359-367
4. Cardoso M.F., Salcedo R.L., and Feyo de Azevedo S. The simplex-simulated annealing approach to continuous nonlinear optimization. Computers and Chemical Engineering 20 (1996) 1065-1080
5. Cha J., and Mayne R. Optimization with discrete variables via recursive quadratic programming: Part 2. Transactions of the ASME 111 (1989) 130-136
6. Duran M., and Grossmann I.E. An outer-approximation algorithm for a class of mixed integer nonlinear programs. Mathematical Programming 36 (1986) 307-339
7. Fletcher R., and Leyffer S. Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming 66 (1994) 327-349
8. Floudas C.A. Nonlinear and mixed integer optimization: Fundamentals and applications (1995), Oxford University Press, New York
9. Floudas C.A. Global optimization in design and control of chemical process systems. Journal of Process Control 10 (1999) 125-134
10. Floudas C.A. Recent advances in global optimization for process synthesis, design and control: Enclosure of all solutions. Computers and Chemical Engineering 23 (1999) 963-974
11. Floudas C.A. Deterministic global optimization: Theory, methods and applications (2000), Kluwer Academic Publishers, Boston
12. Floudas C.A., and Pardalos P.M. State of the art in global optimization: Computational methods and applications (1996), Kluwer Academic Publishers, Boston
13. Fu J.F., Fenton R.G., and Cleghorn W.L. A mixed integer-discrete-continuous programming method and its application to engineering design optimization. Engineering Optimization 17 3 (1991) 263-280
14. Geoffrion A.M. Generalized benders decomposition. Journal of Optimization Theory and Applications 10 (1972) 237-260
15. Grossmann I.E., and Biegler L.T. Part II. Future perspective on optimisation. Computers and Chemical Engineering 28 (2004) 1193-1218
16. Leyffer S. Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Computational Optimization and Applications 18 (2001) 295-309
17. Li H.L., and Chang C.T. An approximate approach of global optimization for polynomial programming problems. European Journal of Operational Research 107 (1998) 625-632
18. Li H.L., Chang C.T., and Tsai J.F. An approximately global optimization for assortment problems using piecewise linearization techniques. European Journal of Operational Research 140 (2002) 584-589
19. Li H.L., and Chou C.T. A global approach for nonlinear mixed discrete programming in design optimization. Engineering Optimization 22 (1994) 109-122
20. LINGO Release 9.0. (2004). Chicago: LINDO System Inc.
21. Maranas C.D., and Floudas C.A. Global optimization in generalized geometric programming. Computers and Chemical Engineering 21 (1997) 351-370
22. Pörn R., Harjunkoski I., and Westerlund T. Convexification of different classes of non-convex MINLP problems. Computers and Chemical Engineering 23 (1999) 439-448
23. Quesada I., and Grossmann I.E. An LP/NLP based branch and bound algorithm for convex MINLP optimization problems. Computers and Chemical Engineering 16 (1992) 937-947
24. Rinnooy K., and Timmer G. Towards global optimization methods (I and II). Mathematical Programming 39 (1987) 27-78
25. Rosen S.L., and Harmonosky C.M. An improved simulated annealing simulation optimization method for discrete parameter stochastic systems. Computers and Operations Research 21 4 (2005) 359-367
26. Salcedo R.L., Goncalves M.J., and Feyo de Azevedo S. An improved random-search algorithm for nonlinear optimization. Computers and Chemical Engineering 14 (1990) 1111-1126
27. Sandgren E. Nonlinear integer and discrete programming in mechanical design optimization. Journal of Mechanical Design 112 (1990) 223-229
28. Stubbs R.A., and Mehrotra S. A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming 86 (1999) 515-532
29. Tsai J.F., Li H.L., and Hu N.Z. Global optimization for signomial discrete programming problems in engineering design. Engineering Optimization 34 (2002) 613-622
30. Wang H.F., and Liao Y.C. A hybrid approach to resolving a differentiable integer program. Computers and Operations Research 25 6 (1998) 505-517
31. Westerlund T., and Pettersson F. An extended cutting plane method for solving convex MINLP problems. Computers and Chemical Engineering 19 (1995) S131-S136
32. Xiong Y., and Rao S.S. Fuzzy nonlinear programming for mixed-discrete design optimization through hybrid genetic algorithm. Fuzzy Sets and Systems 146 (2004) 167-186