基于线性规划的图上扩散最优边界控制
Optimal Boundary Control of Diffusion on Graphs via Linear Programming
AI总结:
本文提出基于线性规划的图上稳态扩散与通量优化框架,将边界势作为控制量,在通量约束下证明全局极小值存在性,并通过体育场与历史城市街道网络两个大规模示例验证其有效性。
摘要:
我们提出了一个用于几何网络稳态扩散与通量优化的线性规划(LP)框架。状态变量在加权有向图上满足离散扩散定律,其中电导按边长度缩放以保持几何保真度。边界势作为控制量,依据线性网络拉普拉斯算子驱动内部通量。该优化问题在所有边界边上施加物理上有意义的符号约束和通量上限约束,这些约束直接由梯度界导出。由此得到一个有限维线性规划,其可行集为多面体,其有界性与可解性由网络数据上的简单几何或代数条件决定。我们证明,在不存在负衰退方向(即没有负的 recession 方向)的情况下——当存在有限盒约束、通量上限或符号限制时该条件自动满足——该线性规划存在全局极小值。我们识别出若干保证可行域有界性的充分条件,涵盖满秩和秩亏通量映射两种情况。该分析将经典结果(如 Minkowski–Weyl 分解、Hoffman 界以及线性规划基本定理)与现代基于网络的扩散建模联系起来。两个大规模示例说明了该框架:(i)一个位于主要现代城市中的典型大型体育场,它形成一个具有相对均匀走廊宽度的单一连通分量;(ii)一个从大型历史城市中心向外延伸的复杂街道网络,它形成一个多分量系统。
英文摘要:
We propose a linear programming (LP) framework for steady-state diffusion and flux optimization on geometric networks. The state variable satisfies a discrete diffusion law on a weighted, oriented graph, where conductances are scaled by edge lengths to preserve geometric fidelity. Boundary potentials act as controls that drive interior fluxes according to a linear network Laplacian. The optimization problem enforces physically meaningful sign and flux-cap constraints at all boundary edges, derived directly from a gradient bound. This yields a finite-dimensional LP whose feasible set is polyhedral, and whose boundedness and solvability follow from simple geometric or algebraic conditions on the network data. We prove that under the absence of negative recession directions--automatically satisfied in the presence of finite box bounds, flux caps, or sign restrictions--the LP admits a global minimizer. Several sufficient conditions guaranteeing boundedness of the feasible region are identified, covering both full-rank and rank-deficient flux maps. The analysis connects classical results such as the Minkowski--Weyl decomposition, Hoffman's bound, and the fundamental theorem of linear programming with modern network-based diffusion modeling. Two large-scale examples illustrate the framework: (i) A typical large stadium in a major modern city, which forms a single connected component with relatively uniform corridor widths, and a (ii) A complex street network emanating from a large, historical city center, which forms a multi-component system.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。