A MODEL FOR DESIGNING CALLABLE BONDS AND ITS SOLUTION USING TABU SEARCH

We formulate the problem of designing callable bonds as a non-linear, global, optimization problem. The data of the model are obtained from simulations of holding-period returns of a given bond design, which ar e used to compute a certainty equivalent return, viz., some target ass ets. The design specifications of the callable bond are then adjusted so that the certainty equivalent return is maximized. The resulting pr oblem is multi-modal, and a tabu search procedure, implemented on a di stributed network of workstations, is used to optimize the bond design . The model is compared with the classical portfolio immunization mode l, and the tabu search solution technique is compared with simulated a nnealing for solving the global optimization program. It is shown that the global optimization model yields higher returns than portfolio im munization. It is also shown that tabu search is computationally more efficient than simulated annealing in solving the model, and it produc es better solutions.