Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableaus, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableaus the beautiful termination theorem of RG Bland is proven more simply than here
Linear Programming: Mathematics, Theory and Algorithms
β Scribed by Michael J. Panik (auth.), Michael J. Panik (eds.)
- Publisher
- Springer US
- Year
- 1996
- Tongue
- English
- Leaves
- 502
- Series
- Applied Optimization 2
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ 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.
β¦ Table of Contents
Front Matter....Pages i-xi
Introduction and Overview....Pages 1-8
Preliminary Mathematics....Pages 9-68
Introduction to Linear Programming....Pages 69-88
Duality Theory....Pages 89-110
The Theory of Linear Programming....Pages 111-139
Duality Theory Revisited....Pages 141-168
Computational Aspects of Linear Programming....Pages 169-193
One-Phase, Two-Phase, and Composite Methods of Linear Programming....Pages 195-231
Computational Aspects of Linear Programming: Selected Transformations....Pages 233-250
The Dual Simplex, Primal-Dual, and Complementary Pivot Methods....Pages 251-288
Postoptimality Analysis I....Pages 289-318
Postoptimality Analysis II....Pages 319-340
Interior Point Methods....Pages 341-431
Interior Point Algorithms for Solving Linear Complementarity Problems....Pages 433-458
Back Matter....Pages 459-497
β¦ Subjects
Optimization; Operations Research/Decision Theory; Economic Theory; Game Theory, Economics, Social and Behav. Sciences
π SIMILAR VOLUMES
<p>Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than h
<p>This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of manageΒ ment, administration, transportation and a
<p><p>Recent years have seen a significant rise of interest in max-linear theory and techniques. In addition to providing the linear-algebraic background in the field of tropical mathematics, max-algebra provides mathematical theory and techniques for solving various nonlinear problems arising in ar
<p><p>Recent years have seen a significant rise of interest in max-linear theory and techniques. In addition to providing the linear-algebraic background in the field of tropical mathematics, max-algebra provides mathematical theory and techniques for solving various nonlinear problems arising in ar