Author(s)

Demetrius V. Shapot, Alexander M. Lukatskii

Energy Research Institute, Russian Academy of Sciences, Moscow, Russia.

The known Fourier-Chernikov algorithm of linear inequality system convolution is complemented with an original procedure of all dependent (redundant) inequalities deletion. The concept of “almost dependent” inequalities is defined and an algorithm for further reducing the system by deletion of these is considered. The concluding algorithm makes it possible to hold actual-time convolution of a general inequality system containing up to 50 variables with the rigorous method of dependent inequalities deletion and up to 100 variables with the approximate method of one. The main application of such an approach consists in solving linear inequality system in an explicit form. These results are illustrated with a series of computer experiments.

Linear Inequalities; Convolution; Variable Elimination; Orthogonal Projection Method; Fourier Algorithm; Chernikov Rules; Dependent Inequalities; Redundant Inequalities; Almost Dependent Inequalities; Matrix Cleanup; Coarsening

D. Shapot and A. Lukatskii, "Solution Building for Arbitrary System of Linear Inequalities in an Explicit Form," American Journal of Computational Mathematics, Vol. 2 No. 1, 2012, pp. 1-11. doi: 10.4236/ajcm.2012.21001.