Abstract
This paper aims at solving a nonconvex mixed integer nonlinear programming (MINLP) model used to solve a refinery crude-oil operations scheduling problem. The model is mostly linear but contains bilinear products of continuous variables in the objective function. It is possible to define a linear relaxation of the model leading to a weak bound on the objective value of the optimal solution. A typical method to circumvent this issue is to discretize the continuous space and to use linear relaxation constraints based on variables lower and upper bounds (e.g. McCormick convex envelopes) on each subdivision of the continuous space. This work explores another approach involving constraint programming (CP). The idea is to use an additional CP model which is used to tighten the bounds of the continuous variables involved in bilinear terms and then generate cuts based on McCormick convex envelopes. These cuts are then added to the mixed integer linear program (MILP) during the search leading to a tighter linear relaxation of the MINLP. Results show large reductions of the optimality gap of a two step MILP-NLP solution method due to the tighter linear relaxation obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lee, H., Pinto, J.M., Grossmann, I.E., Park, S.: Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management. Industrial and Engineering Chemistry Research 35(5), 1630–1641 (1996)
Mouret, S., Grossmann, I.E., Pestiaux, P.: A novel priority-slot based continuous-time formulation for crude-oil scheduling problems. Industrial and Engineering Chemistry Research (to appear)
Jia, Z., Ierapetritou, M.G., Kelly, J.D.: Refinery short-term scheduling using continuous time formulation: Crude-oil operations. Industrial and Engineering Chemistry Research 42(13), 3085–3097 (2003)
Karuppiah, R., Furman, K.C., Grossmann, I.E.: Global optimization for scheduling refinery crude oil operations. Computers and Chemical Engineering 32(11), 2745–2766 (2008)
McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part 1 - convex underestimating problems. Mathematical Programming 10, 147–175 (1976)
Bergamini, M.L., Grossmann, I.E., Scenna, N., Aguire, P.: An improved piecewise outer-approximation algorithm for the global optimization of minlp models involving concave and bilinear terms. Computers and Chemical Engineering 32, 477–493 (2008)
Wicaksono, D.S., Karimi, I.A.: Piecewise milp under- and overestimators for global optimization of bilinear programs. AIChE Journal 54(4), 991–1008 (2008)
Pham, V., Laird, C.D., El-Halwagi, M.: Convex hull discretization approach to the global optimization of pooling problems. Industrial and Engineering Chemistry Research (2009) (to be published)
Sahinidis, N.V.: Global Optimization and Constraint Satisfaction: The Branch-and-Reduce Approach. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) COCOS 2002. LNCS, vol. 2861, pp. 1–16. Springer, Heidelberg (2003)
Balas, E., Jeroslow, R.G.: Canonical cuts on the unit hypercube. SIAM Journal on Applied Mathematics 23(1), 61–69 (1972)
ILOG Inc.: ILOG CPLEX 11.0 User’s Manual (September 2007)
Achterberg, T.: Scip - a framework to integrate constraint and mixed integer programming. Technical report, Zuse Institute Berlin (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mouret, S., Grossmann, I.E., Pestiaux, P. (2009). Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming. In: van Hoeve, WJ., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2009. Lecture Notes in Computer Science, vol 5547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01929-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-01929-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01928-9
Online ISBN: 978-3-642-01929-6
eBook Packages: Computer ScienceComputer Science (R0)