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.
By:
M.J. Panik Imprint: Springer-Verlag New York Inc. Country of Publication: United States Edition: Softcover reprint of the original 1st ed. 1996 Volume: 2 Dimensions:
Height: 240mm,
Width: 160mm,
Spine: 26mm
Weight: 809g ISBN:9781461334361 ISBN 10: 1461334365 Series:Applied Optimization Pages: 498 Publication Date:26 January 2012 Audience:
College/higher education
,
Professional and scholarly
,
Further / Higher Education
,
Undergraduate
Format:Paperback Publisher's Status: Active
Reviews for Linear Programming: Mathematics, Theory and Algorithms
... 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)