Hit-and-run algorithms for the identification of nonredundant linear inequalities
- 1 June 1987
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 37 (2) , 184-207
- https://doi.org/10.1007/bf02591694
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded RegionsOperations Research, 1984
- A Bayesian Analysis of the Number of Cells of a Multinomial DistributionJournal of the Royal Statistical Society: Series D (The Statistician), 1983
- Preduce — A Probabilistic Algorithm Identifying Redundancy by a Random Feasible Point Generator (RFPG)Published by Springer Nature ,1983
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975
- An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear InequalitiesOperations Research, 1973
- Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming ProblemsManagement Science, 1966
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961