IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v77y2013i2p265-277.html
   My bibliography  Save this article

On relations between chance constrained and penalty function problems under discrete distributions

Author

Listed:
  • Martin Branda

Abstract

We extend the theory of penalty functions to stochastic programming problems with nonlinear inequality constraints dependent on a random vector with known distribution. We show that the problems with penalty objective, penalty constraints and chance constraints are asymptotically equivalent under discretely distributed random parts. This is a complementary result to Branda (Kybernetika 48(1):105–122, 2012a ), Branda and Dupačová (Ann Oper Res 193(1):3–19, 2012 ), and Ermoliev et al. (Ann Oper Res 99:207–225, 2000 ) where the theorems were restricted to continuous distributions only. We propose bounds on optimal values and convergence of optimal solutions. Moreover, we apply exact penalization under modified calmness property to improve the results. Copyright Springer-Verlag Berlin Heidelberg 2013

Suggested Citation

  • Martin Branda, 2013. "On relations between chance constrained and penalty function problems under discrete distributions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 77(2), pages 265-277, April.
  • Handle: RePEc:spr:mathme:v:77:y:2013:i:2:p:265-277
    DOI: 10.1007/s00186-013-0428-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-013-0428-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s00186-013-0428-7?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. Y.M. Ermoliev & T.Y. Ermolieva & G.J. MacDonald & V.I. Norkin, 2000. "Stochastic Optimization of Insurance Portfolios for Managing Exposure to Catastrophic Risks," Annals of Operations Research, Springer, vol. 99(1), pages 207-225, December.
    2. Dupacova, Jitka & Gaivoronski, Alexei & Kos, Zdenek & Szantai, Tamas, 1991. "Stochastic programming in water management: A case study and a comparison of solution techniques," European Journal of Operational Research, Elsevier, vol. 52(1), pages 28-44, May.
    3. William M. Raike, 1970. "Dissection Methods for Solutions in Chance Constrained Programming Problems Under Discrete Distributions," Management Science, INFORMS, vol. 16(11), pages 708-715, July.
    4. Huifu Xu & Dali Zhang, 2012. "Monte Carlo methods for mean-risk optimization and portfolio selection," Computational Management Science, Springer, vol. 9(1), pages 3-29, February.
    5. Martin Branda & Jitka Dupačová, 2012. "Approximation and contamination bounds for probabilistic programs," Annals of Operations Research, Springer, vol. 193(1), pages 3-19, March.
    6. Willem Haneveld & Maarten Vlerk, 2006. "Integrated Chance Constraints: Reduced Forms and an Algorithm," Computational Management Science, Springer, vol. 3(4), pages 245-269, September.
    7. Meskarian, Rudabeh & Xu, Huifu & Fliege, Jörg, 2012. "Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 216(2), pages 376-385.
    8. Thorsten Koch & Ted Ralphs & Yuji Shinano, 2012. "Could we use a million cores to solve an integer program?," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(1), pages 67-93, August.
    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. Jiang, J. & Ng, K.M. & Teo, K.M., 2016. "Satisficing measure approach for vehicle routing problem with time windows under uncertaintyAuthor-Name: Nguyen, V.A," European Journal of Operational Research, Elsevier, vol. 248(2), pages 404-414.

    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. Lukáš Adam & Martin Branda, 2016. "Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 419-436, August.
    2. Martin Branda & Jitka Dupačová, 2012. "Approximation and contamination bounds for probabilistic programs," Annals of Operations Research, Springer, vol. 193(1), pages 3-19, March.
    3. Lukáš Adam & Martin Branda & Holger Heitsch & René Henrion, 2020. "Solving joint chance constrained problems using regularization and Benders’ decomposition," Annals of Operations Research, Springer, vol. 292(2), pages 683-709, September.
    4. Martin Branda & Miloš Kopa, 2014. "On relations between DEA-risk models and stochastic dominance efficiency tests," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(1), pages 13-35, March.
    5. Escudero, Laureano F. & Garín, María Araceli & Merino, María & Pérez, Gloria, 2016. "On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs," European Journal of Operational Research, Elsevier, vol. 249(1), pages 164-176.
    6. X. Qin & G. Huang, 2009. "An Inexact Chance-constrained Quadratic Programming Model for Stream Water Quality Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 23(4), pages 661-695, March.
    7. D. Kuhn, 2009. "Convergent Bounds for Stochastic Programs with Expected Value Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(3), pages 597-618, June.
    8. Dirk Lorenz & Marc Pfetsch & Andreas Tillmann, 2014. "An infeasible-point subgradient method using adaptive approximate projections," Computational Optimization and Applications, Springer, vol. 57(2), pages 271-306, March.
    9. Juan Ma & Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Vladimir Boginski, 2016. "The Minimum Spanning k -Core Problem with Bounded CVaR Under Probabilistic Edge Failures," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 295-307, May.
    10. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    11. Streutker, Matthijs & van der Vlerk, Maarten & Klein Haneveld, Wim, 2007. "Implementation of new regulatory rules in a multistage ALM model for Dutch pension funds," Research Report 07005, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    12. repec:dgr:rugsom:02a06 is not listed on IDEAS
    13. Mohd Azdi Maasar & Diana Roman & Paresh Date, 2022. "Risk minimisation using options and risky assets," Operational Research, Springer, vol. 22(1), pages 485-506, March.
    14. Takashi Hasuike, 2014. "Risk-control approach for bottleneck transportation problem with randomness and fuzziness," Journal of Global Optimization, Springer, vol. 60(4), pages 663-678, December.
    15. Li, Y.P. & Huang, G.H. & Zhang, N. & Nie, S.L., 2011. "An inexact-stochastic with recourse model for developing regional economic-ecological sustainability under uncertainty," Ecological Modelling, Elsevier, vol. 222(2), pages 370-379.
    16. Daniel Bartl & Shahar Mendelson, 2021. "On Monte-Carlo methods in convex stochastic optimization," Papers 2101.07794, arXiv.org, revised Jan 2022.
    17. Gaivoronski, Alexei & Sechi, Giovanni M. & Zuddas, Paola, 2012. "Cost/risk balanced management of scarce resources using stochastic programming," European Journal of Operational Research, Elsevier, vol. 216(1), pages 214-224.
    18. Gong, Jiangyue & Gujjula, Krishna Reddy & Ntaimo, Lewis, 2023. "An integrated chance constraints approach for optimal vaccination strategies under uncertainty for COVID-19," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    19. Zhi-Hai Zhang & Kang Li, 2015. "A novel probabilistic formulation for locating and sizing emergency medical service stations," Annals of Operations Research, Springer, vol. 229(1), pages 813-835, June.
    20. Lluís-Miquel Munguía & Geoffrey Oxberry & Deepak Rajan & Yuji Shinano, 2019. "Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs," Computational Optimization and Applications, Springer, vol. 73(2), pages 575-601, June.
    21. Meskarian, Rudabeh & Xu, Huifu & Fliege, Jörg, 2012. "Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 216(2), pages 376-385.

    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:mathme:v:77:y:2013:i:2:p:265-277. 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.