Abstract:
Nonnegative large-scale linear programming problems with group constraints are extremely important for different applications in economics, technology, and other spheres. In this paper, we describe a new approach to preprocessing of these problems so that to reduce their dimensions considerably by defining and removing redundant constraints and variables.
PACS:02.60.Pn
Presented by the member of Editorial Board:L. B. Rapoport