Skip to main content
SpringerLink
Log in

Some experiments with the pathological linear programs of N. Zadeh

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

Computational results are presented which show that N. Zadeh's pathological examples for the simplex algorithm apparently take a number of pivots approximately proportional to the number of columns in the tableau when its column order is randomized.

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

Reference

  1. N. Zadeh, “A bad network problem for the simplex method and other minimum-cost flow algorithms”,Mathematical Programming 5 (1973) 255–266.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Princeton University, Princeton, NJ, USA

    William P. Niedringhaus & Kenneth Steiglitz

Authors
  1. William P. Niedringhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth Steiglitz
    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

Niedringhaus, W.P., Steiglitz, K. Some experiments with the pathological linear programs of N. Zadeh. Mathematical Programming 15, 352–354 (1978). https://doi.org/10.1007/BF01609040

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation