New crash procedures for large systems of linear constraints (Q584077): Difference between revisions

Many algorithms for solving linearly constrained optimization problems maintain sets of basic variables. The calculation of the initial basis is of great importance as it determines to a large extent the amount of computation that will then be required to solve the problem. This paper presents a number of simple methods for obtaining an initial basis and tests to indicate how they perform on a variety of real-life problems.