Pith. sign in

REVIEW 1 cited by

Online Inventory Management with Application to Energy Procurement in Data Centers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1901.04372 v1 pith:RGUC7N6M submitted 2019-01-14 cs.DS math.OC

classification cs.DSmath.OC
keywords inventoryenergypricedemandmanagementonlineassetscover
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Motivated by the application of energy storage management in electricity markets, this paper considers the problem of online linear programming with inventory management constraints. Specifically, a decision maker should satisfy some units of an asset as her demand, either form a market with time-varying price or from her own inventory. The decision maker is presented a price in slot-by-slot manner, and must immediately decide the purchased amount with the current price to cover the demand or to store in inventory for covering the future demand. The inventory has a limited capacity and its critical role is to buy and store assets at low price and use the stored assets to cover the demand at high price. The ultimate goal of the decision maker is to cover the demands while minimizing the cost of buying assets from the market. We propose BatMan, an online algorithm for simple inventory models, and BatManRate, an extended version for the case with rate constraints. Both BatMan and BatManRate achieve optimal competitive ratios, meaning that no other online algorithm can achieve a better theoretical guarantee. To illustrate the results, we use the proposed algorithms to design and evaluate energy procurement and storage management strategies for data centers with a portfolio of energy sources including the electric grid, local renewable generation, and energy storage systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint

    cs.GT 2025-02 conditional novelty 7.0 of 10

    Strictly satisfying the return-on-spend constraint in online auto-bidding forces linear regret; a near-optimal algorithm exists only for constant values and threshold auctions.

Pith tools