| Linear Programming Duality: An Introduction to Oriented Matroids 1992 Edition Contributor(s): Bachem, Achim (Author), Kern, Walter (Author) |
|
 |
ISBN: 3540554173 ISBN-13: 9783540554172 Publisher: Springer OUR PRICE: $94.99 Product Type: Paperback Published: July 1992 Annotation: This book presents an elementary introduction to the theory of oriented matroids. The way oriented matroids are intro- duced emphasizes that they are the most general - and hence simplest - structures for which linear Programming Duality results can be stated and proved. The main theme of the book is duality. Using Farkas' Lemma as the basis the authors start withre- sults on polyhedra in Rn and show how to restate the essence of the proofs in terms of sign patterns of oriented ma- troids. Most of the standard material in Linear Programming is presented in the setting of real space as well as in the more abstract theory of oriented matroids. This approach clarifies the theory behind Linear Programming and proofs become simpler. The last part of the book deals with the facial structure of polytopes respectively their oriented matroid counterparts. It is an introduction to more advanced topics in oriented matroid theory. Each chapter contains suggestions for furt- herreading and the references provide an overview of the research in this field. |
| Additional Information |
| BISAC Categories: - Mathematics | Linear & Nonlinear Programming - Business & Economics | Economics - Theory - Business & Economics | Operations Research |
| Dewey: 511.6 |
| LCCN: 92014021 |
| Series: Universitext |
| Physical Information: 0.48" H x 6.14" W x 9.21" (0.72 lbs) 218 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: The main theorem of Linear Programming Duality, relating a "pri- mal" Linear Programming problem to its "dual" and vice versa, can be seen as a statement about sign patterns of vectors in complemen- tary subspaces of Rn. This observation, first made by R.T. Rockafellar in the late six- ties, led to the introduction of certain systems of sign vectors, called "oriented matroids". Indeed, when oriented matroids came into being in the early seventies, one of the main issues was to study the fun- damental principles underlying Linear Progra.mrning Duality in this abstract setting. In the present book we tried to follow this approach, i.e., rather than starting out from ordinary (unoriented) matroid theory, we pre- ferred to develop oriented matroids directly as appropriate abstrac- tions of linear subspaces. Thus, the way we introduce oriented ma- troids makes clear that these structures are the most general -and hence, the most simple -ones in which Linear Programming Duality results can be stated and proved. We hope that this helps to get a better understanding of LP-Duality for those who have learned about it before und a good introduction for those who have not. |