Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Tag Display
Catalogue Tag Display
MARC 21
Linear Programming Duality: An Introduction to Oriented Matroids /
Tag
Description
020
$a9783642581526$9978-3-642-58152-6
082
$a519.6$223
099
$aOnline resource: Springer
100
$aBachem, Achim.
245
$aLinear Programming Duality$h[EBook] :$bAn Introduction to Oriented Matroids /$cby Achim Bachem, Walter Kern.
260
$aBerlin, Heidelberg :$bSpringer Berlin Heidelberg :$bImprint: Springer,$c1992.
300
$aIV, 218 p.$bonline resource.
336
$atext$btxt$2rdacontent
337
$acomputer$bc$2rdamedia
338
$aonline resource$bcr$2rdacarrier
440
$aUniversitext,$x0172-5939
505
$a
1 Prerequisites -- 7.1 Sets and Relations -- 10.2 Linear Algebra -- 14.3 Topology -- 15.4 Polyhedra -- 2 Linear Duality in Graphs -- 2.1 Some Definitions -- 2.2 FARKAS’ Lemma for Graphs -- 2.3 Subspaces Associated with Graphs -- 2.4 Planar Graphs -- 2.5 Further Reading -- 3 Linear Duality and Optimization -- 3.1 Optimization Problems -- 3.2 Recognizing Optimal Solutions -- 3.3 Further Reading -- 4 The FARKAS Lemma -- 4.1 A first version -- 4.2 Homogenization -- 4.3 Linearization -- 4.4 Delinearization -- 4.5 Dehomogenization -- 4.6 Further Reading -- 5 Oriented Matroids -- 5.1 Sign Vectors -- 5.2 Minors -- 5.3 Oriented Matroids -- 5.4 Abstract Orthogonality -- 5.5 Abstract Elimination Property -- 5.6 Elementary vectors -- 5.7 The Composition Theorem -- 5.8 Elimination Axioms -- 5.9 Approximation Axioms -- 5.10 Proof of FARKAS’ Lemma in OMs -- 5.11 Duality -- 5.12 Further Reading -- 6 Linear Programming Duality -- 6.1 The Dual Program -- 6.2 The Combinatorial Problem -- 6.3 Network Programming -- 6.4 Further Reading -- 7 Basic Facts in Polyhedral Theory -- 7.1 MINKOWSKI’S Theorem -- 7.2 Polarity -- 7.3 Faces of Polyhedral Cones -- 7.4 Faces and Interior Points -- 7.5 The Canonical Map -- 7.6 Lattices -- 7.7 Face Lattices of Polars -- 7.8 General Polyhedra -- 7.9 Further Reading -- 8 The Poset (O, ?) -- 8.1 Simplifications -- 8.2 Basic Results -- 8.3 Shellability of Topes -- 8.4 Constructibility of O -- 8.5 Further Reading -- 9 Topological Realizations -- 9.1 Linear Sphere Systems -- 9.2 A Nonlinear OM -- 9.3 Sphere Systems -- 9.4 PL Ball Complexes -- 9.5 Further Reading.
538
$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
700
$aKern, Walter.$eauthor.
710
$aSpringerLink (Online service)
830
$aUniversitext,$x0172-5939
856
$u
http://dx.doi.org/10.1007/978-3-642-58152-6
Quick Search
Search for