Abstract
The problem of selecting processes and planning expansions of a chemical complex to maximize net present value has been traditionally formulated as a multiperiod, mixed-integer linear program. In this paper, the problem is approached using an entirely continuous model. Compared to previous models, the proposed formulation allows for more general objective functions. In solving the continuous model, minimizing its nonconvex objective function poses the major obstacle. We overcome this obstacle by means of a branch-and-bound global optimization algorithm that exploits the concavity and separability of the objective function and the linearity of the constraint set. The algorithm terminates with the exact global optimum in a finite number of iterations. In addition, computational results demonstrate that the proposed algorithm is very efficient as, for a number of problems from the literature, it outperforms OSL, a popular integer programming package. We also develop a procedure for generating test problems of this kind.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Brooke, D. Kendrick and A. Meeraus. GAMS-A User's Guide. The Scientific Press, Redwood City, CA, 1988.
M. Benichou, J. M. Gauthier, P. Girodet, G. Hentges, G. Ribiere, and O. Vincent. Experiments in mixed-integer linear programming. Mathematical Programming, 1: 76 - 94, 1971.
IBM. Optimization Subroutine Library Guide and Reference Release 2. International Business Machines Corporation, Kingston, NY, third edition, July 1991.
M. L. Liu and N. V. Sahinidis. Computational trends and effects of approximations in an milp model for process planning. Industrial 6 Engineering Chemistry Research, 34: 1662 - 1673, 1995.
M. L. Liu and N. V. Sahinidis. Long range planning in the process industries: A projection approach. To appear in Computers é4 operations research, 1995.
H. S. Ryoo and N. V. Sahinidis. A branch-and-reduce approach to global optimization. Accepted for publication, Journal of Global Optimization, 1995.
H. S. Ryoo and N. V. Sahinidis. Global optimization of nonconvex nips and minlps with applications in process design. Computers and Chemical Engineering, 19: 551 - 566, 1995.
N. V. Sahinidis and I. E. Grossmann. Reformulation of the multiperiod milp model for capacity expansion of chemical processes. Operations Research, 40, Supp. No. 1: S127 — S144, 1992.
N. V. Sahinidis, I. E. Grossmann, R. E. Fornari, and M. Chathrathi. Optimization model for long range planning in the chemical industry. Computers and Chemical Engineering, 13: 1049 - 1063, 1989.
J. P. Shectman and N. V. Sahinidis. A finite algorithm for global minimization of separable concave programs. In C. A. Floudas and P. M. Pardalos, editors, Proceedings of State of the Art in Global Optimization: Computational Methods and Applications, Princeton University, April 28-30, 1995, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Liu, ML., Sahinidis, N.V., Shectman, J.P. (1996). Planning of Chemical Process Networks via Global Concave Minimization. In: Grossmann, I.E. (eds) Global Optimization in Engineering Design. Nonconvex Optimization and Its Applications, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5331-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5331-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4754-3
Online ISBN: 978-1-4757-5331-8
eBook Packages: Springer Book Archive