scientific article; zbMATH DE number 3896658

From MaRDI portal
Publication:3675894





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}\).




Cited in
(30)








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 Q3675894)