Abstract
In the tradition of modeling languages for optimization, a single model is passed to a solver for solution. In this paper, we extend BARON’s modeling language in order to facilitate the communication of problem-specific relaxation information from the modeler to the branch-and-bound solver. This effectively results into two models being passed from the modeling language to the solver. Three important application areas are identified and computational experiments are presented. In all cases, nonlinear constraints are provided only to the relaxation constructor in order to strengthen the lower bounding step of the algorithm without complicating the local search process. In the first application area, nonlinear constraints from the reformulation–linearization technique (RLT) are added to strengthen a problem formulation. This approach is illustrated for the pooling problem and computational results show that it results in a scheme that makes global optimization nearly as fast as local optimization for pooling problems from the literature. In the second application area, we communicate with the relaxation constructor the first-order optimality conditions for unconstrained global optimization problems. Computational experiments with polynomial programs demonstrate that this approach leads to a significant reduction of the size of the branch-and-bound search tree. In the third application, problem-specific nonlinear optimality conditions for the satisfiability problem are used to strengthen the lower bounding step and are found to significantly expedite the branch-and-bound algorithm when applied to a nonlinear formulation of this problem.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
S Ahmed M. Tawarmalani N.V. Sahinidis (2004) ArticleTitleA finite branch-and-bound algorithm for two-stage stochastic integer programs Mathematical Programming. 100 355–377 Occurrence Handle10.1007/s10107-003-0475-6
A Ben-Tal G. Eiger V. Gershovitz (1994) ArticleTitleGlobal minimization by reducing the duality gap Mathematical Programming 63 193–212 Occurrence Handle10.1007/BF01582066
J. Bisschop A. Meeraus (1982) ArticleTitleOn the development of a general algebraic modeling system in a strategic planning environment Mathematical Programming Study 20 1–29
D Du J. Gu P.M. Pardalos (Eds) (1997) Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 35 American Mathematical Society Providence, RI
J.E. Falk R.M. Soland (1969) ArticleTitleAn algorithm for separable nonconvex programming problems Management Science 15 550–569
R Fourer D. Gay B.W. Kernigham (1993) AMPL: A Modeling Language for Mathematical Programming The Scientific Press San Francisco, CA
Gau, T., Schrage, L.E. (2003). Implementing a global solver in a general purpose callable library, Global Optimization Theory Institute, Argonne National Laboratory, September 8–10
V. Ghildyal (1997) Design and Development of a Global Optimization System. Master’s thesis Department of Mechanical & Industrial Engineering, University of Illinois Urbana, IL
Ghildyal V., Sahinidis N.V. (2001). Solving global optimization problems with BARON. In: Migdalas A, Pardalos P., Varbrand P. (ed). From Local to Global Optimization, A Workshop on the Occasion of the 70th Birthday of Professor Hoang Tuy, Linköping, Sweden, Aug. 24–29, 1997, Kluwer Academic Publishers, Boston, MA pp. 205–230
Gu J, Purdom P.W., Franco J., Wah B.W. (1997). Algorithms for the satisfiability (SAT) problem: A survey. In: Du D, Gu J., Pardalos P.M. (ed). Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 35. Providence RI, pp. 19–151
Hoos, H.H., Stützle, T. (2000). SATLIB: An Online Resource for Research on SAT. In: Gent I.P., van Maaren, H., Walsh, T. (eds.). Satisfiability Problem: Theory and Applications, IOS Press, Amsterdam, pp. 283–292. SATLIB is available online at http://www.satlib.org/
R. Horst H. Tuy (1996) Global Optimization, Deterministic Approaches EditionNumber3 Springer Verlag Berlin
Kearfott R.B. (1996). Rigorous Global Search: Continuous Problems, In: Nonconvex Optimization and Its Applications, Vol. 13. Kluwer Academic Publishers, Dordrecht
McCormick, G.P. (1972). Converting general nonlinear programming problems to separable nonlinear programming problems. Technical Report T-267, The George Washington University, Washington, D.C
G.P. McCormick (1976) ArticleTitleComputability of global solutions to factorable non-convex programs: Part I – Convex underestimating problems Mathematical Programming 10 147–175 Occurrence Handle10.1007/BF01580665
McCormick G.P. (1983). Nonlinear Programming: Theory, Algorithms and Applications, John Wiley & Sons
R. Moore (1993) Interval Analysis Prentice Hall Englewood Cliffs, NJ
I. Quesada I.E. Grossmann (1995) ArticleTitleGlobal optimization of bilinear process networks and multicomponent flows Computers and Chemical Engineering 19 IssueID12 1219–1242 Occurrence Handle10.1016/0098-1354(94)00123-6
H.S. Ryoo N.V. Sahinidis (1995) ArticleTitleGlobal optimization of nonconvex NLPs and MINLPs with applications in process design Computers and Chemical Engineering 19 551–566 Occurrence Handle10.1016/0098-1354(94)00097-8
H.S. Ryoo N.V. Sahinidis (1996) ArticleTitleA branch-and-reduce approach to global optimization Journal of Global Optimization 8 107–139 Occurrence Handle10.1007/BF00138689
N.V. Sahinidis (1996) ArticleTitleBARON: A general purpose global optimization software package Journal of Global Optimization 8 201–205 Occurrence HandleMR1376505
N.V. Sahinidis (2003) Global optimization and constraint satisfaction: The branch-and-reduce approach C. Bliek A.C. Jermann A. Neumaier (Eds) Global Optimization and Constraint Satisfaction, Lecture Notes in Computer Science Vol. 2861. Springer Berlin 1–16
H Schichl S. Dallwig A. Neumaier (2001) ArticleTitleThe NOP-2 modeling language for nonlinear programming Annals of Operations Research 104 281–312 Occurrence Handle10.1023/A:1013115708967 Occurrence HandleMR1880407
Schweiger, C.A., Floudas, C.A. (1998). MINOPT: A Modeling Language and Algorithmic Framework for Linear, Mixed-Integer, Nonlinear, Dynamic, and Mixed-Integer Nonlinear Optimization, Version 3.1, User’s Manual’. Available at http://titan.princeton.edu/MINOPT/minopt.html.
J.P. Shectman N.V. Sahinidis (1998) ArticleTitleA finite algorithm for global minimization of separable concave programs Journal of Global Optimization 12 1–36 Occurrence Handle10.1023/A:1008241411395
Sherali H.D., Adams, W.P. (1999). A Reformulation–Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, In: Nonconvex Optimization and its Applications, Vol. 3.1 Kluwer Academic Publishers, Dordrecht
H.D. Sherali W.P. Adams Driscol P.J. (1999) ArticleTitleExploiting special structures in constructing a hierarchy of relaxations for 0–1 mixed integer programs Operations Research 46 396–405 Occurrence HandleMR1663053
H.D. Sherali J.C. Smith (2001) ArticleTitleImproving discrete model representations via symmetry considerations Management Science 47 1396–1407 Occurrence Handle10.1287/mnsc.47.10.1396.10265
H.D. Sherali C.H. Tuncbilek (1995) ArticleTitleA reformulation–convexification approach for solving nonconvex quadratic programming problems Journal of Global Optimization 7 1–31 Occurrence Handle10.1007/BF01100203
H.D. Sherali H. Wang (2001) ArticleTitleGlobal optimization of nonconvex factorable programming problems Mathematical Programming 89 459–478
E.M.B. Smith C.C. Pantelides (1996) Global optimisation of general process models I.E. Grossmann (Eds) Global Optimization in Engineering Design. Kluwer Academic Publishers Boston, MA 355–386
M. Tawarmalani N.V. Sahinidis (2001) ArticleTitleSemidefinite relaxations of fractional programs via novel techniques for constructing convex envelopes of nonlinear functions Journal of Global Optimization 20 137–158 Occurrence Handle10.1023/A:1011233805045
M. Tawarmalani N.V. Sahinidis (2002) ArticleTitleConvex extensions and convex envelopes of l.s.c. functions Mathematical Programming 93 247–263 Occurrence Handle10.1007/s10107-002-0308-z
M. Tawarmalani N.V. Sahinidis (2002) Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Vol. 65 of Nonconvex Optimization and Its Applications Kluwer Academic Publishers Dordrecht
M. Tawarmalani N.V. Sahinidis (2004) ArticleTitleGlobal optimization of mixed-integer nonlinear programs: A theoretical and computational study Mathematical Programming. 99 563–591 Occurrence Handle10.1007/s10107-003-0467-6
P Van Hentenryck L. Michel Y. Deville (1997) Numerica: A Modeling Language for Global Optimization The MIT Press Cambridge, MA
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sahinidis, N.V., Tawarmalani, M. Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints. J Glob Optim 32, 259–280 (2005). https://doi.org/10.1007/s10898-004-2705-8
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-004-2705-8