A Constructive Algorithm for Folding Large-Scale Systems of Linear Inequalities

被引：2
|
作者：
Lukatskii, A. M. [1 ]
Shapot, D. V. [1 ]
机构：
[1] Russian Acad Sci, Energy Res Inst, Moscow 117186, Russia
来源：
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 2008年 / 48卷 / 07期
关键词：
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;
D O I：
10.1134/S0965542508070038
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：1100 / 1112
页数：13
相关论文
共 50 条
12345