IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v51y2012i1p51-75.html
   My bibliography  Save this article

The impact of sampling methods on bias and variance in stochastic linear programs

Author

Listed:
  • Michael Freimer
  • Jeffrey Linderoth
  • Douglas Thomas

Abstract

No abstract is available for this item.

Suggested Citation

  • Michael Freimer & Jeffrey Linderoth & Douglas Thomas, 2012. "The impact of sampling methods on bias and variance in stochastic linear programs," Computational Optimization and Applications, Springer, vol. 51(1), pages 51-75, January.
    • Handle: RePEc:spr:coopap:v:51:y:2012:i:1:p:51-75
    DOI: 10.1007/s10589-010-9322-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-010-9322-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-010-9322-x?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. Jeff Linderoth & Alexander Shapiro & Stephen Wright, 2006. "The empirical behavior of sampling methods for stochastic programming," Annals of Operations Research, Springer, vol. 142(1), pages 215-241, February.
    2. John M. Mulvey & Andrzej Ruszczyński, 1995. "A New Scenario Decomposition Method for Large-Scale Stochastic Optimization," Operations Research, INFORMS, vol. 43(3), pages 477-490, June.
    3. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    4. Athanassios N. Avramidis & James R. Wilson, 1998. "Correlation-Induction Techniques for Estimating Quantiles in Simulation Experiments," Operations Research, INFORMS, vol. 46(4), pages 574-591, August.
    5. Apostolos N. Burnetas & Craig E. Smith, 2000. "Adaptive Ordering and Pricing for Perishable Products," Operations Research, INFORMS, vol. 48(3), pages 436-443, June.
    6. Julia L. Higle, 1998. "Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 236-247, May.
    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. Maria Albareda-Sambola & Elena Fernández & Francisco Saldanha-da-Gama, 2017. "Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 737-753, November.
    2. Yunxiao Deng & Suvrajeet Sen, 2022. "Predictive stochastic programming," Computational Management Science, Springer, vol. 19(1), pages 65-98, January.
    3. Jangho Park & Rebecca Stockbridge & Güzin Bayraksan, 2021. "Variance reduction for sequential sampling in stochastic programming," Annals of Operations Research, Springer, vol. 300(1), pages 171-204, May.
    4. Seddig, Katrin & Jochem, Patrick & Fichtner, Wolf, 2019. "Two-stage stochastic optimization for cost-minimal charging of electric vehicles at public charging stations with photovoltaics," Applied Energy, Elsevier, vol. 242(C), pages 769-781.
    5. Rebecca Stockbridge & Güzin Bayraksan, 2016. "Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming," Computational Optimization and Applications, Springer, vol. 64(2), pages 407-431, June.
    6. Löhndorf, Nils, 2016. "An empirical analysis of scenario generation methods for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 255(1), pages 121-132.
    7. Arnab Bhattacharya & Jeffrey P. Kharoufeh & Bo Zeng, 2023. "A Nonconvex Regularization Scheme for the Stochastic Dual Dynamic Programming Algorithm," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1161-1178, September.
    8. Ward Romeijnders & David P. Morton & Maarten H. van der Vlerk, 2017. "Assessing the Quality of Convex Approximations for Two-Stage Totally Unimodular Integer Recourse Models," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 211-231, May.

    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. Rebecca Stockbridge & Güzin Bayraksan, 2016. "Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming," Computational Optimization and Applications, Springer, vol. 64(2), pages 407-431, June.
    2. T. Glenn Bailey & Paul A. Jensen & David P. Morton, 1999. "Response surface analysis of two‐stage stochastic linear programming with recourse," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(7), pages 753-776, October.
    3. Jangho Park & Rebecca Stockbridge & Güzin Bayraksan, 2021. "Variance reduction for sequential sampling in stochastic programming," Annals of Operations Research, Springer, vol. 300(1), pages 171-204, May.
    4. Jeff Linderoth & Alexander Shapiro & Stephen Wright, 2006. "The empirical behavior of sampling methods for stochastic programming," Annals of Operations Research, Springer, vol. 142(1), pages 215-241, February.
    5. Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
    6. Löhndorf, Nils, 2016. "An empirical analysis of scenario generation methods for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 255(1), pages 121-132.
    7. Ankur Kulkarni & Uday Shanbhag, 2012. "Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms," Computational Optimization and Applications, Springer, vol. 51(1), pages 77-123, January.
    8. Panos Parpas & Berç Rustem, 2007. "Computational Assessment of Nested Benders and Augmented Lagrangian Decomposition for Mean-Variance Multistage Stochastic Problems," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 239-247, May.
    9. Sebastián Arpón & Tito Homem-de-Mello & Bernardo K. Pagnoncelli, 2020. "An ADMM algorithm for two-stage stochastic programming problems," Annals of Operations Research, Springer, vol. 286(1), pages 559-582, March.
    10. Blanchot, Xavier & Clautiaux, François & Detienne, Boris & Froger, Aurélien & Ruiz, Manuel, 2023. "The Benders by batch algorithm: Design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 309(1), pages 202-216.
    11. Suvrajeet Sen & Yifan Liu, 2016. "Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction," Operations Research, INFORMS, vol. 64(6), pages 1422-1437, December.
    12. Panos Parpas & Berk Ustun & Mort Webster & Quang Kha Tran, 2015. "Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 358-377, May.
    13. Weskamp, Christoph & Koberstein, Achim & Schwartz, Frank & Suhl, Leena & Voß, Stefan, 2019. "A two-stage stochastic programming approach for identifying optimal postponement strategies in supply chains with uncertain demand," Omega, Elsevier, vol. 83(C), pages 123-138.
    14. Fengqi You & Ignacio Grossmann, 2013. "Multicut Benders decomposition algorithm for process supply chain planning under uncertainty," Annals of Operations Research, Springer, vol. 210(1), pages 191-211, November.
    15. Helga Meier & Nicos Christofides & Gerry Salkin, 2001. "Capital Budgeting Under Uncertainty---An Integrated Approach Using Contingent Claims Analysis and Integer Programming," Operations Research, INFORMS, vol. 49(2), pages 196-206, April.
    16. Aghayi, Nazila & Maleki, Bentolhoda, 2016. "Efficiency measurement of DMUs with undesirable outputs under uncertainty based on the directional distance function: Application on bank industry," Energy, Elsevier, vol. 112(C), pages 376-387.
    17. Hashem Omrani & Farzane Adabi & Narges Adabi, 2017. "Designing an efficient supply chain network with uncertain data: a robust optimization—data envelopment analysis approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 816-828, July.
    18. J. F. F. Almeida & S. V. Conceição & L. R. Pinto & B. R. P. Oliveira & L. F. Rodrigues, 2022. "Optimal sales and operations planning for integrated steel industries," Annals of Operations Research, Springer, vol. 315(2), pages 773-790, August.
    19. Zéphyr, Luckny & Lang, Pascal & Lamond, Bernard F. & Côté, Pascal, 2017. "Approximate stochastic dynamic programming for hydroelectric production planning," European Journal of Operational Research, Elsevier, vol. 262(2), pages 586-601.
    20. Alexandre Forel & Martin Grunow, 2023. "Dynamic stochastic lot sizing with forecast evolution in rolling‐horizon planning," Production and Operations Management, Production and Operations Management Society, vol. 32(2), pages 449-468, February.

    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:coopap:v:51:y:2012:i:1:p:51-75. 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.