arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.01481math.OC
收藏

空间不确定性下有序 Weber 问题的结构与解分析

Structural and Solution Analysis for the Ordered Weber Problem under Spatial Uncertainty

Institute of Mathematics (IMAG), Universidad de Granada(格拉纳达大学数学研究所(IMAG))

Víctor Blanco, Miguel Martínez-Antón

AI总结:

本文提出单设施连续选址的一般分析框架,用概率测度表示需求不确定性并利用有序加权平均算子聚合期望距离,证明了模型性质并开发了收敛的自适应样本平均近似方案。

摘要:

我们提出了一种用于空间需求不确定性下单设施连续选址问题的一般分析框架。与基于离散或区域聚合需求的经典模型不同,该模型通过 $\R^d$ 上的一般概率测度来表示不确定性,从而在统一公式下涵盖了有限、有界和无界支撑分布。该目标通过有序加权平均算子聚合期望距离,提供了一个灵活的数学结构,将经典 Weber 问题及其有序扩展作为特例包含在内。我们建立了该随机有序 Weber 模型的基本性质,包括凸性、连续性和最优解的存在性,并推导了随机最小化器与需求支撑凸包之间接近程度的定量界限。基于这些结果,我们开发并分析了一种自适应样本平均近似方案,证明了其收敛性,并在温和的正则性条件下推导了有限样本误差估计。对于球对称分布,我们进一步获得了近似误差的显式解析表达式。这些结果为广泛的随机有序选址模型提供了严格的数学基础,并突显了凸分析、随机规划和有序优化之间的新理论联系。

英文摘要:

We propose a general analytical framework for single-facility continuous location problems under spatial demand uncertainty. In contrast to classical formulations based on discrete or regionally aggregated demands, the proposed model represents uncertainty through general probability measures on $\R^d$, thereby encompassing finite, bounded, and unbounded support distributions within a unified formulation. The objective aggregates expected distances by means of an ordered weighted averaging operator, providing a flexible mathematical structure that includes the classical Weber problem and its ordered extensions as special cases. We establish fundamental properties of this stochastic ordered Weber model, including convexity, continuity, and existence of optimal solutions, and we derive quantitative bounds on the proximity between stochastic minimizers and the convex hulls of demand supports. Building upon these results, we develop and analyze an adaptive sample average approximation scheme, proving its convergence and deriving finite-sample error estimates under mild regularity conditions. For spherically symmetric distributions, we further obtain explicit analytical expressions for the approximation error. Together, these results provide a rigorous mathematical foundation for a broad class of stochastic ordered location models and highlight new theoretical connections between convex analysis, stochastic programming, and ordered optimization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑