9783540554172 - Linear Programming Duality: An Introduction To Oriented Matroids (Universitext) von Bachem, Achim (14 Ergebnisse)

Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 BAC 9783540554172 Sprache: Englisch Gewicht in Gramm: 550.

Softcover. 216 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-05199 3540554173 Sprache: Englisch Gewicht in Gramm: 550.

Softcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 BAC 9783540554172 Sprache: Englisch Gewicht in Gramm: 550.

Zustand: New. In.

PF. Zustand: New.

Paperback. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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.

paperback. Zustand: New. In shrink wrap. Looks like an interesting title!

paperback. Zustand: New. In shrink wrap. Looks like an interesting title!

Taschenbuch. Zustand: Neu. Linear Programming Duality | An Introduction to Oriented Matroids | Achim Bachem (u. a.) | Taschenbuch | Universitext | iv | Englisch | 1992 | Springer | EAN 9783540554172 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

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

Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 224 pp. Englisch.

Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 224 pp. Englisch.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Linear Programming Duality is one of the cornerstones in combinatorial optimization. The book is written by two authors who have been working in the field of combinatorial optimization for many years. They give an elementary introduction to the theory of or.