Description

Book Synopsis
A comprehensive, up-to-date text on linear programming. Covers all practical modeling, mathematical, geometrical, algorithmic, and computational aspects. Surveys recent developments in the field, including the Ellipsoid method. Includes extensive examples and exercises.

Table of Contents
Formulation of Linear Programs.

The Simplex Method.

The Geometry of the Simplex Method.

Duality in Linear Programming.

Revised (Primal) Simplex Method.

The Dual Simplex Method.

Numerically Stable Forms of the Simplex Method.

Parametric Linear Programs.

Sensitivity Analysis.

Degeneracy in Linear Programming.

Bounded-Variable Linear Programs.

The Decomposition Principle of Linear Programming.

The Transportation Problem.

Computational Complexity of the Simplex Algorithm.

The Ellipsoid Method.

Iterative Methods for Linear Inequalities and Linear Programs.

Vector Minima.

Index.

Linear Programming

    Product form

    A Paperback / softback by Katta G. Murty

    £206.06

    Includes FREE delivery

    RRP £228.95 – you save £22.89 (9%)

    Order before 4pm today for delivery by Mon 14 Sep 2026.

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

      View other formats and editions of Linear Programming by Katta G. Murty

      Book details

      Publisher John Wiley & Sons Inc
      Published 30 November 1983
      ISBN-13 9780471097259
      978-0471097259
      ISBN-10 047109725X
      Also in:
      Mathematics Applied mathematics Linear programming

      Description

      Book Synopsis
      A comprehensive, up-to-date text on linear programming. Covers all practical modeling, mathematical, geometrical, algorithmic, and computational aspects. Surveys recent developments in the field, including the Ellipsoid method. Includes extensive examples and exercises.

      Table of Contents
      Formulation of Linear Programs.

      The Simplex Method.

      The Geometry of the Simplex Method.

      Duality in Linear Programming.

      Revised (Primal) Simplex Method.

      The Dual Simplex Method.

      Numerically Stable Forms of the Simplex Method.

      Parametric Linear Programs.

      Sensitivity Analysis.

      Degeneracy in Linear Programming.

      Bounded-Variable Linear Programs.

      The Decomposition Principle of Linear Programming.

      The Transportation Problem.

      Computational Complexity of the Simplex Algorithm.

      The Ellipsoid Method.

      Iterative Methods for Linear Inequalities and Linear Programs.

      Vector Minima.

      Index.

      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