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.
Recommendations
Cited in
(13)- Stochastic multi-facility minisum location problem involving Euclidean distances
- Allocation through stochastic Schur convexity and stochastic transposition increasingness
- Mass transportation and the consistency of the empirical optimal conditional locations
- On optimal allocation of indivisibles under uncertainty
- Convergence Rates for the Optimal Values of Allocation Processes
- scientific article; zbMATH DE number 1194425 (Why is no real title available?)
- scientific article; zbMATH DE number 20271 (Why is no real title available?)
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
- The multifacility center problems with random demand weights
- On the efficiency and optimality of random allocations
- The stochastic location-assignment problem on a tree
- Some deterministic and stochastic nonlinear optimization modelling for the spatial allocation of multicategorical resources: with an application to real health data
- Spatial point process models for location-allocation problems
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)