مطالب مرتبط با کلیدواژه

Dynamic Programming


۱.

Properties of Optimal Consumption under Liquidity Constraints: New Results by Control Theoretic Approach(مقاله علمی وزارت علوم)

نویسنده:

کلیدواژه‌ها: Optimal Control Maximum Principle Dynamic Programming Consumption Liquidity Constraints

حوزه های تخصصی:
تعداد بازدید : ۱۵۶۱ تعداد دانلود : ۷۶۱
Optimality conditions for consumption behavior with liquidity constraints are obtained using the functional recurrence equation in Bellman’s dynamic programming and the generalized Hamiltonian function in Pontryagin’s maximum principle. The rejection of Hall’s random walk hypothesis is then established for liquidity constrained consumers. An explicit mathematical relation is formulated which demonstrates the effects of liquidity constraints on consumption, which implies that under certain conditions the liquidity constraint may shift the optimal consumption profile forward even when the rate of time preference exceeds the interest rate. Our analysis is further developed to time-varying interest rates. Using the Kuhn-Tucker conditions, we have shown the interactions between the time-varying interest rate, the utility discount rate and the severity of liquidity constraints. It is shown, using the coefficient of absolute risk aversion, that how the time-varying interest rate may affect optimal consumption through intertemporal elasticity of substitution. Simultaneous effects of the pure preference parameters, interest rates variations and the liquidity constraints on optimal consumption path are mathematically formulated. Limitations in optimal control applications in modeling optimal consumption with liquidity constraints in a stochastic environment are briefly examined.
۲.

Dynamic Programming for Multi-Crew Scheduling of the Emergency Repair of Network(مقاله علمی وزارت علوم)

کلیدواژه‌ها: Network Repair Repair Crew Scheduling Dynamic Programming Multi-Crew Planning

حوزه های تخصصی:
تعداد بازدید : ۲۶۹ تعداد دانلود : ۱۷۶
One of the most necessary operations in humanitarian logistics is the distribution of relief goods to the population in disaster areas. When a disaster occurs, some parts of the distribution infrastructure may be damaged and consequently make it impossible to reach all the demand nodes and delivering the relief goods. In this study, we focus on the planning of infrastructure recovery efforts in post-disaster response. The problem is the scheduling of the emergency repair of a network that has been damaged by a disaster. The objective is to maximize network accessibility for all demand nodes in order to deliver relief goods to them. We adopt a dynamic programming algorithm to solve the problem when more than one crew group is available. Our numerical analysis of the solution shows the performance of the algorithm. We, also, compare our results with some similar studies to indicate the differences between one and multi-crew scheduling.
۳.

Optimal Portfolio Allocation with Price Limit Constraint(مقاله علمی وزارت علوم)

کلیدواژه‌ها: Optimal portfolio limited prices Dynamic Programming

حوزه های تخصصی:
تعداد بازدید : ۲۸۴ تعداد دانلود : ۲۴۴
Daily price limits are adopted by many securities exchanges in countries such as the USA, Canada, Japan and various other countries in Europe and Asia, in order to increase the stability of the financial market. These limits confine the price of the financial asset during all trading stages of any trading day to a range, usually determined based on the previous day’s closing price. In this paper we study the portfolio optimization problem with impose the price limit constraint. The dynamic programming technique is applied to derive the Hamilton–Jacobi–Bellman equation and the method of Lagrange multiplier is used to tackle the constraint. Optimization problem solution results, using numerical method show that the equilibrium path of wealth and investment in risky assets has a different way than in the absence of price limits.