- AvrielM. and WilliamsA.C. (1970). The value of information in stochastic programming. Operations Research, 18, 947–954.
- BealeE.M.L., ForrestJ.J.H., and TaylorC.J. (1980). Multitime period stochastic programming. In Stochastic Programming (DempsterM.A.H., Editor), Academic Press, New York. 387–402.
- BirgeJ.R. (1980). Solution methods for stochastic dynamic linear programs. Technical Report SOL 80–29, Systems Optimization Laboratory, Stanford University.
- BirgeJ.R. and SmithR.L. (1982). New Monte-Carlo procedures for numerical integration. Technical Report 82–8, Department of Industrial and Operations Engineering, The University of Michigan, Ann ArborMichigan.
- BoenderG., Rinnooy KanA., SmithR.L. and TelgenJ. (1982). Probabilistic methods for identifying no–redundant constraints. XI International Symposium on Mathematical Programming.
- BonehA. and GolanA. (1981). Constraint redundancy and feasible point generator. In Redundancy in Mathematical Programming (KarwanM. H., TelgenJ., ZiontsS. (eds.)), Sprlng-Verlag, New York-Heidelberg–Berlin.
- BradleyG.H., BrownG.G., and GravesG.W. (1983). Structural redundancy in large-scale optimization models. In Redundancy in Mathematical Programming (KarwanM.H., LotfiV., TelgenJ., ZiontsS. (eds.)), Springer-Verlag, Berlin.
- GalT. (1981). Zur identifikation redundanter nebendengungen in linearen programmen. Zeitschiift fuer Operations Research 19, 19–28.
- HoJ.K. and LouteE. (1981). A set of staircase linear programming test problems. Mathematical Programming 20, 245–250.
- KarwanM.H., LotflV., TelgenJ., and ZiontsS., (eds.) (1983). Redundancy in Mathematical Programming, Springer-Verlag, Berlin.
- MattheissT.H. (1973). An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities. Operations Research, 21, 247–260.
- SmithR.L. (May, 1980). Monte Carlo procedures for generating random feasible solutions to mathematical programs. ORSA/TIMS Conference, Washington, D. C.
- SmithR.L. (January, 1981). Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Technical Report 81–1, Department of Industrial and Operations Engineering, The University of Michigan, Ann ArborMichigan, forthcoming in Operations Research. 1984.
- TelgenJ. (1979). Redundancy and Linear Programs, Mathematical Center, Amsterdam.
- The University of Michigan Computing Center (1980). MTS Volume 6: FORTRAN in MTS. Ann ArborMichigan.
- WalkupD. and WetsR. (1967). Stochastic programs and recourse. SIAM Journal on Applied Math, 15, 1299–1314.
- Choose new content alerts to be informed about new research of interest to you
- Easy remote access to your institution's subscriptions on any device, from any location
- Save your searches and schedule alerts to send you new results
- Export your search results into a .csv file to support your research
![Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.]({"type":"image" , "src" : "/sda/112445/Skyscraper-econ.png"})