Optimal portfolio choice under a liability constraint

Leszek Zaremba and Włodzimierz Smoleński

Annals of Operations Research, 2000, vol. 97, issue 1, 141 pages

Abstract: The problem of characterizing the least expensive bond portfolio that enables one to meet his/her liability to pay C dollars K years from now is dealt with in this article. Bond prices are allowed to be either overpriced or underpriced at the purchase time, while at the sale time the bonds are suppose to be fairly priced. Assuming shifts in spot rates to occur instantly after the acquisition of a bond portfolio Z and to follow fairly general type of behavior described by the condition (2), we give both necessary and sufficient conditions for Z to solve the immunization problem above. Our model is general enough to cover situations with twists in the yield curve. Making use of the K-T conditions, we explain in remark 7 why we focus on search of an optimal portfolio in the class of barbell strategies. Finally, by means of the K-T conditions we find an optimal bond portfolio which solves the immunization problem. Copyright Kluwer Academic Publishers 2000

Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018996712442 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:97:y:2000:i:1:p:131-141:10.1023/a:1018996712442

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018996712442

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().