Optimization Online


Information Relaxations and Duality in Stochastic Dynamic Programs

David B. Brown (dbbrown***at***duke.edu)
James E. Smith (jes9***at***duke.edu)
Peng Sun (psun***at***duke.edu)

Abstract: We describe a dual approach to stochastic dynamic programming: we relax the constraint that the chosen policy must be temporally feasible and impose a penalty that punishes violations of temporal feasibility. We describe the theory underlying this dual approach and demonstrate its use in dynamic programming models related to inventory control, option pricing, and oil exploration.

Keywords: Dynamic programming

Category 1: Other Topics (Dynamic Programming )

Citation: Working paper, Fuqua School of Business, Duke University.


Entry Submitted: 03/03/2008
Entry Accepted: 03/10/2008
Entry Last Modified: 10/22/2009

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