Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
From MaRDI portal
Publication:946351
DOI10.1007/S10898-006-9128-7zbMath1151.90027DBLPjournals/jgo/LiWS07OpenAlexW1973251107WikidataQ57445481 ScholiaQ57445481MaRDI QIDQ946351
Publication date: 23 September 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9128-7
Integer programming (90C10) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (6)
Exact solution method to solve large scale integer quadratic multidimensional knapsack problems ⋮ An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ Improving an exact approach for solving separable integer quadratic knapsack problems ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ Distance confined path problem and separable integer programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computational complexity of reliability redundancy allocation in a series system
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Global optimization of multiplicative programs
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A nonlinear knapsack problem
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Towards strong duality in integer programming
- Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
- An algorithm for concave integer minimization over a polyhedron
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Methods of Nonlinear 0-1 Programming
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Constructive Duality in Integer Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A Convergent Duality Theory for Integer Programming
- A hybrid approach to discrete mathematical programming
- A Survey of Lagrangean Techniques for Discrete Optimization
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- An algorithm and new penalties for concave integer minimization over a polyhedron
- The Nonlinear Resource Allocation Problem
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming by Implicit Enumeration and Balas’ Method
- A Balasian-Based Algorithm for Zero-One Polynomial Programming
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- Global optimization of nonconvex factorable programming problems
- \(p\)th power Lagrangian method for integer programming
- Analysis of bounds for multilinear functions
- A geometric study of dual gaps, with applications
- A pegging algorithm for the nonlinear resource allocation problem
This page was built for publication: Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
