A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
From MaRDI portal
Publication:933795
DOI10.1007/s10898-007-9203-8zbMath1145.90055OpenAlexW2023575482MaRDI QIDQ933795
Ramkumar Karuppiah, Ignacio E. Grossmann
Publication date: 25 July 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9203-8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Natural gas production network infrastructure development under uncertainty, Unit-operation nonlinear modeling for planning and scheduling applications, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, A review of recent advances in global optimization, A new local and global optimization method for mixed integer quadratic programming problems, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs, Polylithic modeling and solution approaches using algebraic modeling systems, A dynamic convexized method for nonconvex mixed integer nonlinear programming, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, A scalable global optimization algorithm for stochastic nonlinear programs, Lagrangian relaxation of the generic materials and operations planning model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A global optimization method, QBB, for twice-differentiable nonconvex optimization problem
- A new reformulation-linearization technique for bilinear programming problems
- A branch and bound method for stochastic global optimization
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Dual decomposition in stochastic integer programming
- Global minimum potential energy conformations of small molecules
- Solving mixed integer nonlinear programs by outer approximation
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- A global optimization algorithm for linear fractional and bilinear programs
- BARON: A general purpose global optimization software package
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Introduction to Stochastic Programming
- Complete search in continuous global optimization and constraint satisfaction
- Canonical Cuts on the Unit Hypercube
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
