A fast method for a class of one-stage bounded variables and single constrained linear programming problems

References

• K. I. Anderson A modified schur-complement method for handling dense columns in interior-point methods for linear programming ACM Transactions on Mathematical Software 1996 22 348 356
   Google Scholar
• A. Benyoub E. M. Daoudi Study of the parallel continuous Global Optimization based on interval arithmetic International Journal of Computation Engineering Science 2003 4 99 108
   Google Scholar
• J. R. Birge F. Louveaux Introduction to Stochastic Programming Springer , New York 1997
   Google Scholar
• G. B. Dantzig 1963 Linear Programming and Extensions Princeton University Press Princeton New Jersey
   Google Scholar
• GLPK Version 4.9, 2003 Reference Manual
   Google Scholar
• ILOG CPLEX 8.1 2002 Reference Manual
   Google Scholar
• G. Infanger 1993 Planning under Uncertainty: Solving Large Scale Stochastic Linear Programs Ph.D. Dissertation Stanford University
   Google Scholar
• P. Kall S. W. Wallace Stochastic Programming John Wiley New York 1994
   Google Scholar
• [9] LINGO 9.0 2005 User’s Manual
   Google Scholar
• G. Meng R. C. E. Tan G. Zhao Asuperlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programming International Journal of Computation Engineering Science 2004 5 327 344
   Google Scholar
• The Math works, Inc MATLAB Manual and Instruction Sets 2000
   Google Scholar
• R. J. Vanderbei Linear Programming Foundations and Extensions , 2nd Princeton , New Jersey 2001
   Google Scholar
• H. M. Wagner Principles of Operations Research , 2nd Prentice Hail New Jersey 1975
   Google Scholar
• R. J. B. Wets Stochastic Programming, Chapter VIII Handbooks in Operations Research and Management Science Optimization North-Holland 1 1989
   Google Scholar
• R. Wunderling A. Bley T. Achteberg T. Koch B. Hiller S. Orlowski A. Tunchschcrer SOPLEX 1.3.0 2006
   Google Scholar