No label defined (Q4433719)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2000146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2000146 |
Statements
3 November 2003
0 references
integer linear programming
0 references
Boolean programming
0 references
Lagrangean decomposition
0 references
labeling method
0 references
0.7392298579216003
0 references
0.7387785315513611
0 references
0.7379491925239563
0 references
0.7355672717094421
0 references
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.
0 references
