Skip to main content
Article thumbnail
Location of Repository

Analysis of mathematical programming problems prior to applying the simplex algorithm

By A. L. Brearley, G. Mitra and H. Paul Williams

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

Topics: QA Mathematics
Publisher: Springer
Year: 1975
DOI identifier: 10.1007/BF01580428
OAI identifier: oai:eprints.lse.ac.uk:31582
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.springer.com/mathem... (external link)
  • http://eprints.lse.ac.uk/31582... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.