Efficient Computational Strategies for Dynamic Inventory Liquidation

Published Online:https://doi.org/10.1287/isre.2018.0819

References

  • Araman VF, Caldentey R (2009) Dynamic pricing for nonperishable products with demand learning. Oper. Res. 57(5):1169–1188.LinkGoogle Scholar
  • Aviv Y, Pazgal A (2002) Pricing of short life-cycle products through active learning. Accessed January 21, 2019, https://pdfs.semanticscholar.org/6173/90fd39f1b4286aa5314b207e042c490a6d4f.pdf.Google Scholar
  • Aviv Y, Pazgal A (2008) Optimal pricing of seasonal products in the presence of forward-looking consumers. Manufacturing Service Oper. Management 10(3):339–359.LinkGoogle Scholar
  • Bapna R, Chang SA, Goes P, Gupta A (2009) Overlapping online auctions: Empirical characterization of bidder strategies and auction prices. MIS Quart. 33(4):763–783.CrossrefGoogle Scholar
  • Bapna R, Goes P, Gupta A (2003) Analysis and design of business-to-consumer online auctions. Management Sci. 49(1):85–101.LinkGoogle Scholar
  • Bapna R, Goes P, Gupta A (2005) Pricing and allocation for quality-differentiated online services. Management Sci. 51(7):1141–1150.LinkGoogle Scholar
  • Bapna R, Goes P, Gupta A, Karuga G (2002) Optimal design of the online auction channel: Analytical, empirical, and computational insights. Decision Sci. 33(4):557–578.CrossrefGoogle Scholar
  • Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manufacturing Service Oper. Management 5(3):203–229.LinkGoogle Scholar
  • Bitran G, Mondschein S (1997) Periodic pricing of seasonal products in retailing. Management Sci. 43(1):64–79.LinkGoogle Scholar
  • Bitran G, Caldentey R, Mondschein S (1998) Coordinating clearance markdown sales of seasonal products in retail chains. Oper. Res. 46(5):609–624.LinkGoogle Scholar
  • Craig NC, Raman A (2015) Improving store liquidation. Manufacturing Service Oper. Management 18(1):89–103.Google Scholar
  • Elmaghraby W, Keskinocak P (2003) Dynamic pricing in the presence of inventory considerations: Research overview, current practices, and future directions. Management Sci. 49(10):1287–1309.LinkGoogle Scholar
  • Farias DP, Van Roy B (2003) The linear programming approach to approximate dynamic programming. Oper. Res. 51(6):850–865.LinkGoogle Scholar
  • Farias VF, Van Roy B (2010) Dynamic pricing with a prior on market response. Oper. Res. 58(1):16–29.LinkGoogle Scholar
  • Gallego G, Van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.LinkGoogle Scholar
  • Hevner AR, March ST, Park J, Ram S (2004) Design science in information systems research. MIS Quart. 28(1):75–105.CrossrefGoogle Scholar
  • McAfee RP, McMillan J (1987) Auctions and bidding. J. Econom. Literature 25(2):699–738.Google Scholar
  • McGill JI, Van Ryzin GJ (1999) Revenue management: Research overview and prospects. Transportation Sci. 33(2):233–256.LinkGoogle Scholar
  • Pearson K (1902) Note on Francis Galton’s problem. Biometrika 1(4):390–399.Google Scholar
  • Smith SAS, Achabal DDD (1998) Clearance pricing and inventory policies for retail chains. Management Sci. 44(3):285–300.LinkGoogle Scholar
  • Su X (2007) Intertemporal pricing with strategic customer behavior. Management Sci. 53(5):726–741.LinkGoogle Scholar
  • Topaloglu H, Kunnumkal S (2006) Approximate dynamic programming methods for an inventory allocation problem under uncertainty. Naval Res. Logist. 53(8):822–841.CrossrefGoogle Scholar
  • Wood C, Alford B, Jackson R, Gilley O (2005) Can retailers get higher prices for ‘end-of-life’ inventory through online auctions? J. Retailing 81(3):181–190.CrossrefGoogle Scholar
  • Zhao W, Zheng YS (2000) Optimal dynamic pricing for perishable assets with nonhomogeneous demand. Management Sci. 46(3):375–388.LinkGoogle Scholar
  • Zhu C, Byrd RH, Lu P, Nocedal J (1997) Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Software 23(4):550–560.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.