Brearley, A. L., Mitra, G. and Williams, H. Paul (1975) Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical Programming, 8 (1). pp. 54-83. ISSN 0025-5610
Full text not available from this repository.Abstract
Large practical linear and integer programming problems are not always presented in a form which is the most compact representation of the problem. Such problems are likely to posses generalized upper bound(GUB) and related structures which may be exploited by algorithms designed to solve them efficiently. The steps of an algorithm which by repeated application reduces the rows, columns, and bounds in a problem matrix and leads to the freeing of some variables are first presented. The lsquounbounded solutionrsquo and lsquono feasible solutionrsquo conditions may also be detected by this. Computational results of applying this algorithm are presented and discussed. An algorithm to detect structure is then described. This algorithm identifies sets of variables and the corresponding constraint relationships so that the total number of GUB-type constraints is maximized. Comparisons of computational results of applying different heuristics in this algorithm are presented and discussed.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.springer.com/mathematics/journal/10107 |
| Additional Information: | © 1975 North-Holland Publishing Company |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 24 Jan 2011 09:53 |
| Last Modified: | 13 Sep 2024 13:52 |
| URI: | http://eprints.lse.ac.uk/id/eprint/31582 |
Actions (login required)
 |
View Item |
