Optimal Coupon Schedules for Municipal Bonds
Kalman J. Cohen and
Frederick S. Hammer
Additional contact information
Kalman J. Cohen: Carnegie Institute of Technology
Frederick S. Hammer: Bankers Trust Company, New York City
Management Science, 1965, vol. 12, issue 1, 68-82
Abstract:
When an underwriting syndicate submits a bid for a new issue of municipal bonds, one of the important decisions that it must make involves the scheduling of interest coupons to be placed on the bonds. Given the bid specifications stated by the issuing municipality and some prior decisions of the underwriters, it is shown that the determination of the optimal coupon schedule can be expressed as a linear programming problem. Since this LP problem has a special structure, a simple computational algorithm requiring less computation than the simplex method is derived. This paper goes beyond previous contributions to the literature in three important ways. First, simple formulas for obtaining the dual evaluators are developed; the marginal effect of shifts in the yield curve is also presented. Second, it is shown that in the non-integer year case both the conclusions of previous writers and the conventional heuristics of the market may be erroneous, whereas the general solution techniques developed in this paper remain valid. Finally, a direct analogy between the coupon schedule problem and the microeconomic theory of the firm is used in obtaining the special computational algorithm for this LP problem.
Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.1.68 (application/pdf)
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:inm:ormnsc:v:12:y:1965:i:1:p:68-82
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().