THE CALCULATION OF THE LIFETIME OF THE EQUIPMENT WITH APPLICATION OF DYNAMIC PROGRAMMING

2020 ◽  
Author(s):  
Sergey Ivanovich Makarov ◽  
◽  
Maria Vladimirovna Kurganova ◽  
Keyword(s):  
Dynamic Programming ◽  
Economic Analysis ◽  
Programming Problem ◽  
Calculation Methods ◽  
Optimal Operating ◽  
Operating Period ◽  
Equipment Replacement ◽  
Dynamic Programming Problem ◽  
Replacement Time

The dynamic programming problem for finding the optimal operating period and equipment replacement time using a combination of graphical and calculation methods of economic analysis is considered.

scholarly journals A Stochastic Dynamic Programming Approach Based on Bounded Rationality and Application to Dynamic Portfolio Choice

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Wenjie Bi ◽  
Liuqing Tian ◽  
Haiying Liu ◽  
Xiaohong Chen
Keyword(s):  
Dynamic Programming ◽  
Interest Rate ◽  
Bounded Rationality ◽  
Programming Problem ◽  
Stochastic Volatility ◽  
Portfolio Choice ◽  
Programming Approach ◽  
Dynamic Programming Problem ◽  
Dynamic Portfolio ◽  
Dynamic Portfolio Choice

Dynamic portfolio choice is an important problem in finance, but the optimal strategy analysis is difficult when considering multiple stochastic volatility variables such as the stock price, interest rate, and income. Besides, recent research in experimental economics indicates that the agent shows limited attention, considering only the variables with high fluctuations but ignoring those with small ones. By extending the sparse max method, we propose an approach to solve dynamic programming problem with small stochastic volatility and the agent’s bounded rationality. This approach considers the agent’s behavioral factors and avoids effectively the “Curse of Dimensionality” in a dynamic programming problem with more than a few state variables. We then apply it to Merton dynamic portfolio choice model with stochastic volatility and get a tractable solution. Finally, the numerical analysis shows that the bounded rational agent may pay no attention to the varying equity premium and interest rate with small variance.

Abstract: Characterizations of Exchange Convertibility Schemes: A Structure for Analysis

1977 ◽  
Vol 12 (4) ◽  
pp. 629-629
Author(s):  
William R. Folks
Keyword(s):  
Dynamic Programming ◽  
Programming Problem ◽  
Programming Model ◽  
Decision Problems ◽  
Return Function ◽  
Dynamic Programming Problem ◽  
Dynamic Programming Model ◽  
Set Function ◽  
Modest Reduction

This paper extends the results of previous work by the author in the development of a structure for analysis of rather general two-currency decision problems using an nstage dynamic programming model. After a brief review of the model, the paper provides a characterization of a convertibility scheme as a set function which assigns to each currency portfolio a set of currency portfolios which can be attained from the original portfolio, operating through the convertibility scheme. The concept of a substitutable convertibility scheme is developed; the substitutability property allows the decision maker to substitute a functionally determined single currecy payoff for a given twocurrency payoff. Two tests to determine substitutability in general, and for a particular return function, are developed. The modest reduction in dimensionality of the dynamic programming problem arising from this property is explained. Some specific convertibility schemes are then characterized, including free convertibility, inconvertibility, retention quotas, maximum balance, maximum acquisition, and multiple rate schemes. The substitutability of free convertibility is demonstrated. A retention quota scheme which allows free sale and purchase of retained funds in a parallel market is shown to be equivalent to a free convertibility scheme, and therefore substitutable.

Sign in / Sign up

Export Citation Format

Share Document