Linear Programming Duality

Bol

Linear Programming Duality is one of the cornerstones in combinatorial optimization. Giving an elementary introduction to the theory of oriented matroids, this book presents an approach which clarifies the theoretical basis of linear programming and also simplifies the proofs of standard results. This book presents an elementary introduction to the theoryof oriented matroids. The way oriented matroids are intro-duced emphasizes that they are the most general - and hencesimplest - structures for which linear Programming Dualityresults can be stated and proved. The main theme of the bookis duality. Using Farkas' Lemma as the basis the authors start withre-sults on polyhedra in Rn and show how to restate the essenceof the proofs in terms of sign patterns of oriented ma-troids. Most of the standard material in Linear Programmingis presented in the setting of real space as well as in themore abstract theory of oriented matroids. This approachclarifies the theory behind Linear Programming and proofsbecome simpler. The last part of the book deals with the facial structure ofpolytopes respectively their oriented matroid counterparts. It is an introduction to more advanced topics in orientedmatroid theory. Each chapter contains suggestions for furt-herreading and the references provide an overview of theresearch in this field.

Amazon

Pagina's: 222, Editie: 1992, Paperback, Springer