In the 1820s Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set associated with the constraints is empty. We show here that Fourier's algorithm has an important hidden property: in effect it also computes the affine hull of the polyhedral set. This result is established by making use of a recent theorem on the independence of negative constraints.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Adler, I., ‘Equivalent linear programs’, Technical Report, Department of Operations Research, University of California at Berkeley (1976).
DantzigG. B. and EavesB. C., ‘Fourier-Motzkin elimination and its dual’, J. Combinational Theory Ser. A, 14, 288–297 (1973).
DuffinR. J., ‘On Fourier's analysis of linear inequality systems’, Math. Programming Study 1, 71–95 (1974).
FourierJ.-B. J., reported in: ‘Analyse des travaux de l'Academie Royale des Sciences, pendant l'annee 1824, Partie mathematique’, Histoire de l'Academie Royale des Sciences de l'Institut de France 7, xlvii-lv (1827) (Partial English translation in: D. A. Kohler, ‘Translation of a report by Fourier on his work on linear inequalities’, Opsearch 10, 38–42 (1973).
Irigoin, F. and Triolet, R., ‘Supernode partitioning’, Proc. 15th POPL, pp. 319–329 (1988).
JaffarJ., MichaylovS., StuckeyP. and YapR., ‘The CLP (ℜ) language and system’, ACM Transactions on Programming Languages and Systems 14(3), 339–395 (July 1992).
Lassez, J.-L., ‘Parametric queries, linear constraints and variable elimination’, Proc. Conference on Design and Implementation of Symbolic Computer Systems, Springer-Verlag Lecture Notes in Computer Science 429, pp. 164–173 (1990).
LassezJ.-L. and McAloonK., ‘A canonical form for generalized linear constraints’, J. Symbolic Computation 13, 1–24 (1992).
Lassez, J.-L., Huynh, T. and McAloon, K., ‘Simplification and elimination of redundant linear arithmetic constraints’, Proc. North American Conference on Logic Programming, pp. 37–51 (1989).
Schrijver, A., Theory of Linear and Integer Programming, Wiley (1986).
TelgenJ., ‘Minimal representation of convex polyhedral sets’, J. Optimization Theory and Application, 38, 1–24 (1982).
Williams, H. P., ‘Fourier's method of linear programming and its dual’, Amer. Math. Monthly, 681–695 (November 1986).
About this article
Cite this article
Lassez, J., Maher, M.J. On Fourier's algorithm for linear arithmetic constraints. Journal of Automated Reasoning 9, 373–379 (1992). https://doi.org/10.1007/BF00245296
- Linear arithmetic
- Fourier's algorithm
- implicit equality
- affine hull