scientific article; zbMATH DE number 2000146
From MaRDI portal
Publication:4433719
The following mixed integer problem is dealt with \[ \sum c_{j}x_{j}\rightarrow \min, \quad\text{s.t.}\quad \sum a_{ij}x_{j}\geq b_{i}, \] \( x_{j}\in \{0,1\}\) for \(j\in J_{1},\) \(x_{j}\in [0,1]\) for \(j\in J_{2},\) \(J_{1}\cup J_{2}=J=\{1,2,\dots,n\},\) \(i\in \{1,2,\dots,m\},\) and \(c_{j}\geq 0\) for \(j\in J.\) In the paper a new algorithm based on Lagrangean decomposition and certain bounds is proposed. A numerical illustrative example is presented and discussed. Possible modifications are also considered.
Recommendations
- scientific article; zbMATH DE number 3314879
- A decomposition technique for mixed integer programming problems
- Mixed decomposition in block integer linear programming problems
- Mixed-integer bilinear programming problems
- Untersuchungen zu speziellen linearen gemischt-ganzzahligen 0-1-optimierungsaufgaben
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4433719)
