Mathematical Programming Studies

Computational Mathematical Programming

Editors: Hoffman, K. L., Jackson, R. H. F., Telgen, J. (Eds.)

Buy this book

eBook  
  • ISBN 978-3-642-00933-4
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices

Table of contents (12 chapters)

  • An implicit enumeration procedure for the general linear complementarity problem

    Al-Khayyal, Faiz A.

    Pages 1-20

  • Recursive quadratic programming methods based on the augmented lagrangian

    Bartholomew-Biggs, M. C.

    Pages 21-41

  • A primal truncated newton algorithm with application to large-scale nonlinear network optimization

    Dembo, Ron. S.

    Pages 43-71

  • Approximating some convex programs in terms of borel fields

    Flåm, Sjur D.

    Pages 73-78

  • Computer-assisted analysis for diagnosing infeasible or unbounded linear programs

    Greenberg, Harvey J.

    Pages 79-97

Buy this book

eBook  
  • ISBN 978-3-642-00933-4
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Computational Mathematical Programming
Editors
  • K. L. Hoffman
  • R. H. F. Jackson
  • J. Telgen
Series Title
Mathematical Programming Studies
Series Volume
31
Copyright
1987
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-00933-4
DOI
10.1007/BFb0121175
Series ISSN
0303-3929
Edition Number
1
Number of Pages
192
Topics