scientific article; zbMATH DE number 3999657

From MaRDI portal
Publication:4726045





The deterministic allocation problem can be presented in the form \[ \min \sum_{j}q_ jd(x,x_ j) \] where \(q_ j\) are given values which are interpreted as demand levels at points with the coordinates \(x_ j\) and d(x,y) is a measure of distance between x and y. If \(q_ j\) are random values the problem must be replaced by some stochastic analogue. The special case where the stochastic equivalent has the form \[ \min \sum_{j}\sigma^ 2[q_ j](\sum_{i}| x^ i-x^ i_ j|)^ k,\quad k\geq 2 \] is investigated in detail. Optimality conditions are given and an iterative algorithm is described.











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