Numerical Algorithms for Deterministic Impulse Control Models with Applications
AbstractAbstract: In this paper we describe three different algorithms, from which two (as far as we know) are new in the literature. We take both the size of the jump as the jump times as decision variables. The first (new) algorithm considers an Impulse Control problem as a (multipoint) Boundary Value Problem and uses a continuation technique to solve it. The second (new) approach is the continuation algorithm that requires the canonical system to be solved explicitly. This reduces the infinite dimensional problem to a finite dimensional system of, in general, nonlinear equations, without discretizing the problem. Finally, we present a gradient algorithm, where we reformulate the problem as a finite dimensional problem, which can be solved using some standard optimization techniques. As an application we solve a forest management problem and a dike heightening problem. We numerically compare the efficiency of our methods to other approaches, such as dynamic programming, backward algorithm and value function approach.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2012-081.
Date of creation: 2012
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
Impulse ControlMaximum Principle; Optimal Control; BVP; gradient method; continuation;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- D90 - Microeconomics - - Intertemporal Choice - - - General
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Katrin Erdlenbruch & Alain Jean-Marie & Michel Moreaux & Mabel Tidball, 2010.
"Optimality of Impulse Harvesting Policies,"
- Katrin Erdlenbruch & Alain Jean-Marie & Michel MOREAUX & Mabel Tidball, 2010. "Optimality of Impulse Harvesting Policies," LERNA Working Papers 10.09.315, LERNA, University of Toulouse.
- Erdlenbruch, Katrin & Jean-Marie, Alain & Moreaux, Michel & Tidball, Mabel, 2010. "Optimality of Impulse Harvesting Policies," IDEI Working Papers 603, Institut d'Économie Industrielle (IDEI), Toulouse.
- Erdlenbruch, Katrin & Jean-Marie, Alain & Moreaux, Michel & Tidball, Mabel, 2010. "Optimality of Impulse Harvesting Policies," TSE Working Papers 09-150, Toulouse School of Economics (TSE).
- Chahim, Mohammed & Hartl, Richard F. & Kort, Peter M., 2012. "A tutorial on the deterministic Impulse Control Maximum Principle: Necessary and sufficient optimality conditions," European Journal of Operational Research, Elsevier, vol. 219(1), pages 18-26.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.