Linear Programming: Mathematics, Theory and Algorithms

by Michael J. Panik (Author)

Imported Edition

Delivered in 14-21 working days

Free shipping

Online price: ₹Rs23,142 ₹Rs22,448

You save ₹Rs694

Login/Register to add this product to a wishlist.

You will be asked to pay the full amount when your item is delivered. Only cash is accepted for this type of order. Pay Cash on Delivery

Format: Hardcover

Synopsis of Linear Programming: Mathematics, Theory and Algorithms

Linear Programming provides an in-depth look at simplex based as well as the more recent interior point techniques for solving linear programming problems. Starting with a review of the mathematical underpinnings of these approaches, the text provides details of the primal and dual simplex methods with the primal-dual, composite, and steepest edge simplex algorithms. This then is followed by a discussion of interior point techniques, including projective and affine potential reduction, primal and dual affine scaling, and path following algorithms. Also covered is the theory and solution of the linear complementarity problem using both the complementary pivot algorithm and interior point routines. A feature of the book is its early and extensive development and use of duality theory. Audience: The book is written for students in the areas of mathematics, economics, engineering and management science, and professionals who need a sound foundation in the important and dynamic discipline of linear programming.

Product details

  • Pages: 508
  • Publisher: Kluwer Academic Publishers
  • Published: December 1995
  • Language: English
  • ISBN: 9780792337829
  • Category: Mathematics

Reviews of Linear Programming: Mathematics, Theory and Algorithms

Read customer reviews on this product. If you have read this book, why not post your own review?

Be the first to review this product

Also by Michael J. Panik

Recently viewed by you

Wishlist (x items)
  • hello
Compare (0 items, 0 selected)
Compare selected Deselect all Remove all

Only items of the same type can be compared.