Optimization Online


Computing robust basestock levels

Daniel Bienstock (dano***at***columbia.edu)
Nuri Ozbay (nso2001***at***columbia.edu)

Abstract: This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decomposition that scale well to problems with hundreds of time periods, and theoretical results on more general models.

Keywords: robust optimization, supply chain

Category 1: Applications -- OR and Management Sciences

Citation: CORC report TR-2005-09, Columbia University, November 2005

Download: [PDF]

Entry Submitted: 01/23/2006
Entry Accepted: 01/24/2006
Entry Last Modified: 01/23/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society