Brownian Inventory Models with Convex Holding Cost, Part 2: Discount-Optimal Controls
Published Online:25 Apr 2013https://doi.org/10.1287/11-SSY046
References
- (2002). Optimal impulse control for cash management with quadratic holding-penalty costs. Decisions in Economics and Finance 25 19–32. MR1961219Google Scholar
- (1974/75). Nouvelles méthodes en contrôle impulsionnel. Applied Mathematics and Optimization 1 289–312. MR0390886Google Scholar
- (1984). Impulse control and quasivariational inequalities. Gauthier-Villars, Montrouge. Translated from the French by . MR0756234Google Scholar
- (1990). Kinked Adjustment Costs and Aggregate Dynamics. MIT Press, 237–296.Google Scholar
- (1978). Existence of optimal simple policies for discounted-cost inventory and cash management in continous time. Operations Research 26 620–636. MR0496558Link, Google Scholar
- (2013). Brownian inventory models with convex holding cost, part 1: average-optimal controls. Stochastic Systems 3(2) 442–499.Link, Google Scholar
- (2010). A computational method for stochastic impulse control problems. Mathematics of Operations Research 35 830–850. MR2777517Link, Google Scholar
- (1983). Impulse control of Brownian motion. Mathematics of Operations Research 8 454–466. MR0716124Link, Google Scholar
- (1983). Instantaneous control of Brownian motion. Mathematics of Operations Research 8 439–453. MR0716123Link, Google Scholar
- (2005). The optimality of a control band policy. Review of Economic Dyanmics 8 877–901.Google Scholar
- (2005). Stochastic Integration and Differential Equations. Stochastic Modelling and Applied Probability, Vol. 21. Springer-Verlag, Berlin. Second edition. Version 2.1, Corrected third printing. MR2273672Google Scholar
- (1977). Optimal impulse control of a diffusion process with both fixed and proportional costs of control. SIAM Journal on Control and Optimization 15 79–91. MR0490377Google Scholar
- (1997). Infinite dimensional linear programming approach to singular stochastic control problems. SIAM Journal on Control and Optimization 35 604–625. MR1436641Google Scholar

