.png){kind=icon}
返回
Approximate linear programming for networks: Average cost bounds
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2015.04.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper uses approximate linear programming (ALP) to compute average cost bounds for queueing network control problems. Like most approximate dynamic programming (ADP) methods, ALP approximates the differential cost by a linear form. New types of approximating functions are identified that offer more accuracy than previous ALP studies or other performance bound methods. The structure of the infinite constraint set is exploited to reduce it to a more manageable set. When needed, constraint sampling and truncation methods are also developed. Numerical experiments show that the LPs using quadratic approximating functions can be easily solved on examples with up to 17 buffers. Using additional functions reduced the error to 1-5% at the cost of larger LPs. These ALPs were solved for systems with up to 6-11 buffers, depending on the functions used. The method computes bounds much faster than value iteration. It also gives some insights into policies. The ALPs do not scale to very large problems, but they offer more accurate bounds than other methods and the simplicity of just solving an LP. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Queueing network
Approximate dynamic programming
Linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
分享收藏Cholinergic modulation of hippocampal activity during episodic memory encoding in postmenopausal women.png)
MenopauseOAAI
MenopauseIF0
OAAI分享收藏Consideraciones sobre el ensayo de ANSTETT y el comportamiento de los cementos frente a sulfatos
OAAI
OAAI分享收藏The Relationship Between Sacral Slope and Symptomatic Isthmic Spondylolysis in a Cohort of High School Athletes: A Retrospective AnalysisPM&R
PM&RIF0
PREAI
分享收藏
查看更多内容