A regularized simplex method

• Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton

  MATH  Google Scholar 

• Dempster MAH, Merkovsky RR (1995) A practical geometrically convergent cutting plane algorithm. SIAM J Numer Anal 32:631–644

  Article  MATH  MathSciNet  Google Scholar 

• Elble JM (2010) Computational experience with linear optimization and related problems. PhD dissertation, advisor: N. Sahinidis. The University of Illinois at Urbana-Champaign, IL

• Elble JM, Sahinidis NV (2012) Scaling linear optimization problems prior to application of the simplex method. Comput Optim Appl 52:345–371

  Article  MATH  MathSciNet  Google Scholar 

• Fábián CI (2012) Computational aspects of risk-averse optimisation in two-stage stochastic models. Optimization Online, Aug 2012

• Fábián CI, Eretnek K, Papp O (2012) Towards a regularised simplex method. In: Suhl L, Mitra G, Lucas C, Koberstein A, Beckmann L (eds) Applied mathematical optimization and modelling. Extended abstracts of the APMOD 2012 conference. Volume 8 of the DSOR contributions to information sytems, pp 3–9. DS&OR Lab, University of Paderborn, Germany

• Fábián CI, Mitra G, Roman D, Zverovich V (2011) An enhanced model for portfolio choice with SSD criteria: a constructive approach. Quant Financ 11:1525–1534

  Article  MATH  Google Scholar 

• Fábián CI, Papp O, Eretnek K (2013) Implementing the simplex method as a cutting-plane method, with a view to regularization. Computat Optim Appl 56:343–368

  Article  MATH  Google Scholar 

• Fábián CI, Szőke Z (2007) Solving two-stage stochastic programming problems with level decomposition. CMS 4:313–353

  Article  MATH  Google Scholar 

• Gondzio J, González-Brevis P, Munari P (2012) The primal-dual column generation method: integer optimization applications. In: Suhl L, Mitra G, Lucas C, Koberstein A, Beckmann L (eds) Applied mathematical optimization and modelling. Extended abstracts of the APMOD 2012 conference. Volume 8 of the DSOR contributions to information sytems, pp 54–57. DS&OR Lab, University of Paderborn, Germany

• Lemaréchal C, Nemirovskii A, Nesterov Y (1995) New variants of bundle methods. Math Program 69: 111–147

  Google Scholar 

• Linderoth J, Wright S (2003) Decomposition algorithms for stochastic programming on a computational grid. Comput Optim Appl 24:207–250

  Article  MATH  MathSciNet  Google Scholar 

• Lumbreras S, Ramos A (2013) Transmission expansion planning using an efficient version of benders decomposition. A Case study. In: IEEE PES Grenoble PowerTech, Grenoble, France, pp 16–20

• Maros I (2003) Computational techniques of the simplex method. International series in operations research and management science. Kluwer Academic Publishers, Boston

  Google Scholar 

• Murtagh BA (1981) Advanced linear programming: computation and practice. McGraw-Hill, New York

  MATH  Google Scholar 

• Murty KG (1986) The gravitational method of linear programming. Technical Report No. 8619, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI

• Nemirovski A (2005) Lectures in modern convex optimization. ISYE, Georgia Institute of Technology, Atlanda

  Google Scholar 

• Oliveira WC, Sagastizábal C, Scheimberg S (2011) Inexact bundle methods for two-stage stochastic programming. SIAM J Optim 21:517–544

  Article  MATH  MathSciNet  Google Scholar 

• Orchard-Hays W (1968) Advanced linear-programming computing techniques. McGraw-Hill, New York

  Google Scholar 

• Pan P-Q (2007) Nested pricing for the simplex algorithm: an empirical evaluation. Optimization Online, March 2007

• Pan P-Q (2008) Efficient nested pricing in the simplex algorithm. Oper Res Lett 36:309–313

  Article  MATH  MathSciNet  Google Scholar 

• Prékopa A (1995) Stochastic programming. Kluwer Academic Publishers, Dordrecht

  Book  Google Scholar 

• Richtárik P (2012) Approximate level method for nonsmooth convex minimization. J Optim Theory Appl 152:334–350

  Article  MATH  MathSciNet  Google Scholar 

• Ruszczyński A (1986) A regularized decomposition method for minimizing a sum of polyhedral functions. Math Program 35:309–333

  Article  MATH  Google Scholar 

• Ruszczyński A, Świȩtanowski A (1997) Accelerating the regularized decomposition method for two-stage stochastic linear problems. Eur J Oper Res 101:328–342

  Article  MATH  Google Scholar 

• Sagastizábal C, Solodov M (2012) Solving generation expansion problems with environmental constraints by a bundle method. Comput Manag Sci 9:163–182

  Article  MATH  MathSciNet  Google Scholar 

• Sun H, Xu H, Meskarian R, Wang Y (2013) Exact penalization, level function method and modified cutting-plane method for stochastic programs with second order stochastic dominance constraints. SIAM J Optim 23:602–631

  Article  MATH  MathSciNet  Google Scholar 

• Terlaky T, Zhang S (1993) Pivot rules for linear programming: a survey on recent theoretical developments. Ann Oper Res 46:203–233

  Article  MathSciNet  Google Scholar 

• Vespucci MT, Bertocchi M, Escudero L, Innorta M, Zigrino S (2012) A stochastic model for generation expansion planning in the long period with different risk measures. In: Suhl L, Mitra G, Lucas C, Koberstein A, Beckmann L (eds) Applied mathematical optimization and modelling. Extended abstracts of the APMOD 2012 conference. Volume 8 of the DSOR contributions to information sytems, pp 114–121. DS&OR Lab, University of Paderborn, Germany

• Zverovich V, Fábián CI, Ellison F, Mitra G (2012) A computational study of a solver system for processing two-stage stochastic linear programming problems. Math Program Comput 4:211–238

  Article  MATH  MathSciNet  Google Scholar 

Download references