|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2008, Volume 48, Number 7, Pages 1167–1180
(Mi zvmmf4557)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
A constructive algorithm for folding large-scale systems of linear inequalities
A. M. Lukatskii, D. V. Shapot Energy Research Institute, Russian Academy of Sciences, Nagornaya ul. 31-2, Moscow, 117186, Russia
Abstract:
The conventional procedure for folding a system of linear inequalities based on the Fourier–Chernikov algorithm is supplemented with techniques for eliminating redundant inequalities, which considerably counteracts the increase in the system dimension. Exact and approximate methods are proposed, which are brought to algorithmic form and software implementation. Numerical results are discussed.
Key words:
convex polyhedra, linear inequalities, orthogonal projection method, Fourier–Chernikov algorithm, coordination of ranges, redundant inequalities, complete elimination of redundant inequalities, simplex method, elimination of redundant inequalities with coarsening, numerical experiments.
Received: 30.11.2007 Revised: 01.02.2008
Citation:
A. M. Lukatskii, D. V. Shapot, “A constructive algorithm for folding large-scale systems of linear inequalities”, Zh. Vychisl. Mat. Mat. Fiz., 48:7 (2008), 1167–1180; Comput. Math. Math. Phys., 48:7 (2008), 1100–1112
Linking options:
https://www.mathnet.ru/eng/zvmmf4557 https://www.mathnet.ru/eng/zvmmf/v48/i7/p1167
|
Statistics & downloads: |
Abstract page: | 376 | Full-text PDF : | 188 | References: | 57 | First page: | 3 |
|