Abstract
This chapter describes a probabilistic-type algorithm, PREDUCE (Probabilistic REDUCE) capable of detecting (possibly with an error) several general properties of a given feasible region, by performing a random walk through the region. PREDUCE is mainly designed for redundancy identification. PREDUCE also provides information (at little additional cost) concerning the boundedness, convexity and dimensionality of the feasible region as well as some estimate on the size of the facets enclosing the feasible region and bounds on each of the variables. This type of global information is often desirable, especially in a pre-optimization phase, and is rarely provided by standard algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boneh, A. (1983). Preduce — A Probabilistic Algorithm Identifying Redundancy by a Random Feasible Point Generator (RFPG). In: Redundancy in Mathematical Programming. Lecture Notes in Economics and Mathematical Systems, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45535-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-45535-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11552-6
Online ISBN: 978-3-642-45535-3
eBook Packages: Springer Book Archive