Abstract
In its abbreviated form АГЕΩΜΤΡΗΤΟΣ ΜΗ ΕΙΣΙΤΩ Plato’s dictum — in capital Greek letters, of course — was chiseled into the portal to the Athenean Academy and you find it today in the seal of the American Mathematical Society. Have you ever thought about what academy means? Probably not; but you are in academe and so here is the story. While Socrates (c. 470–399 B.C.) taught like so many before him in public — on the Athenean marketplace or ’Aγορά — Plato founded the Academy near Athens around 387 B.C. The word academy or ’ Aϰαδημία comes from its location in the grove of Academos so named after a mythological Attic hero.
Μηδείς άγεωμέτρητος είσίτω μου τήν στέγην.
Plato of Athens (c. 427–347 B.C.)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alevras, D. and M.P Rijal [ 1993 ] “The convex hull of a linear congruence relation in zero-one variables”, to appear in ZOR-Mathematical Methods of Operations Research 41.
Balas, E. and W. Pulleyblank [ 1983 ] “The perfectly matchable polytope of a bipartite graph”, Networks 13 495–516.
Bareiss, E.H. [ 1968 ] “Sylvester’s identity and multistep integer-preserving Gaussian elimination”, Mathematics of Computation 22 565–578.
Burger, E. [ 1956 ] “Über homogene lineare Ungleichungssysteme”, Zeitschrift für Angewandte Mathematik und Mechanik 36 135–139.
Carathéodory, C. [ 1911 ] “Über den Variabilitätsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen”, Rendiconti del Circolo Mathematic() di Palermo 32 193–217.
Carathéodory, C. [ 1935 ] Variationsrechnung und partielle Differentialgleichungen erster Ordnung, Teubner, Leipzig/Berlin.
Descartes, R. [ 1637 ] La Géometrie, republished as The geometry of René Descartes, D.S. Smith and M.L. Latham (transltrs.), Dover Publications, New York, 1954.
Erwe, F. [ 1964 ] Differential-und Integralrechnung I, I I, Bibliographisches Institut, Mannheim.
Gale, D. [ 1951 ] “Convex polyhedral cones and linear inequalities”, in Koopmans T. (ed) Activity Analysis of Production and Allocation, Wiley, New York, 287–297.
Gantmacher, F.R. [1958] Matrizenrechnung, Teil I und Teil //VEB Deutscher Verlag der Wissenschaften, Berlin. [German translation of the Russian original dated 1954.]
Gerstenhaber, M. [ 1951 ] “Theory of convex polyhedral cones”, in Koopmans T. (ed) Activity Analysis of Production and Allocation, Wiley, New York, 298–316.
Goldman, A.J. [ 1956 ] “Resolution and separation theorems for polyhedral convex sets” in Kuhn and Tucker (eds), Linear Inequalities and Related Systems, Princeton U. Press, Princeton, 41–51.
Goldman, A.J. and A.W. Tucker [ 1956 ] “Theory of linear programming”, in Kuhn and Tucker (eds), Linear Inequalities and Related Systems, Princeton U. Press, Princeton, 53–97.
Golub, G.H. and C.F.Van Loan [ 1983 ] Matrix Computations, The Johns Hopkins University Press, Baltimore.
Grötschel, M., L. Lovâsz and A. Schrijver [ 1988 ] Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin.
Grötschel, M. and M. Padberg [ 1985 ] “Polyhedral theory”, in Lawler, E. et al (eds) The Traveling Salesman Problem, Wiley, New York, Chapter 8.
Grünbaum, B. [ 1967 ] Convex Polytopes, Wiley, London.
Kuhn, H.W. and A.W.Tucker (eds) [ 1956 ] Linear Inequalities and Related Systems, Annals of Mathematics Studies 38, Princeton U. Press, Princeton.
Luther, H.A. and L.F. Guseman, Jr. [ 1962 ] “A finite sequentially compact process for the adjoints of matrices over arbitrary integral domains”, Comm. ACM 5 447–448.
Markowitz, H.M. [ 1957 ] “The elimination form of the inverse and its application to linear programming” Management Science 3 255–269.
McClellan, M.T. [ 1973 ] “The exact solution of systems of linear equations with polynomial coefficients”, J. ACM 20 563–588.
McMullen, P. and G.C. Shephard [ 1971 ] Convex polytopes and the upper bound conjecture, London Math.Soc. Lecture Notes Series 3, Cambridge University Press, London.
Minkowski, H. [1896] Geometrie der Zahlen (Erste Lieferung) Teubner, Leipzig.
Minkowski, H. [ 1897 ] “Allgemeine Lehrsätze über die konvexen Polyheder”, Nachrichten von der königlichen Gesellschaft der Wissenschaften zu Göttingen, math.physik. Klasse 198–219
Motzkin, T.S., H. Raiffa, G.L. Thompson and R.M. Thrall [ 1953 ] “The double description method” in Kuhn, H.W. and A.W. Tucker (eds) Contributions to the Theory of Games Vol. II, Princeton University Press, Princeton, 51 — 73.
Nemhauser, G.L. and L.A. Wolsey [ 1988 ] Integer and Combinatorial Optimization, Wiley, New York.
Padberg, M. and M.R. Rao [1980–1981] “The Russian method for linear inequalities, Parts I, II and III”, Preprints, New York University.
Padberg, M. and Ting-Yi Sung [ 1991 ] “An analytical comparison of different formulations of the travelling salesman problem”, Mathematical Programming 52 315–357.
Rockafellar, T. [ 1970 ] Convex Analysis, Princeton University Press, Princeton.
Schrijver, A. [ 1986 ] Theory of Linear and Integer Programming, Wiley, Chichester.
Simmonnard, M. [ 1966 ] Linear Programming, Prentice-Hall, Englewood Cliffs.
Stoer, J. and C. Witzgall [ 1970 ] Convexity and Optimization in Finite Dimensions I, Springer, Berlin.
Tietz, H. [ 1962 ] Vorlesung über Analytische Geometrie, Aschendorffsche Verlagsbuchhandlung, Münster/Westf.
Weyl, H. [ 1935 ] “Elementare Theorie der konvexen Polyeder”, Commentarii Mathematici Helvetici 7 290–306. [Translation in: Kuhn, H. and A. Tucker (eds) Contributions to the Theory of Games I, Princeton University Press, Princeton, 3–18.]
Yemelichev, V.A., M.M. Kovalev and M.K. Kravtsov [ 1984 ] Polytopes, Graphs and Optimisation translated by G.H. Lawden, Cambridge University Press, Cambridge.
Zurmühl, R. [1958] Matrizen,Springer Verlag, Berlin, 2nd edition.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Padberg, M. (1999). Analytical Geometry. In: Linear Optimization and Extensions. Algorithms and Combinatorics, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12273-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-12273-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08511-6
Online ISBN: 978-3-662-12273-0
eBook Packages: Springer Book Archive