Simple and Fast Algorithm for Binary Integer and Online Linear Programming

03/05/2020
by   Xiaocheng Li, et al.
0

In this paper, we develop a simple and fast online algorithm for solving a general class of binary integer linear programs (LPs). The algorithm requires only one single pass through the input data and is free of doing any matrix inversion. It can be viewed as both an approximate algorithm for solving binary integer LPs and a fast algorithm for solving online LP problems. The algorithm is inspired by an equivalent form of the dual problem of the relaxed LP and it essentially performs projected stochastic subgradient descent in the dual space. We analyze the algorithm in two different models, stochastic input model and random permutation model, with minimal assumptions on the input of the LP. The algorithm achieves O(m^2 √(n)) expected regret under the stochastic input model and O((m^2+log n)√(n)) expected regret under the random permutation model, and it achieves O(m √(n)) expected constraint violation under both models, where n is the number of decision variables and m is the number of constraints. Furthermore, the algorithm is generalized to a multi-dimensional LP setting which covers a wider range of applications and features for the same performance guarantee. Numerical experiments illustrate the general applicability and the performance of the algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2019

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds

We study an online linear programming (OLP) problem under a random input...
research
07/08/2021

Boosting Method in Approximately Solving Linear Programming with Fast Online Algorithm

In this paper, we develop a new algorithm combining the idea of “boostin...
research
11/08/2022

A Simple Algorithm for Online Decision Making

Motivated by recent progress on online linear programming (OLP), we stud...
research
03/06/2023

An Online Algorithm for Chance Constrained Resource Allocation

This paper studies the online stochastic resource allocation problem (RA...
research
09/10/2020

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based fra...
research
05/05/2020

Online Convex Optimization with Binary Constraints

We consider online optimization with binary decision variables and conve...
research
11/13/2020

Secretaries with Advice

The secretary problem is probably the purest model of decision making un...

Please sign up or login with your details

Forgot password? Click here to reset