Skip to main content
SpringerLink
Log in
Book cover

Stochastic Programming pp 177–183Cite as

Stochastic construction of (q,M) problems

  • Part. II — Stochastic Optimization
  • Conference paper
  • First Online:

  • 176 Accesses

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 76))

Abstract

This paper is concerned with the pseudorandom generation of linear complementarity problems that possess a solution and are not easy to solve.

Work supported in part by Fondi Ministeriali per la Ricerca Scientifica (60%).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. M. Cirinà, “Complementarity”, Atti Convegno AMASES (Perugia) 1981, 93–100.

    Google Scholar 

  3. M. Cirinà, “Some (q,M) problems”, Atti Giornate AIRO (Como) 1982, 289–297.

    Google Scholar 

  4. R.W. Cottle, “Completely-2 matrices”, Math. Progr. 19 (1980) 347–351.

    Google Scholar 

  5. R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming”, Lin. Alg. and its Appl. 1 (1968) 103–125.

    Google Scholar 

  6. B.C. Eaves, “The linear complementarity problem”, Man. Science 17 (1971) 612–634.

    Google Scholar 

  7. H.W. Kuhn and A.W. Tucker, “Nonlinear programming”, in Proc. Second Berkeley Symposium on Mathematical Statistics and Probability, J. Neyman (editor), University of California Press (1951) 481–492.

    Google Scholar 

  8. C.E. Lemke, “Bimatrix equilibrium points and mathematical programming” Man. Science 11 (1965) 681–689.

    Google Scholar 

  9. O.L. Mangasarian, “Characterization of linear complementarity problems as linear programs”, Math. Progr. Study 7 (1978) 74–87.

    Google Scholar 

  10. K.G. Murty, “Computational complexity of complementary pivot methods” Math. Progr. Study 7 (1978) 61–73.

    Google Scholar 

  11. A. Prekopa, “On the development of optimization theory”, Amer. Math. Monthly 87 (1980) 527–542.

    Google Scholar 

  12. Van Der Heyden, “A variable dimension algorithm for the linear complementarity problem”, Math. Progr. 19 (1980) 328–346.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento Scienze dell'Informazione, Università di Torino, Corso d'Azeglio 42, Torino, Italy

    M. Cirinà

Authors
  1. M. Cirinà
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Archetti G. Di Pillo M. Lucertini

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Cirinà, M. (1986). Stochastic construction of (q,M) problems. In: Archetti, F., Di Pillo, G., Lucertini, M. (eds) Stochastic Programming. Lecture Notes in Control and Information Sciences, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006871

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16044-1

  • Online ISBN: 978-3-540-39729-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation