Hit-and-run algorithms for the identification of nonredundant linear inequalities
暂无分享,去创建一个
Robert L. Smith | Alexander H. G. Rinnooy Kan | Jan Telgen | C. G. E. Boender | H. C. P. Berbee | C. L. Scheffer | J. Telgen | C. Boender | H. Berbee | Rinnooy Kan | R. L. Smith | Van Dien
[1] Cornelis Gustaaf Eduard Boender,et al. The generalized multinomial distribution : a Bayesian analysis and applications , 1984 .
[2] Gerald G. Brown,et al. Structural Redundancy in Large-Scale Optimization Models , 1983 .
[3] R. Ash,et al. Real analysis and probability , 1975 .
[4] Arnon Boneh. Preduce — A Probabilistic Algorithm Identifying Redundancy by a Random Feasible Point Generator (RFPG) , 1983 .
[5] Stanley Zionts,et al. Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems , 1966 .
[6] Stanley Zionts,et al. Redundancy in Mathematical Programming , 1983 .
[7] Leen Stougie,et al. Global optimization : a stochastic approach , 1980 .
[8] T. H. Mattheiss,et al. An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..
[9] David Lindley,et al. Bayesian Statistics, a Review , 1987 .
[10] Robert L. Smith,et al. Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..
[11] Tomas Gal. Zur Identifikation redundanter Nebenbedingungen in linearen Programmen , 1975, Z. Oper. Research.
[12] Gautam Mitra,et al. Analysis of mathematical programming problems prior to applying the simplex algorithm , 1975, Math. Program..
[13] C. G. E. Boender,et al. A Bayesian Analysis of the Number of Cells of a Multinomial Distribution , 1983 .
[14] J. Telgen. Redundancy and linear programs , 1981 .
[15] M. Balinski. An algorithm for finding all vertices of convex polyhedral sets , 1959 .