Skip to main content
Log in

Minimality and complementarity properties associated with Z-functions and M-functions

  • Published:
Mathematical Programming Submit manuscript

Abstract

A nonlinear generalization of square matrices with non-positive off-diagonal elements is presented, and an algorithm to solve the corresponding complementarity problem is suggested. It is shown that the existence of a feasible solution implies the existence of a least solution which is also a complementary solution. A potential application of this nonlinear setup in extending the well-known linear Leontief input—output systems is discussed.

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.

Similar content being viewed by others

References

  1. R. Chandrasekaran, “A special case of the complementarity pivot problem”, Opsearch 7 (1970) 263–268.

    Google Scholar 

  2. R.W. Cottle and A.F. Veinott, Jr., “Polyhedral sets having a least element”,Mathematical Programming 3 (1972) 238–249.

    Google Scholar 

  3. M. Fiedler and V. Ptak, “On matrices with nonpositive off-diagonal elements and positive principal minors”,Czechoslovak Mathematical Journal 12 (1962) 382–400.

    Google Scholar 

  4. J.J. Moré, “Classes of functions and feasibility conditions on nonlinear complementarity problems”, Tech. Rept. 73-174, Department of Computer Science, Cornell University, Ithaca, N.Y. (1973).

    Google Scholar 

  5. J.J. Moré, “Coercivity conditions in nonlinear complementarity problems”, Tech. Rept. 72-146, Department of Computer Science, Cornell University, Ithaca, N.Y. (1972).

    Google Scholar 

  6. J.J. Moré and W.C. Rheinboldt, “On P- and S-functions and related classes ofn-dimensional nonlinear mappings”,Linear Algebra and Applications 6 (1973) 45–68.

    Google Scholar 

  7. W.C. Rheinboldt, “On M-functions and their applications to nonlinear Gauss—Seidel iterations and to network flows”,Journal of Mathematical Analysis and Applications 32 (1970) 274–307.

    Google Scholar 

  8. A. Tamir, “The complementarity problem of mathematical programming”, Ph.D. dissertation, Case Western Reserve University, Cleveland, Ohio (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tamir, A. Minimality and complementarity properties associated with Z-functions and M-functions. Mathematical Programming 7, 17–31 (1974). https://doi.org/10.1007/BF01585501

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation