Solving a dynamic resource allocation problem through continuous optimization

DOI10.1109/TAC.2005.849254MaRDI QIDQ5274090zbMATH OpenFDO

Authors Yingdong Lu

Publication date 12 July 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2005.849254

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Nonlinear programming (90C30) Optimal stochastic control (93E20)

Cited in

(4)

• An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
• A Dynamic Planning Technique for Continuous Activities Under Multiple Resource Constraints
• Technical note: Optimizing foreclosed housing acquisitions in societal response to foreclosures
• Modelling and solving resource allocation problems via a dynamic programming approach

This page was built for publication: Solving a dynamic resource allocation problem through continuous optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5274090)