Linear Programming Duality: An Introduction to Oriented Matroids by Achim Bachem , Walter Kern
English | PDF | 1992 | 215 Pages | ISBN : 3540554173 | 15.4 MB
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.