IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v47y1999i2p195-208.html
   My bibliography  Save this article

Designing Portfolios of Financial Products via Integrated Simulation and Optimization Models

Author

Listed:
  • Andrea Consiglio

    (University of Calabria, Italy)

  • Stavros A. Zenios

    (University of Cyprus, Nicosia, Cyprus)

Abstract

We analyze the problem of debt issuance through the sale of innovative financial products. The problem is broken down to questions of designing the financial products, specifying the debt structure with the amount issued in each product, and determining an optimal level of financial leverage . We formulate a hierarchical optimization model to integrate these three issues and provide constructive answers. Input data for the models are obtained from Monte Carlo simulation procedures that generate scenarios of holding period returns of the designed products.The hierarchical optimization model is specialized for the problem of issuing a portfolio of callable bonds to fund mortgage assets. The upper level optimization program is multimodal, and a tabu search procedure is developed for its solution. Empirical results illustrate the efficacy of the developed models in designing the appropriate structure of the callable bonds and making optimal allocations of equity and debt among the designed products. Computational results with the implementation of tabu search—on both serial and parallel computers—are also presented.

Suggested Citation

  • Andrea Consiglio & Stavros A. Zenios, 1999. "Designing Portfolios of Financial Products via Integrated Simulation and Optimization Models," Operations Research, INFORMS, vol. 47(2), pages 195-208, April.
    • Handle: RePEc:inm:oropre:v:47:y:1999:i:2:p:195-208
    DOI: 10.1287/opre.47.2.195
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.47.2.195
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.47.2.195?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Miller, Merton H., 1986. "Financial Innovation: The Last Twenty Years and the Next," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 21(4), pages 459-471, December.
    2. Stephen A. Ross, 1989. "Institutional Markets, Financial Marketing, and Financial Innovation," Journal of Finance, American Finance Association, vol. 44(3), pages 541-556, July.
    3. David R. Cariño & Terry Kent & David H. Myers & Celine Stacy & Mike Sylvanus & Andrew L. Turner & Kouji Watanabe & William T. Ziemba, 1994. "The Russell-Yasuda Kasai Model: An Asset/Liability Model for a Japanese Insurance Company Using Multistage Stochastic Programming," Interfaces, INFORMS, vol. 24(1), pages 29-49, February.
    4. repec:bla:jfinan:v:44:y:1989:i:3:p:541-56 is not listed on IDEAS
    5. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    6. John M. Mulvey & Stavros A. Zenios, 1994. "Capturing the Correlations of Fixed-income Instruments," Management Science, INFORMS, vol. 40(10), pages 1329-1342, October.
    7. Consiglio, Andrea & Zenios, Stavros A., 1997. "A model for designing callable bonds and its solution using tabu search," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1445-1470, June.
    8. Martin R. Holmer & Stavros A. Zenios, 1995. "The Productivity of Financial Intermediation and the Technology of Financial Product Management," Operations Research, INFORMS, vol. 43(6), pages 970-982, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andrea Consiglio & Alessandro Staino, 2012. "A stochastic programming model for the optimal issuance of government bonds," Annals of Operations Research, Springer, vol. 193(1), pages 159-172, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Consiglio, Andrea & Zenios, Stavros A., 1997. "A model for designing callable bonds and its solution using tabu search," Journal of Economic Dynamics and Control, Elsevier, vol. 21(8-9), pages 1445-1470, June.
    2. Andrea Beltratti & Andrea Consiglio & Stavros Zenios, 1999. "Scenario modeling for the management ofinternational bond portfolios," Annals of Operations Research, Springer, vol. 85(0), pages 227-247, January.
    3. Amy V. Puelz, 2002. "A Stochastic Convergence Model for Portfolio Selection," Operations Research, INFORMS, vol. 50(3), pages 462-476, June.
    4. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    5. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2021. "A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean," Applied Mathematics and Computation, Elsevier, vol. 389(C).
    6. Tamer Khraisha & Keren Arthur, 2018. "Can we have a general theory of financial innovation processes? A conceptual review," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 4(1), pages 1-27, December.
    7. Thibaud Deguilhem & Juliette Schlegel & Jean-Philippe Berrou & Ousmane Djibo & Alain Piveteau, 2024. "Too many options: How to identify coalitions in a policy network?," Post-Print hal-04689665, HAL.
    8. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    9. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    10. An Yan & Debarshi Nandy & Thomas Chemmanur, 2004. "Why Issue Mandatory Convertibles? Theory and Empirical Evidence," Econometric Society 2004 North American Winter Meetings 456, Econometric Society.
    11. Nha Vo‐Thanh & Hans‐Peter Piepho, 2023. "Generating designs for comparative experiments with two blocking factors," Biometrics, The International Biometric Society, vol. 79(4), pages 3574-3585, December.
    12. Maxim Kotsemir & Alexander Abroskin & Dirk Meissner, 2013. "Innovation concepts and typology – an evolutionary discussion," HSE Working papers WP BRP 05/STI/2013, National Research University Higher School of Economics.
    13. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    14. H. A. J. Crauwels & C. N. Potts & L. N. Van Wassenhove, 1998. "Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 341-350, August.
    15. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    16. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    17. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    18. İbrahim Muter & Ş. İlker Birbil & Güvenç Şahin, 2010. "Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 603-619, November.
    19. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 2017. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 17(3), pages 275-314, September.
    20. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:47:y:1999:i:2:p:195-208. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.