Solution Building for Arbitrary System of Linear Inequalities in an Explicit Form

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.

[1]  A. Lotov,et al.  An algorithm for analyzing the independence of inequalities in a linear system , 1980 .

[2]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[3]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[4]  P. Sumathi,et al.  A Comparative Study of Redundant Constraints Identification Methods in Linear Programming Problems , 2010 .

[5]  Jean Baptiste Joseph Fourier,et al.  Oeuvres de Fourier: Solution d'une question particulière du calcul des inégalités , 2013 .

[6]  S. Keerthi,et al.  Solution of parametrized linear inequalities by Fourier elimination and its applications , 1990 .

[7]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[8]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[9]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[10]  A. I. Golikov,et al.  A new method for solving systems of linear equalities and inequalities , 2001 .

[11]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[12]  H. Raiffa,et al.  3. The Double Description Method , 1953 .

[13]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[15]  An estimate of the stability and the condition number of a set of solutions for a system of linear inequalities , 1986 .

[16]  A constructive algorithm for folding large-scale systems of linear inequalities , 2008 .

[17]  D. Chand,et al.  On Convex Polyhedra , 1970 .

[18]  Costas D Maranas,et al.  Elucidation and structural analysis of conserved pools for genome-scale metabolic reconstructions. , 2005, Biophysical journal.

[19]  On Linear Inequalities , 2014 .