Abstract
Only comparatively recently, Fourier solvability algorithm for linear constraints has been shown to be of great theoretical interest in Linear Programming: the fundamental duality theorem and other major results are a direct consequence of it. We show here that Fourier algorithm plays a similar role in (linear) Symbolic Computation and Affine Geometry. From this algorithm we derive easily a number of interesting results, characterization of geometric objects and algorithms which form a basis for a practical system to reason about linear constraints.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Achmanov, Programmation Linéaire, Editions Mir, Moscon 1984.
H. Beringer, private communication.
G.B. Dantzig and B.C. Eaves, Fourier-Motzkin Elimination and its Dual, Journal of Combinatorial Theory Ser. A, 14 (1973) 288–297.
M.E. Dyer and L.G. Proll, An Algorithm for Determining All Extreme Points of a Convex Polytope, Mathematical Programming, 12 (1977) 81–96.
J.B.J. Fourier, reported in: Analyse des travaux de l'Académie Royale des Sciences, pendant l'année 1824, Partie mathématique, Histoire de l'Académie Royale des Sciences de l'Institut de France 7 (1827) xlvii–lv. (Partial English translation in: D.A. Kohler, Translation of a Report by Fourier on His Work on Linear Inequalities, Opsearch 10 (1973) 38–42.)
T. Gal, On the Structure of the Set Bases of a Degenerate Point, Journal of Optimization Theory and Applications, 45 (1985) 577–589.
T. Huynh, L. Joskowicz and C. Lassez, Reasoning about Linear Constraints, (forthcoming).
T. Huynh and J-L. Lassez, Practical Issues on the Projection of Polyhedral Sets, IBM Research Report, T.J. Watson Research Center, 1990.
H-J. Kruse, Degeneracy Graphs and the Neighborhood Problem, Springer Verlag Lecture Notes in Economics and Mathematical Systems No 260, 1986.
J-L. Lassez, Parametric Queries, Linear Constraints and Variable Elimination, Proceedings of DISCO 90, Springer Verlag Lecture Notes in Computer Science, 1990.
J.L. Lassez and M.J. Maher, On Fourier's Algorithm for Linear Arithmetic Constraints, IBM Research Report, T.J. Watson Research Center, 1988.
J-L. Lassez and K. McAloon, Applications of a Canonical Form for Generalized Linear Constraints, Proceedings of the FGCS Conference, Tokyo, December 1988, 703–710.
T.H. Matheiss and D.S. Rubin, A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets, Mathematics of Operations Research, 5 (1980) 167–185.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huynh, T., Lassez, C., Lassez, JL. (1990). Fourier algorithm revisited. In: Kirchner, H., Wechler, W. (eds) Algebraic and Logic Programming. ALP 1990. Lecture Notes in Computer Science, vol 463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53162-9_34
Download citation
DOI: https://doi.org/10.1007/3-540-53162-9_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53162-3
Online ISBN: 978-3-540-46738-0
eBook Packages: Springer Book Archive