Markdown Optimization via Approximate Dynamic Programming

Kula, Ufuk

DSpace Home
→
Fakülteler / Faculties
→
Mühendislik Fakültesi
→
Endüstri Mühendisliği / Industrial Engineering
→
Makale Koleksiyonu
→
View Item

dc.contributor.authors	Cosgun, O; Kula, U; Kahraman, C;
dc.date.accessioned	2020-02-25T11:40:41Z
dc.date.available	2020-02-25T11:40:41Z
dc.date.issued	2013
dc.identifier.citation	Cosgun, O; Kula, U; Kahraman, C; (2013). Markdown Optimization via Approximate Dynamic Programming. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 6, 78-64
dc.identifier.issn	1875-6891
dc.identifier.uri	https://doi.org/10.1080/18756891.2013.754181
dc.identifier.uri	https://hdl.handle.net/20.500.12619/48119
dc.description.abstract	We consider the markdown optimization problem faced by the leading apparel retail chain. Because of substitution among products the markdown policy of one product affects the sales of other products. Therefore, markdown policies for product groups having a significant crossprice elasticity among each other should be jointly determined. Since the state space of the problem is very huge, we use Approximate Dynamic Programming. Finally, we provide insights on the behavior of how each product price affects the markdown policy.
dc.language	English
dc.publisher	ATLANTIS PRESS
dc.subject	Computer Science
dc.title	Markdown Optimization via Approximate Dynamic Programming
dc.type	Article
dc.identifier.volume	6
dc.identifier.startpage	64
dc.identifier.endpage	78
dc.contributor.department	Sakarya Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü
dc.contributor.saüauthor	Kula, Ufuk
dc.relation.journal	INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS
dc.identifier.wos	WOS:000313101300006
dc.identifier.doi	10.1080/18756891.2013.754181
dc.identifier.eissn	1875-6883
dc.contributor.author	Kula, Ufuk