IDEAS home Printed from https://ideas.repec.org/a/cup/jfinqa/v28y1993i01p117-138_00.html
   My bibliography  Save this article

Optimal Replication of Options with Transactions Costs and Trading Restrictions

Author

Listed:
  • Edirisinghe, Chanaka
  • Naik, Vasanttilak
  • Uppal, Raman

Abstract

This paper analyzes the strategy that minimizes the initial cost of replicating a contingent claim in a market with transactions costs and trading constraints. The linear programming and two-stage backward recursive models developed are applicable to the replication of convex as well as nonconvex payoffs and to a portfolio of options with different maturities. The paper's formulation conveniently accounts for fixed and variable transactions costs, lot size constraints, and position limits on trading. The article shows that in the presence of trading frictions, it is no longer optimal to revise one's portfolio in each period. At the optimum, cash flows in excess of the desired ones may be generated. The optimal policy trades off the curvature of the payoff that is generated against the terminal slack.

Suggested Citation

  • Edirisinghe, Chanaka & Naik, Vasanttilak & Uppal, Raman, 1993. "Optimal Replication of Options with Transactions Costs and Trading Restrictions," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 28(1), pages 117-138, March.
  • Handle: RePEc:cup:jfinqa:v:28:y:1993:i:01:p:117-138_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S0022109000008395/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:cup:jfinqa:v:28:y:1993:i:01:p:117-138_00. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/jfq .

    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.