No label defined (Q4726045)
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 3999657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3999657 |
Statements
1986
0 references
stochastic allocation
0 references
random demand
0 references
Optimality conditions
0 references
0.7978670001029968
0 references
0.7947573065757751
0 references
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.
0 references