東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Dynamic Cash Management Models.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Dynamic Cash Management Models./
Author:	Zhang, Zimian.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
Description:	154 p.
Notes:	Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
Contained By:	Dissertations Abstracts International83-11B.
Subject:	Dynamic programming. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29073432
ISBN:	9798426872240

Dynamic Cash Management Models.
Zhang, Zimian.

Dynamic Cash Management Models. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 154 p.

Source: Dissertations Abstracts International, Volume: 83-11, Section: B.

Thesis (Ph.D.)--Lancaster University (United Kingdom), 2021.

This item must not be sold to any third party vendors.

Classical cash management models concern how an organisation should maintain their (liquid) cash balances in order to meet cash demands over time. In these models the balance can be increased or decreased to offset penalties for not being able to meet a cash demand or the opportunity cost of holding too much cash, respectively. The external source from which this money comes from or is sent to is not explicitly modelled but is assumed to be available at all times. In this thesis we contribute to the cash management problem by discussing three novel cash management models.To begin with, we include a second asset to the cash management model and assume the cash inflows are generated from this asset. We formulate this problem as a discrete Markov decision process (MDP) and solve it by the classic backward iteration method. We show that the optimal cash policy for this model possesses the two-threshold two-target form. Moreover we observe that the agent should take a 'safer' cash policy when the company has a balanced cash inflows and outflows.Then we introduce loan opportunities to the model. In this problem, we allow the agent taking loans from financial intermediates. We assume there is one type of unsecured loan with fixed interest rate and the manager can take this loan repeatedly once his previous debt is paid off. We also solve this model via the discrete MDP approach. Moreover we propose a heuristic for this problem based on the policy improvement which is shown to perform strongly in our experiments.At last, we consider an agent managing a cash account and a number of as- sets accounts. Hence both cash policies and asset allocation policies are studied simultaneously. Moreover we assume the agent wishes to pursuit the net profits while controlling the risk associated with his management strategies. We solve this model using a separable Piecewise linear approximate dynamic programming approach. We also provide a heuristic based on the myopic greedy algorithm and the discrete MDP approach as benchmarks. The numerical experiments show that the PWL ADP outperforms the heuristic in terms of objective values and takes significantly less solution time comparing with the discrete MDP.

ISBN: 9798426872240Subjects--Topical Terms:

641303
Dynamic programming.

Dynamic Cash Management Models.
LDR:03299nmm a2200361 4500 001 2350093
005 20221020123853.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798426872240
035 $a (MiAaPQ)AAI29073432
035 $a (MiAaPQ)Lancaster_164461
035 $a AAI29073432
040 $a MiAaPQ $c MiAaPQ
100 1 $a Zhang, Zimian. $3 3689542
245 1 0 $a Dynamic Cash Management Models.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 154 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-11, Section: B.
500 $a Advisor: Kirkbride, Christopher.
502 $a Thesis (Ph.D.)--Lancaster University (United Kingdom), 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Classical cash management models concern how an organisation should maintain their (liquid) cash balances in order to meet cash demands over time. In these models the balance can be increased or decreased to offset penalties for not being able to meet a cash demand or the opportunity cost of holding too much cash, respectively. The external source from which this money comes from or is sent to is not explicitly modelled but is assumed to be available at all times. In this thesis we contribute to the cash management problem by discussing three novel cash management models.To begin with, we include a second asset to the cash management model and assume the cash inflows are generated from this asset. We formulate this problem as a discrete Markov decision process (MDP) and solve it by the classic backward iteration method. We show that the optimal cash policy for this model possesses the two-threshold two-target form. Moreover we observe that the agent should take a 'safer' cash policy when the company has a balanced cash inflows and outflows.Then we introduce loan opportunities to the model. In this problem, we allow the agent taking loans from financial intermediates. We assume there is one type of unsecured loan with fixed interest rate and the manager can take this loan repeatedly once his previous debt is paid off. We also solve this model via the discrete MDP approach. Moreover we propose a heuristic for this problem based on the policy improvement which is shown to perform strongly in our experiments.At last, we consider an agent managing a cash account and a number of as- sets accounts. Hence both cash policies and asset allocation policies are studied simultaneously. Moreover we assume the agent wishes to pursuit the net profits while controlling the risk associated with his management strategies. We solve this model using a separable Piecewise linear approximate dynamic programming approach. We also provide a heuristic based on the myopic greedy algorithm and the discrete MDP approach as benchmarks. The numerical experiments show that the PWL ADP outperforms the heuristic in terms of objective values and takes significantly less solution time comparing with the discrete MDP.
590 $a School code: 0416.
650 4 $a Dynamic programming. $3 641303
650 4 $a Fines & penalties. $3 3560680
650 4 $a Probability. $3 518898
650 4 $a Algorithms. $3 536374
650 4 $a Markov analysis. $3 3562906
650 4 $a Computer science. $3 523869
650 4 $a Finance. $3 542899
650 4 $a Mathematics. $3 515831
650 4 $a Operations research. $3 547123
690 $a 0272
690 $a 0984
690 $a 0508
690 $a 0454
690 $a 0405
690 $a 0796
710 2 $a Lancaster University (United Kingdom). $3 1294170
773 0 $t Dissertations Abstracts International $g 83-11B.
790 $a 0416
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29073432