A note: An improved upper bound for the online inventory problem with bounded storage and order costs

A note: An improved upper bound for the online inventory problem with bounded storage and order costs

0.00 Avg rating0 Votes
Article ID: iaor201530454
Volume: 249
Issue: 2
Start Page Number: 628
End Page Number: 630
Publication Date: Mar 2016
Journal: European Journal of Operational Research
Authors: , ,
Keywords: e-commerce, combinatorial optimization, programming: linear
Abstract:

This work gives an improved competitive analysis for an online inventory problem with bounded storage and order costs proposed by Larsen and Wøhlk (2010). We improve the upper bound of the competitive ratio from ( 2 + 1 k ) M m equ1to less than 4 5 ( 2 + 1 k ) M m , equ2where k, M and m are parameters of the given problem. The key idea is to use linear‐fractional programming and primal‐dual analysis methods to find the upper bound of a central inequality.

Reviews

Required fields are marked *. Your email address will not be published.