Skip to main content
SpringerLink
Log in

Computational Mathematical Programming

  • Book
  • © 1987
  • Latest edition

Overview

Editors:
  1. K. L. Hoffman
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. R. H. F. Jackson
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. J. Telgen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Mathematical Programming Studies (MATHPROGRAMM, volume 31)

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

Access this book

Log in via an institution

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (12 chapters)

  1. Front Matter

    Download chapter PDF

  2. An implicit enumeration procedure for the general linear complementarity problem

    • Faiz A. Al-Khayyal
    Pages 1-20

  3. Recursive quadratic programming methods based on the augmented lagrangian

    • M. C. Bartholomew-Biggs
    Pages 21-41

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

    • Ron. S. Dembo
    Pages 43-71

  5. Approximating some convex programs in terms of borel fields

    • Sjur D. Flåm
    Pages 73-78

  6. Computer-assisted analysis for diagnosing infeasible or unbounded linear programs

    • Harvey J. Greenberg
    Pages 79-97

  7. Restricted simplicial decomposition: Computation and extensions

    • D. W. Hearn, S. Lawphongpanich, J.A. Ventura
    Pages 99-118

  8. Recent advances in the decomposition approach to linear programming

    • James K. Ho
    Pages 119-128

  9. A note on solution of nonlinear programming problems with imprecise function and gradient values

    • Michael Kupferschmid, J. G. Ecker
    Pages 129-138

  10. A new algorithm for highly curved constrained optimisation

    • Z. A. Maany
    Pages 139-154

  11. An implementation of an algorithm for univariate minimization and an application to nested optimization

    • Robert Mifflin
    Pages 155-166

  12. On practical stopping rules for the simplex method

    • Włodzimierz Ogryczak
    Pages 167-174

  13. An experimental approach to karmarkar’s projective method for linear programming

    • J. A. Tomlin
    Pages 175-191
Back to top

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation