Skip to main content
SpringerLink
Log in

Analysis of mathematical programming problems prior to applying the simplex algorithm

  • Published:
Mathematical Programming Submit manuscript

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 ‘unbounded solution’ and ‘no feasible solution’ 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. APEX II, User Information Manual, 59158100 Rev. Control Data Corporation, Minneapolis, U.S.A.

  2. E. Balas, “An additive algorithm for solving linear programs with zero–one variables”,Operations Research 13 (1965) 517–546.

    Google Scholar 

  3. E.M.I. Beale, “Advanced algorithmic features for general mathematical programming systems”, in: J. Abadie, ed., Integer and nonlinear programming (North Holland, Amsterdam, 1970) pp. 119–138.

    Google Scholar 

  4. G.B. Dantzig and R.M. VanSlyke, “Generalized upper bounded techniques for linear programming”, I, II, Operations Research Centre, University of California, Berkeley, Calif., ORC 64-17, 18.

  5. J. Haldi, “25 integer programming test problems”, Working Paper No. 43, Graduate School of Business, Stanford University, Stanford, Calif. (1964).

    Google Scholar 

  6. A. Land and S. Powell, “FORTRAN codes for mathematical programming, linear, quadratic and discrete problems (Wiley, New York, 1973).

    Google Scholar 

  7. Mathematical Programming System Extended (MPSX), Program Number 5734 XM4, IBM Trade Corporation, New York (1971).

    Google Scholar 

  8. G. Mitra, “A generalized row elimination algorithm for exclusive row structure problems”, ICL/DATASKIL Internal Rept. (1972).

  9. S. Senju and Y. Toyoda, “An approach to linear programming with 0–1 variables”,Management Science (4) (1968) B196–B207.

  10. H.P. Williams, “Experiments in the formulation of integer programming problems”, to appear.

  11. F.P. Wyman, “Binary programming: a decision rule for selecting optimal vs heuristic techniques”,Computer Journal 16 (2) (1973) 135–140.

    Google Scholar 

  12. G. Zoutendijk, “A product form algorithm using contracted transformation vectors”, in: J. Abadie, ed., Integer and nonlinear programming (North-Holland, Amsterdam, 1970) pp. 511–523.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Industrial and Business Studies, University of Warwick, Coventry, UK

    A. L. Brearley

  2. Dept. of Statistics & Operational Research, Brunel University, Middlesex, UK

    G. Mitra

  3. UNICOM Consultants, U.K. Ltd., UK

    G. Mitra

  4. Dept. of Operational Research, University of Sussex, Falmer, Brighton, UK

    H. P. Williams

Authors
  1. A. L. Brearley
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. P. Williams
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brearley, A.L., Mitra, G. & Williams, H.P. Analysis of mathematical programming problems prior to applying the simplex algorithm. Mathematical Programming 8, 54–83 (1975). https://doi.org/10.1007/BF01580428

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01580428

Keywords

Search

Navigation