Skip to main content
SpringerLink
Log in

Redundancy elimination with a lexicographic solved form

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. Alziary de Roquefort, Les apports des méthodes syntaxiques pour la détection des redondances dans les systèmes d'inéquations linéaires, Mémoire de DEA, Laboratoire d'Informatique de Clermont-Ferrand, France (1994).

    Google Scholar 

  2. A.L. Brearly, G. Mitra and H.P. Williams, Analysis of mathematical programming problems prior to applying the simplex method,Math. Program. 8 (1975) 54–83.

    Google Scholar 

  3. P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program,Proc. Fifth Annual ACM Symp. on Principles of Programming Languages, Tucson, Arizona (1978).

  4. G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, New Jersey, 1963).

    Google Scholar 

  5. N. Halbwachs, P. Raymond and Y.-E. Proy, Verification of linear hybrid systems by means of convex approximations,Proc. First Symp. on Static Analysis (SAS-94), Namur, Belgium (1994).

  6. J.L. Imbert, About redundant inequalities generated by Fourier's algorithm,AIMSA'90, Fourth Int. Conf. on Artificial Intelligence: Methodology, Systems, Applications, Albena-Varna, Bulgaria (1990).

  7. M.H. Karwan, V. Lofti, J. Telgen and S. Zionts,Redundancy in Mathematical Programming: A State-of-the-Art Survey, Lecture Notes in Economics and Mathematical Systems, Vol. 206 (Springer, 1983).

  8. D.A. Kolher, Projection of convex polyhedral sets, Ph.D. Thesis, University of California, Berkeley (1967).

    Google Scholar 

  9. J.-L. Lassez and K. McAloon, Applications of a canonical form for generalized linear constraints,Proc. Int. Conf. on Fifth Generation Computer Systems, Tokyo, Japan (1988).

  10. J.-L. Lassez, T. Huynh and K. McAloon, Simplification and elimination of redundant linear arithmetic constraints, in:Constraint Logic Programming: Selected Research, eds. F. Benhamou and A. Colmerauer (MIT Press, Cambridge, USA, 1993) pp. 73–87.

    Google Scholar 

  11. A. Shrijver,Theory of Linear and Integer Programming, Interscience Series in Discrete Mathematics and Optimization (Wiley, 1986).

  12. J. Telgen,Redundancy and Linear Programs, Mathematical Centre Tracts 137 (Mathematisch Centrum, Amsterdam, 1981).

    Google Scholar 

  13. P. Van Hentenryck and T. Graf, Standard forms for rational linear arithmetics in constraint logic programming,Ann. of Math. and AI 5 (1992) 303–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. Informatique de Clermont-Ferrand, Complexe Universitaire des Cezaux, F-63177, Aubiere Cedex, France

    J-L. Imbert

  2. Department of Computer Science, Brown University, Box 1910, 02912, Providence, RI, USA

    P. Van Hentenryck

Authors
  1. J-L. Imbert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Van Hentenryck
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Imbert, JL., Van Hentenryck, P. Redundancy elimination with a lexicographic solved form. Ann Math Artif Intell 17, 85–106 (1996). https://doi.org/10.1007/BF02284625

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02284625

Keywords

Search

Navigation