Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T23:20:59.237Z Has data issue: false hasContentIssue false

COMPETITIVE ANALYSIS OF INTERRELATED PRICE ONLINE INVENTORY PROBLEMS WITH DEMANDS

Published online by Cambridge University Press:  15 May 2017

SHUGUANG HAN*
Affiliation:
Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou 310018, China email dawn1024@zstu.edu.cn email hujlhz@163.com
JUELIANG HU
Affiliation:
Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou 310018, China email dawn1024@zstu.edu.cn email hujlhz@163.com
DIWEI ZHOU
Affiliation:
Department of Mathematical Sciences, Loughborough University, Loughborough LE11 3TU, UK email d.zhou2@lboro.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper investigates interrelated price online inventory problems, in which decisions as to when and how much of a product to replenish must be made in an online fashion to meet some demand even without a concrete knowledge of future prices. The objective of the decision maker is to minimize the total cost while meeting the demands. Two different types of demand are considered carefully, that is, demands which are linearly and exponentially related to price. In this paper, the prices are online, with only the price range variation known in advance, and are interrelated with the preceding price. Two models of price correlation are investigated, namely, an exponential model and a logarithmic model. The corresponding algorithms of the problems are developed, and the competitive ratios of the algorithms are derived as the solutions by use of linear programming.

MSC classification

Information

Type
Research Article
Copyright
© 2017 Australian Mathematical Society