Lagrangean decomposition for integer nonlinear programming with linear constraints
From MaRDI portal
For the integer nonlinear programming problem \(\min f(x)\), \(Ax=b\), \(Bx\leq d\), \(x\in X\), where \(X=\{0,1\}^ n\), \(b\in R^ m\), \(A\in R^{m\times n}\), \(B\in R^{q\times m}\), the authors introduce additional variables so that, via these variables and extra conditions, the problem is transformed to a continuous nonlinear programming problem and an integer linear one. The paper contains conditions for this type of problem- splitting and also solution algorithms.
Recommendations
- Lagrangean decomposition for integer programming : theory and applications
- Lagrangean Decomposition In Integer Linear Programming: A New Scheme
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
Cites work
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Lagrangean decomposition for integer programming : theory and applications
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Methods of Nonlinear 0-1 Programming
- Mixed-integer quadratic programming
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
Cited in
(26)- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Polyhedral analysis and decompositions for capacitated plant location-type problems
- A hybrid approach to resolving a differentiable integer program.
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
- Lagrangean methods for 0-1 quadratic problems
- A nonlinear Lagrangian dual for integer programming
- A look at the past and present of optimization - an editorial
- A distributed computation algorithm for solving portfolio problems with integer variables
- Towards strong duality in integer programming
- On the mixed integer signomial programming problems
- Generalized nonlinear Lagrangian formulation for bounded integer programming
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Generalized Benders decomposition for one class of MINLPs with vector conic constraint
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- scientific article; zbMATH DE number 3628723 (Why is no real title available?)
- An homage to Joseph-Louis Lagrange and Pierre Huard
- An algebraic approach to integer portfolio problems
- pth power Lagrangian method for integer programming
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Numerical behavior of LP algorithms based upon the decomposition principle
- About Lagrangian methods in integer optimization
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- A survey for the quadratic assignment problem
- A Lagrangian bound for many-to-many assignment problems
This page was built for publication: Lagrangean decomposition for integer nonlinear programming with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181738)
