Balance constraints reduction of large-scale linear programming problems |
| |
Authors: | N Andrei M Barbulescu |
| |
Institution: | (1) Research Institute for Informatics, Analysis and Mathematical Modeling of Systems, 8-10 Bdl. Averescu, 71316 Bucharest, Romania |
| |
Abstract: | This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation. |
| |
Keywords: | Large-scale linear programming reduction and simplification interactive systems for LP |
本文献已被 SpringerLink 等数据库收录! |
|