Experiments with MINLP Branching Techniques
نویسنده
چکیده
Mixed-integer nonlinear optimization problems arise in scientific and operational applications ranging from the reordering of nuclear fuel rods to the design of wireless networks. We present some novel mixed-integer nonlinear optimization applications and review existing solution techniques. We also describe some experiments with nonlinear branch-and-bound branching techniques that lead us to promote a tighter integration of nonlinear solvers into a general branch-and-cut framework.
منابع مشابه
Branching and bounds tighteningtechniques for non-convex MINLP
Many industrial problems can be naturally formulated using Mixed Integer Nonlinear Programming (MINLP) models and can be solved by spatial Branch&Bound (sBB) techniques. We study the impact of two important parts of sBB methods: bounds tightening and branching strategies. We extend a branching technique originally developed for MILP, reliability branching, to the MINLP case. Motivated by the de...
متن کاملMore Branch-and-Bound Experiments in Convex Nonlinear Integer Programming
Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) problems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Programming (MILP). No detailed study of branching has heretofore been carried out for MI...
متن کاملStrong-branching inequalities for convex mixed integer nonlinear programs
Strong branching is an effective branching technique that can significantly reduce the size of the branch-and-bound tree for solving Mixed Integer Nonlinear Programming (MINLP) problems. The focus of this paper is to demonstrate how to effectively use “discarded” information from strong branching to strengthen relaxations of MINLP problems. Valid inequalities such as branching-based linearizati...
متن کاملGlobal Optimization of MINLP Problems in Process Synthesis and Design
Abstract : Two new methodologies for the global optimization of MINLP models, the Special structure Mixed Integer Nonlinear BB, SMIN– BB, and the General structure Mixed Integer Nonlinear BB, GMIN– BB, are presented. Their theoretical foundations provide guarantees that the global optimum solution of MINLPs involving twice–differentiable nonconvex functions in the continuous variables can be id...
متن کاملA Primal Heuristic for MINLP based on Dual Information
We present a novel heuristic algorithm to identify feasible solutions of a mixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network’s capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer...
متن کامل