Skip to main content
Log in

A new theorem of the alternative

  • Published:
Mathematical Programming Submit manuscript

Abstract

Although the theorems of the alternative have been well known for a long time, their relationship to linear least squares problems and steepest descent directions was revealed only recently. This relationship was used by the author to derive a new theorem of the alternative. The present research extends this theorem to the p norm,p > 1.

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

Access this article

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

  • A. Dax, “The computation of descent directions at degenerate points,” Technical Report, Hydrological Service of Israel (Jerusalem, 1985).

    Google Scholar 

  • A. Dax, “A note on optimality conditions for the Euclidean multifacility location problem,”Mathematical Programming 36 (1986) 72–80.

    Google Scholar 

  • A. Dax, “The relationship between theorems of the alternative, least squares problems and steepest descent directions,” Technical Report, Hydrological Service of Israel (Jerusalem, 1988).

    Google Scholar 

  • A. Dax, “The 1 solution of linear equations subject to linear constraints,”SIAM Journal on Scientific and Statistical Computing 10 (1989) 328–340.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dax, A. A new theorem of the alternative. Mathematical Programming 47, 297–299 (1990). https://doi.org/10.1007/BF01580864

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation