IDEAS home Printed from https://ideas.repec.org/p/hhs/bergec/2007_008.html
   My bibliography  Save this paper

Option pricing by mathematical programming

Author

Listed:

Abstract

Financial options typically incorporate times of exercise. Alternatively, they embody set-up costs or indivisibilities. Such features lead to planning problems with integer decision variables. Provided the sample space be finite, it is shown here that integrality constraints can often be relaxed. In fact, simple mathematical programming, aimed at arbitrage or replication, may find optimal exercise, and bound or identify option prices. When the asset market is incomplete, the bounds stem from nonlinear pricing functionals.

Suggested Citation

  • Flåm, Sjur Didrik, 2007. "Option pricing by mathematical programming," Working Papers in Economics 08/07, University of Bergen, Department of Economics.
    • Handle: RePEc:hhs:bergec:2007_008
    as

    Download full text from publisher

    File URL: http://ekstern.filer.uib.no/svf/2007/No.%2008-07.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Leif Andersen & Mark Broadie, 2004. "Primal-Dual Simulation Algorithm for Pricing Multidimensional American Options," Management Science, INFORMS, vol. 50(9), pages 1222-1234, September.
    2. Laurence Carassus & Miklós Rásonyi, 2006. "Convergence of Utility Indifference Prices to the Superreplication Price," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 145-154, August.
    3. Klaus Sandmann, 1993. "The Pricing of Options With an Uncertain Interest Rate: A Discrete‐Time Approach1," Mathematical Finance, Wiley Blackwell, vol. 3(2), pages 201-216, April.
    4. repec:bla:jfinan:v:43:y:1988:i:2:p:301-08 is not listed on IDEAS
    5. Evstigneev, I.V. & Flam, S.D., 2000. "Stochastic Programming: Non-Anticipativity and Lagrange Multipliers," Norway; Department of Economics, University of Bergen 1100, Department of Economics, University of Bergen.
    6. Gilboa, Itzhak & Schmeidler, David, 1989. "Maxmin expected utility with non-unique prior," Journal of Mathematical Economics, Elsevier, vol. 18(2), pages 141-153, April.
    7. Jaime Cuevas Dermody & R. Tyrrell Rockafellar, 1991. "Cash Stream Valuation In the Face of Transaction Costs and Taxes," Mathematical Finance, Wiley Blackwell, vol. 1(1), pages 31-54, January.
    8. Avinash K. Dixit & Robert S. Pindyck, 1994. "Investment under Uncertainty," Economics Books, Princeton University Press, edition 1, number 5474.
    9. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, April.
    10. Gyana R. Parija & Shabbir Ahmed & Alan J. King, 2004. "On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 73-83, February.
    11. Martin B. Haugh & Leonid Kogan, 2004. "Pricing American Options: A Duality Approach," Operations Research, INFORMS, vol. 52(2), pages 258-270, April.
    12. Wolfstetter,Elmar, 2000. "Topics in Microeconomics," Cambridge Books, Cambridge University Press, number 9780521645348, September.
    13. Jitka Dupačová & Giorgio Consigli & Stein Wallace, 2000. "Scenarios for Multistage Stochastic Programs," Annals of Operations Research, Springer, vol. 100(1), pages 25-53, December.
    14. L. C. G. Rogers, 2002. "Monte Carlo valuation of American options," Mathematical Finance, Wiley Blackwell, vol. 12(3), pages 271-286, July.
    Full references (including those not matched with items on IDEAS)

    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. Yi Yang & Jianan Wang & Youhua Chen & Zhiyuan Chen & Yanchu Liu, 2020. "Optimal procurement strategies for contractual assembly systems with fluctuating procurement price," Annals of Operations Research, Springer, vol. 291(1), pages 1027-1059, August.
    2. Volker Krätschmer & Marcel Ladkau & Roger J. A. Laeven & John G. M. Schoenmakers & Mitja Stadje, 2018. "Optimal Stopping Under Uncertainty in Drift and Jump Intensity," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1177-1209, November.
    3. Secomandi, Nicola & Seppi, Duane J., 2014. "Real Options and Merchant Operations of Energy and Other Commodities," Foundations and Trends(R) in Technology, Information and Operations Management, now publishers, vol. 6(3-4), pages 161-331, July.
    4. Fabian Dickmann & Nikolaus Schweizer, 2014. "Faster Comparison of Stopping Times by Nested Conditional Monte Carlo," Papers 1402.0243, arXiv.org.
    5. Ernst, Philip A. & Rogers, L.C.G. & Zhou, Quan, 2017. "The value of foresight," Stochastic Processes and their Applications, Elsevier, vol. 127(12), pages 3913-3927.
    6. Rutger-Jan Lange & Coen Teulings, 2018. "The option value of vacant land and the optimal timing of city extensions," Tinbergen Institute Discussion Papers 18-033/III, Tinbergen Institute.
    7. Denis Belomestny & Grigori Milstein & Vladimir Spokoiny, 2009. "Regression methods in pricing American and Bermudan options using consumption processes," Quantitative Finance, Taylor & Francis Journals, vol. 9(3), pages 315-327.
    8. Helin Zhu & Fan Ye & Enlu Zhou, 2013. "Fast Estimation of True Bounds on Bermudan Option Prices under Jump-diffusion Processes," Papers 1305.4321, arXiv.org.
    9. David Hobson & Anthony Neuberger, 2016. "On the value of being American," Papers 1604.02269, arXiv.org.
    10. Cosma, Antonio & Galluccio, Stefano & Pederzoli, Paola & Scaillet, Olivier, 2020. "Early Exercise Decision in American Options with Dividends, Stochastic Volatility, and Jumps," Journal of Financial and Quantitative Analysis, Cambridge University Press, vol. 55(1), pages 331-356, February.
    11. Lokeshwar, Vikranth & Bharadwaj, Vikram & Jain, Shashi, 2022. "Explainable neural network for pricing and universal static hedging of contingent claims," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    12. Antonio Cosma & Stefano Galluccio & Paola Pederzoli & O. Scaillet, 2012. "Valuing American Options Using Fast Recursive Projections," Swiss Finance Institute Research Paper Series 12-26, Swiss Finance Institute.
    13. Mark Broadie & Weiwei Shen, 2016. "High-Dimensional Portfolio Optimization With Transaction Costs," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 19(04), pages 1-49, June.
    14. David B. Brown & James E. Smith, 2013. "Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats," Operations Research, INFORMS, vol. 61(3), pages 644-665, June.
    15. Louis Bhim & Reiichiro Kawai, 2018. "Smooth Upper Bounds For The Price Function Of American Style Options," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 21(01), pages 1-38, February.
    16. Lukas Gonon, 2024. "Deep neural network expressivity for optimal stopping problems," Finance and Stochastics, Springer, vol. 28(3), pages 865-910, July.
    17. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    18. Christian Bender & Nikolaus Schweizer & Jia Zhuo, 2013. "A primal-dual algorithm for BSDEs," Papers 1310.3694, arXiv.org, revised Sep 2014.
    19. Dragos Florin Ciocan & Velibor V. Mišić, 2022. "Interpretable Optimal Stopping," Management Science, INFORMS, vol. 68(3), pages 1616-1638, March.
    20. Jérôme Lelong, 2019. "Pricing path-dependent Bermudan options using Wiener chaos expansion: an embarrassingly parallel approach," Working Papers hal-01983115, HAL.

    More about this item

    Keywords

    asset pricing; arbitrage; options; finite sample space; scenario tree; equivalent martingale measures; bid-ask intervals; incomplete market; linear programming; combinatorial optimization; totally unimodular matrices.;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C62 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Existence and Stability Conditions of Equilibrium

    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:hhs:bergec:2007_008. 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: Kjell Erik Lommerud (email available below). General contact details of provider: https://edirc.repec.org/data/iouibno.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.