Skip to main content
SpringerLink
Log in

Special simplex algorithm for multi-sector problems

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Abstract

This paper describes a proposed special algorithm for a certain class of partionable linear programming problems. The matrix defining such a linear programming problem consists of a number of non-zero diagonal blocks, plus some entirely filled rows and dito columns.

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. Heesterman, A. R. G., andJ. Sandee: Special simplex algorithm for linked problems. Management Science11, 420–427 (1965).

    Google Scholar 

  2. Beale, E. M. L.: The simplex method using pseudo-basic variables for structured linear programming problems (R. L. Graves and P. Wolfe, ed.). Recent advanced in Mathematical Programming, P. 133–148. New York: McGraw Hill Book Co. 1963.

    Google Scholar 

  3. Dantzig, G. B.: Linear programming and extensions. Princeton 1963 (in this reference especially p. 201–202 for chap. 4 of the present article).

  4. —— andP. Wolfs: A decomposition principle for linear programs. Operations Research8, 101–111 (1960).

    Google Scholar 

  5. Pigot, D.: L'application de la methode simplexe aux grands programmes lineares. In: Proceedings of the Second Int. Conf. on Operational Research, Aix en Provence, 1960 English University Press, London 1961, P. 376–381 (in this reference especially sec. 4.3 for chapter 3 of the present article).

    Google Scholar 

  6. Bennett, J. M.: Structured linear programming. Operations Research14, 636–645 (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Commerce and Social Science, University of Birmingham, 15, Birmingham, Great Britain

    A. R. G. Heesterman

Authors
  1. A. R. G. Heesterman
    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

Heesterman, A.R.G. Special simplex algorithm for multi-sector problems. Numer. Math. 12, 288–306 (1968). https://doi.org/10.1007/BF02162510

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation