Description

Book Synopsis

This book, first published in 2001, provides a general account of the development of simplicial algorithms. These include the ubiquitous simplex method of linear programming, widely used in industrial optimization and strategic decision making. They also include methods important in data analysis, such as problems involving very large data sets.

Trade Review

Review of the hardback: '… will be very useful to researchers and students in the field … will certainly serve as a standard reference on the subject for a long time.' Numerical Algorithms
Review of the hardback: 'The book has a rich content and can be recommended to all optimizers, it is even a good supplement for specialists.' Alfred Göpfert, Zentralblatt für Mathematik
Review of the hardback: 'The treatment is mathematical (definition, lemma, theorem, proof type of text) but attention is paid to algorithms and practical implementation aspects too. It is easy to read and a reference book for novice students as well as for implementors of the methods.' Bulletin of the Belgian Mathematical Society

Table of Contents

1. Some basic convex analysis; 2. Introduction to Polyhedra functions; 3. Linear programming algorithms; 4. Piecewise linear separable problems; 5. Rank regression problems; 6. Polyhedral constrained optimization.

Simplicial Algorithms for Minimizing Polyhedral Functions

    Product form

    A Hardback by M. R. Osborne

    £78.00

    Includes FREE delivery

    Order before 4pm on Thursday for delivery by Sat 5 Dec 2026.

    15 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Simplicial Algorithms for Minimizing Polyhedral Functions by M. R. Osborne

      Book details

      Published 8 January 2001
      ISBN-13 9780521791335
      978-0521791335
      ISBN-10 0521791332
      Also in:
      Optimization

      Description

      Book Synopsis

      This book, first published in 2001, provides a general account of the development of simplicial algorithms. These include the ubiquitous simplex method of linear programming, widely used in industrial optimization and strategic decision making. They also include methods important in data analysis, such as problems involving very large data sets.

      Trade Review

      Review of the hardback: '… will be very useful to researchers and students in the field … will certainly serve as a standard reference on the subject for a long time.' Numerical Algorithms
      Review of the hardback: 'The book has a rich content and can be recommended to all optimizers, it is even a good supplement for specialists.' Alfred Göpfert, Zentralblatt für Mathematik
      Review of the hardback: 'The treatment is mathematical (definition, lemma, theorem, proof type of text) but attention is paid to algorithms and practical implementation aspects too. It is easy to read and a reference book for novice students as well as for implementors of the methods.' Bulletin of the Belgian Mathematical Society

      Table of Contents

      1. Some basic convex analysis; 2. Introduction to Polyhedra functions; 3. Linear programming algorithms; 4. Piecewise linear separable problems; 5. Rank regression problems; 6. Polyhedral constrained optimization.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account