线性规划
数学
独立同分布随机变量
算法
平滑度
后悔
数学优化
基质(化学分析)
在线算法
凸性
计算机科学
随机变量
数学分析
统计
材料科学
金融经济学
经济
复合材料
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2022-09-01
卷期号:70 (5): 2948-2966
被引量:7
标识
DOI:10.1287/opre.2021.2164
摘要
We study an online linear programming (OLP) problem under a random input model in which the columns of the constraint matrix along with the corresponding coefficients in the objective function are independently and identically drawn from an unknown distribution and revealed sequentially over time. Virtually all existing online algorithms were based on learning the dual optimal solutions/prices of the linear programs (LPs), and their analyses were focused on the aggregate objective value and solving the packing LP, where all coefficients in the constraint matrix and objective are nonnegative. However, two major open questions were as follows. (i) Does the set of LP optimal dual prices learned in the existing algorithms converge to those of the “offline” LP? (ii) Could the results be extended to general LP problems where the coefficients can be either positive or negative? We resolve these two questions by establishing convergence results for the dual prices under moderate regularity conditions for general LP problems. Specifically, we identify an equivalent form of the dual problem that relates the dual LP with a sample average approximation to a stochastic program. Furthermore, we propose a new type of OLP algorithm, action-history-dependent learning algorithm, which improves the previous algorithm performances by taking into account the past input data and the past decisions/actions. We derive an [Formula: see text] regret bound (under a locally strong convexity and smoothness condition) for the proposed algorithm, against the [Formula: see text] bound for typical dual-price learning algorithms, where n is the number of decision variables. Numerical experiments demonstrate the effectiveness of the proposed algorithm and the action-history-dependent design.
科研通智能强力驱动
Strongly Powered by AbleSci AI