• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Linear Programming: Mathematics, Theory and Algorithms

Linear Programming: Mathematics, Theory and Algorithms

Paperback

Series: Applied Optimization, Book 2

General Mathematics

ISBN10: 1461334365
ISBN13: 9781461334361
Publisher: Springer Pg
Published: Jan 26 2012
Pages: 498
Weight: 1.56
Height: 1.03 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

General Mathematics