A new approach to the analysis of random methods for detecting necessary linear inequality constraints

DOI10.1007/BF01582281zbMath0676.90036OpenAlexW1982270662MaRDI QIDQ1123120

J. Fred McDonald, Richard J. Caron

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582281

zbMATH Keywords

random methodsnecessary constraintsnon- redundant constraintstwo-direction search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (2)

Optimal strategy of coupon subset collection when each package contains half of the coupons ⋮ On the best case performance of hit and run methods for detecting necessary constraints

Cites Work

• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions

This page was built for publication: A new approach to the analysis of random methods for detecting necessary linear inequality constraints