No label defined (Q3675894)
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 3896658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3896658 |
Statements
1983
0 references
approximate methods
0 references
allocation problem
0 references
solution algorithm
0 references
0.8236709833145142
0 references
0.8185763955116272
0 references
0.8097163438796997
0 references
For the following allocation problem a solution algorithm is presented: \[ F(x)=\sum^{m}_{i=1}\sum^{n}_{j=1}c_{ij}x_{ij}+\sum^{m}_{i= 1}f_ i(x_ i)\to \min \] according to the restrictions \(\sum^{m}_{i=1}x_{ij}=B_ j\), \(j=\overline{1,n}\), \(\sum^{n}_{j=1}x_{ij}\leq x_ f\), \(i=\overline{1,m}\), \(x_{ij}\geq 0\), \(i=\overline{1,m}\); \(j=\overline{1,n}\), \(x_ i\in [0,\infty)\), where \(c_{ij}\geq 0\), \(B_ j>0\) and \(f_ i(x_ i)=c_ ix_ i+b_ i\) for \(x_ i>0\), and \(f_ i(x)=0\) for \(x_ i=0\), \(c_ i\geq 0\), \(b_ i>0\), \(i=\overline{1,m}\).
0 references