Journal article
Crashing a maximum-weight complementary basis
Mathematical programming, Vol.54(1-3), pp.281-294
02/1992
DOI: 10.1007/BF01586055
Abstract
We consider the problem of finding a maximum-weight complementary basis of an m × 2 m matrix. The problem arises naturally, for example, when a complementary set of columns is proposed as an initial basis for a "warm start" of Lemke's algorithm, but the set of columns is rank-deficient. We show that the problem is a special case of the problem of finding a maximum-weight common base of two matroids. Furthermore, we show how to efficiently implement an algorithm for the general problem in the present context. Finally, we give computational results demonstrating the practicality of our algorithm in a typical application. © 1992 The Mathematical Programming Society, Inc.
Details
- Title: Subtitle
- Crashing a maximum-weight complementary basis
- Creators
- Kurt M. Anstreicher - Yale UniversityJon Lee - Yale UniversityThomas F. Rutherford - Western University
- Resource Type
- Journal article
- Publication Details
- Mathematical programming, Vol.54(1-3), pp.281-294
- DOI
- 10.1007/BF01586055
- ISSN
- 0025-5610
- eISSN
- 1436-4646
- Language
- English
- Date published
- 02/1992
- Academic Unit
- Business Analytics; Industrial and Systems Engineering; Computer Science
- Record Identifier
- 9984380453002771
Metrics
1 Record Views