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

1977 ◽  
Vol 12 (4) ◽  
pp. 629-629
Author(s):  
William R. Folks

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.

Author(s):  
Sergey Ivanovich Makarov ◽  
◽  
Maria Vladimirovna Kurganova ◽  

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.


2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
YiHua Zhong ◽  
ShiMing Luo ◽  
Min Bao ◽  
XiaoDie Lv

When designing the underground logistics system, it is necessary to consider the uncertainty of logistics nodes, high cost, and high risk. This paper employed the theories of uncertain graph and dynamic programming to solve the network planning problem of underground logistics system. Firstly, we proposed the concepts of uncertainty measure matrix and vertices structure uncertainty graph by using uncertainty measure and uncertainty graph. Secondly, vertices structure uncertainty graph of the underground logistics system was constructed based on our proposed vertices structure uncertainty graph and the uncertainty of logistics nodes. Thirdly, the dynamic programming model of the underground logistics system was established, and its solution algorithm was also designed by improving simulated annealing. Finally, the correctness and feasibility of the method was validated by using a numerical example of the underground logistics system in Xianlin district, Nanjing City in China.


Sign in / Sign up

Export Citation Format

Share Document