A Dynamic Near-Optimal Algorithm for Online Linear Programming II: A Lower Bound for Every Online AlgorithmResearch Paper
Online linear programming models resource allocation under uncertainty about future demand: requests arrive one at a time, each asking for some amounts of resources and offering a payment, and each must be accepted or rejected, irrevocably, on arrival. Airline seat and hotel room revenue management, online routing with bandwidth limits and the allocation…