Linear Programming: Mathematics, Theory and Algorithms

M. J. Panik

ISBN 10: 1461334365 / ISBN 13: 9781461334361

Published by Springer US, Springer US, 2012

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9781461334361

Bibliographic Details

• Title: Linear Programming: Mathematics, Theory and Algorithms
• Publisher: Springer US, Springer US
• Publication Date: 2012
• Language: English
• ISBN 10: 1461334365
• ISBN 13: 9781461334361
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 240W x 160H x 28D millimeters 240 millimeters width by 160 millimeters height by 28 millimeters depth
• Weight: 809 grams

About this title

Synopsis

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.

Review

` ... a carefully written textbook in a clear style. It is a very informative introduction to this field and may be recommended to students as well as to everybody interested in this special field of applied mathematics.'
Optimization, 43 (1998)