Separating support hyperplanes for a pair of convex polyhedral sets

References

• Bair , J. , Jongmans , F. , Berge , C. and Ghouila - Houri , A. 1965 . Programming, Games and Transportation Networks , New York : John Wiley and Sons. Inc .
   Google Scholar
• Berge C. Ghouila - Houri A. Programming, Games and Transportation Networks John Wiley and Sons. Inc. New York 1965
   Google Scholar
• Dyer , M.E. 1983 . The Complexity of Vertex Enumeratio Methods . Mathematics of' Operations Research , 8 : 381 – 402 .
   Web of Science ®Google Scholar
• Dyer , M.E. and Proll , L.G. 1977 . An Algorithm for Determining All Extreme Points of a Convex Polytope . Mathematical Programming , 12 : 81 – 96 .
   Web of Science ®Google Scholar
• Elster , K.H. , Reinhardt , M. , Schäuble , M. and Donath , G. 1977 . Einfíhrung in die nichtlineare Optimierung , Leipzig : BSB B. G . Teubncr Verlagsgesellschaft .
   Google Scholar
• Gal , T. 1975 . Zur Identifikation Redundanter Nebenbedingungen in Linearen Programmen . Zeitschrft fúr Operations Research , 19 : 19 – 28 .
   Google Scholar
• Grygarová , L. 1997 . A calculation of all separating hyperplanes of two convex polytopes . Optimi:ation , 41 : 57 – 69 .
   Google Scholar
• Grygarová , L. 1997 . On a calculation of an arbitrary separating hyperplane of convex polyhedral sets . Optimi:ation , 43 : 93 – 112 .
   Google Scholar
• Horst , R. Nichtliueare Optimierung
   Google Scholar
• Karwan , M.H. , Lotfi , V. , Telgen , J. and Zionts , S. 1983 . “ Redundancy in Mathematical Programming ” . In A State of the Art Survey , Vol. 206 , Berlin : Springer-Verlag . Lecture Notes in Economic and Mathematical Systems
   Google Scholar
• Khang , D.B. and Fujiwara , O. 1989 . A New Algorithm to Find All Vertices of a Polytope . Operations Researcll Letters , 8 : 261 – 264 .
   Google Scholar
• Klee , V. 1969 . “ Separation and supporl properties of convex sets - a survey ” . In Control Theory and the Calculus of Variations , Edited by: Balakrishnan , A.V. 235 – 303 . London, New York : Academic Press .
   Google Scholar
• Lempio , F. 1971 . “ Separation und Optimierung in linearen Räumen ” . In Dissertation , Univ. Hamburg. .
   Google Scholar
• Luenberger , D.G. 1973 . Introduction to linear and nonlinear Programming , Addision - Wesley Publishing Company .
   Google Scholar
• Mañas , M. and Nedoma , J. 1968 . Finding Ail Vertices of a Convex Polyhedron . Numerische Mathernctfik , 12 : 226 – 229 .
   Web of Science ®Google Scholar
• Martos , B. 1975 . “ Nonlinear Programming ” . In Theory and Methods , Budapest : Akadémiai Kiadó .
   Google Scholar
• Mattheis , T.H. 1973 . An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities . Operations Research , 21 : 247 – 260 .
   Google Scholar
• Mattheis , T.H. and Rubin , D.S. 1980 . A Survey and Comparison ofMethods for Finding all Vertices of Convex Polyhedral Sets . Mathenlatics of Operations Research , 5 : 167 – 184 .
   Google Scholar
• Nožiča , F. , Grygarová , L. and Lommatzsch , K. 1988 . Geometrie Konvexer Mengen und konvexe Analysis , Berlin : Akademie-Verlag .
   Google Scholar
• Nožiča , F. , Guddat , J. , Hollatz , H. and Bank , B. 1974 . Theorie der Linearen Parametrischen Optimierung , Berlin : Akademie-Verlag .
   Google Scholar
• Rockafellar , R.T. Convex Analysis , Princeton : Princeton University Press . New Jersey
   Google Scholar
• Stoer , J. and Witzgall , C. Convexity and Optimization in finite Dimension I , Berlin : Springer-Verlag . Heidelberg
   Google Scholar
• Telgen J. Redundancy and Linear Programming Erasmus University Rotterdam 1979 Ph.D. Thesis
   Google Scholar