Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Mathematical Methods...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Mathematical Methods of Operations Research
Article . 1986 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 1986
Data sources: zbMATH Open
DBLP
Article . 1986
Data sources: DBLP
https://dx.doi.org/10.1007/bf0...
Other literature type
Data sources: Microsoft Academic Graph
https://dx.doi.org/10.1007/bf0...
Other literature type
Data sources: Microsoft Academic Graph
 View all 3 versions
Claim

Bounds for the approximation of dynamic programs

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 01 Jan 1986 English Publisher:Springer Science and Business Media LLCJournal:Zeitschrift für Operations Research, volume 30, pages A65-A77 (issn: 0340-9422, eissn: 1432-5217, Copyright policy )
Authors: Harald Benzing;

doi: 10.1007/bf01918632

Bounds for the approximation of dynamic programs

Abstract

Summary: We consider a general finite stage dynamic programming model. Bounds are derived for the approximation of the minimum expected total cost and of the optimal policy. The theory is applied to an inventory model to give bounds for ''good'' order policies.

Related Organizations
Keywords

inventory, Applications of mathematical programming, Bounds, (s,S)-policies, finite stage dynamic programming, Inventory, storage, reservoirs, optimal policy, Dynamic programming, approximation of the minimum expected total cost

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!
uploadUpload now