IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v238y2016i1d10.1007_s10479-015-1995-1.html
   My bibliography  Save this article

On the relationship between the discrete and continuous bounding moment problems and their numerical solutions

Author

Listed:
  • András Prékopa

    (Rutgers University)

  • Anh Ninh

    (College of William and Mary)

  • Gabriela Alexe

    (Boston
    Harvard Medical School)

Abstract

We present a brief survey of some of the basic results related to the classical continuous moment problems (CMP) and the recently developed discrete moment problems (DMP), clarifying their relationship and propose new methods for the solution of univariate continuous and discrete power moment problems. In the classical as well as in the recently developed discrete moment problems the coefficient function in the objective is supposed to be higher order convex (in the entire interval or part of it), or constant in an interval while zero elsewhere, or equal to a constant at some point and zero elsewhere. The concept of a regenerative block (of points) is introduced, for the case of the DMP, that makes it possible to create lower and upper bounds for other functions in the objective. The CMP are solved by discretization and sequential application of dual type algorithm. Numerical results are presented with moments of order up to 40 and various applications are mentioned.

Suggested Citation

  • András Prékopa & Anh Ninh & Gabriela Alexe, 2016. "On the relationship between the discrete and continuous bounding moment problems and their numerical solutions," Annals of Operations Research, Springer, vol. 238(1), pages 521-575, March.
    • Handle: RePEc:spr:annopr:v:238:y:2016:i:1:d:10.1007_s10479-015-1995-1
    DOI: 10.1007/s10479-015-1995-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-1995-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-015-1995-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liao, Yi & Banerjee, Avijit & Yan, Changyuan, 2011. "A distribution-free newsvendor model with balking and lost sales penalty," International Journal of Production Economics, Elsevier, vol. 133(1), pages 224-227, September.
    2. Denuit, Michel & Lefevre, Claude & Mesfioui, M'hamed, 1999. "On s-convex stochastic extrema for arithmetic risks," Insurance: Mathematics and Economics, Elsevier, vol. 25(2), pages 143-155, November.
    3. Andersson, Jonas & Jörnsten, Kurt & Nonås, Sigrid Lise & Sandal, Leif & Ubøe, Jan, 2013. "A maximum entropy approach to the newsvendor problem with partial information," European Journal of Operational Research, Elsevier, vol. 228(1), pages 190-200.
    4. Li Chen & Simai He & Shuzhong Zhang, 2011. "Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection," Operations Research, INFORMS, vol. 59(4), pages 847-865, August.
    5. Keiiti Isii, 1960. "The extrema of probability determined by generalized moments (I) bounded random variables," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 12(2), pages 119-134, June.
    6. Wong, Man Hong & Zhang, Shuzhong, 2013. "Computing best bounds for nonlinear risk measures with partial information," Insurance: Mathematics and Economics, Elsevier, vol. 52(2), pages 204-212.
    7. András Prékopa & Endre Boros, 1991. "On the Existence of a Feasible Flow in a Stochastic Transportation Network," Operations Research, INFORMS, vol. 39(1), pages 119-129, February.
    8. Georgia Perakis & Guillaume Roels, 2008. "Regret in the Newsvendor Model with Partial Information," Operations Research, INFORMS, vol. 56(1), pages 188-203, February.
    9. John R. Birge & Roger J.-B. Wets, 1987. "Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem," Mathematics of Operations Research, INFORMS, vol. 12(1), pages 149-162, February.
    10. Zuluaga, Luis F. & Peña, Javier & Du, Donglei, 2009. "Third-order extensions of Lo's semiparametric bound for European call options," European Journal of Operational Research, Elsevier, vol. 198(2), pages 557-570, October.
    11. Cindy Courtois & Michel Denuit, 2009. "Moment Bounds on Discrete Expected Stop-Loss Transforms, with Applications," Methodology and Computing in Applied Probability, Springer, vol. 11(3), pages 307-338, September.
    12. Gregory A. Godfrey & Warren B. Powell, 2001. "An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution," Management Science, INFORMS, vol. 47(8), pages 1101-1112, August.
    13. A. Charnes & W. W. Cooper & K. Kortanek, 1965. "On Representations of Semi-Infinite Programs which Have No Duality Gaps," Management Science, INFORMS, vol. 12(1), pages 113-121, September.
    14. Endre Boros & András Prékopa, 1989. "Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur," Mathematics of Operations Research, INFORMS, vol. 14(2), pages 317-342, May.
    15. Kwon, Kysang & Cheong, Taesu, 2014. "A minimax distribution-free procedure for a newsvendor problem with free shipping," European Journal of Operational Research, Elsevier, vol. 232(1), pages 234-240.
    16. John T. Chen, 2008. "A Two-Stage Stepwise Estimation Procedure," Biometrics, The International Biometric Society, vol. 64(2), pages 406-412, June.
    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. Anh Ninh & Honggang Hu & David Allen, 2019. "Robust newsvendor problems: effect of discrete demands," Annals of Operations Research, Springer, vol. 275(2), pages 607-621, April.
    2. Mariya Naumova & András Prékopa, 2021. "Bounding the values of financial derivatives by the use of the moment problem," Annals of Operations Research, Springer, vol. 305(1), pages 211-225, October.
    3. M. A. Goberna & M. A. López, 2017. "Recent contributions to linear semi-infinite optimization," 4OR, Springer, vol. 15(3), pages 221-264, September.
    4. Anh Ninh, 2021. "Robust newsvendor problems with compound Poisson demands," Annals of Operations Research, Springer, vol. 302(1), pages 327-338, July.
    5. Talal Alharbi & Anh Ninh & Ersoy Subasi & Munevver Mine Subasi, 2022. "The value of shape constraints in discrete moment problems: a review and extension," Annals of Operations Research, Springer, vol. 318(1), pages 1-31, November.
    6. Anh Ninh & Benjamin Melamed & Yao Zhao, 2020. "Analysis and optimization of recruitment stocking problems," Annals of Operations Research, Springer, vol. 295(2), pages 747-767, December.
    7. M. A. Goberna & M. A. López, 2018. "Recent contributions to linear semi-infinite optimization: an update," Annals of Operations Research, Springer, vol. 271(1), pages 237-278, December.

    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. András Prékopa & Anh Ninh & Gabriela Alexe, 2016. "On the relationship between the discrete and continuous bounding moment problems and their numerical solutions," Annals of Operations Research, Springer, vol. 238(1), pages 521-575, March.
    2. Bai, Qingguo & Xu, Jianteng & Gong, Yeming & Chauhan, Satyaveer S., 2022. "Robust decisions for regulated sustainable manufacturing with partial demand information: Mandatory emission capacity versus emission tax," European Journal of Operational Research, Elsevier, vol. 298(3), pages 874-893.
    3. Kamburowski, Jerzy, 2014. "The distribution-free newsboy problem under the worst-case and best-case scenarios," European Journal of Operational Research, Elsevier, vol. 237(1), pages 106-112.
    4. Qiu, Ruozhen & Sun, Minghe & Lim, Yun Fong, 2017. "Optimizing (s, S) policies for multi-period inventory models with demand distribution uncertainty: Robust dynamic programing approaches," European Journal of Operational Research, Elsevier, vol. 261(3), pages 880-892.
    5. Anh Ninh & Honggang Hu & David Allen, 2019. "Robust newsvendor problems: effect of discrete demands," Annals of Operations Research, Springer, vol. 275(2), pages 607-621, April.
    6. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    7. Irfanullah Khan & Biswajit Sarkar, 2021. "Transfer of Risk in Supply Chain Management with Joint Pricing and Inventory Decision Considering Shortages," Mathematics, MDPI, vol. 9(6), pages 1-20, March.
    8. Soroush Saghafian & Brian Tomlin, 2016. "The Newsvendor under Demand Ambiguity: Combining Data with Moment and Tail Information," Operations Research, INFORMS, vol. 64(1), pages 167-185, February.
    9. Qiaoming Han & Donglei Du & Luis F. Zuluaga, 2014. "Technical Note---A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula," Operations Research, INFORMS, vol. 62(3), pages 535-542, June.
    10. Talal Alharbi & Anh Ninh & Ersoy Subasi & Munevver Mine Subasi, 2022. "The value of shape constraints in discrete moment problems: a review and extension," Annals of Operations Research, Springer, vol. 318(1), pages 1-31, November.
    11. Karthik Natarajan & Melvyn Sim & Joline Uichanco, 2018. "Asymmetry and Ambiguity in Newsvendor Models," Management Science, INFORMS, vol. 64(7), pages 3146-3167, July.
    12. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    13. Wong, Man Hong & Zhang, Shuzhong, 2014. "On distributional robust probability functions and their computations," European Journal of Operational Research, Elsevier, vol. 233(1), pages 23-33.
    14. Guanghua Han & Xujin Pu & Bo Fan, 2017. "Sustainable Governance of Organic Food Production When Market Forecast Is Imprecise," Sustainability, MDPI, vol. 9(6), pages 1-20, June.
    15. Postek, Krzysztof & Ben-Tal, A. & den Hertog, Dick & Melenberg, Bertrand, 2015. "Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information," Other publications TiSEM d718e419-a375-4707-b206-e, Tilburg University, School of Economics and Management.
    16. Derek Singh & Shuzhong Zhang, 2020. "Tight Bounds for a Class of Data-Driven Distributionally Robust Risk Measures," Papers 2010.05398, arXiv.org, revised Oct 2020.
    17. Fleischhacker, Adam J. & Fok, Pak-Wing, 2015. "On the relationship between entropy, demand uncertainty, and expected loss," European Journal of Operational Research, Elsevier, vol. 245(2), pages 623-628.
    18. Woonghee Tim Huh & Paat Rusmevichientong, 2014. "Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 150-159, February.
    19. Huber, Jakob & Müller, Sebastian & Fleischmann, Moritz & Stuckenschmidt, Heiner, 2019. "A data-driven newsvendor problem: From data to decision," European Journal of Operational Research, Elsevier, vol. 278(3), pages 904-915.
    20. Hao Yuan & Qi Luo & Cong Shi, 2021. "Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs," Management Science, INFORMS, vol. 67(10), pages 6089-6115, October.

    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:spr:annopr:v:238:y:2016:i:1:d:10.1007_s10479-015-1995-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.