A Dynamic Near-Optimal Algorithm for Online Linear Programming

Shipra Agrawal (), Zizhuo Wang () and Yinyu Ye ()
Additional contact information
Shipra Agrawal: Microsoft Research India, Bangalore, India
Zizhuo Wang: Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, Minnesota 55455
Yinyu Ye: Department of Management Science and Engineering, Stanford University, Stanford, California 94305

Operations Research, 2014, vol. 62, issue 4, 876-890

Abstract: A natural optimization model that formulates many online resource allocation problems is the online linear programming (LP) problem in which the constraint matrix is revealed column by column along with the corresponding objective coefficient. In such a model, a decision variable has to be set each time a column is revealed without observing the future inputs, and the goal is to maximize the overall objective function. In this paper, we propose a near-optimal algorithm for this general class of online problems under the assumptions of random order of arrival and some mild conditions on the size of the LP right-hand-side input. Specifically, our learning-based algorithm works by dynamically updating a threshold price vector at geometric time intervals, where the dual prices learned from the revealed columns in the previous period are used to determine the sequential decisions in the current period. Through dynamic learning, the competitiveness of our algorithm improves over the past study of the same problem. We also present a worst case example showing that the performance of our algorithm is near optimal.

Keywords: online algorithms; linear programming; primal-dual; dynamic price update (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2014.1289 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:62:y:2014:i:4:p:876-890

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().