Solving a dynamic resource allocation problem through continuous optimization

A class of dynamic resource allocation problems with infinite planning horizon are studied. We observe special structures in the dynamic programming formulation of the problem, which enable us to convert it to continuous optimization problems that can be more easily solved. Structural properties of the problems are discussed, and explicit solutions are given for some special cases.

[1]  W. P. Dayawansa,et al.  Asymptotic stabilization of a class of smooth two-dimensional systems , 1990 .

[2]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem , 1998, Oper. Res..

[3]  Mihail Zervos,et al.  A Problem of Singular Stochastic Control with Discretionary Stopping , 1994 .

[4]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

[5]  I. Karatzas,et al.  A leavable bounded-velocity stochastic control problem , 2002 .

[6]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem with Random Sized Items , 2001, Oper. Res..

[7]  G. Prastacos.  Optimal Sequential Investment Decisions Under Conditions of Uncertainty , 1983 .

[8]  I. Karatzas,et al.  Finite-Fuel Singular Control With Discretionary Stopping , 2000 .

[9]  Wenjiao Zhao,et al.  Optimal Dynamic Pricing for Perishable Assets with Nonhomogeneous Demand , 2000 .

[10]  Jie Huang,et al.  On an output feedback finite-time stabilization problem , 2001, IEEE Trans. Autom. Control..

[11]  J. Papastavrou,et al.  The Dynamic and Stochastic Knapsack Problem with Deadlines , 1996 .

[12]  Baichun Xiao,et al.  Optimal Policies of Yield Management with Multiple Predetermined Prices , 2000, Oper. Res..

[13]  Richard Van Slyke,et al.  Finite Horizon Stochastic Knapsacks with Applications to Yield Management , 2000, Oper. Res..

[14]  G. Gallego,et al.  Optimal starting times for end-of-season sales and optimal stopping times for promotional fares , 1995 .