Carlton E. Lemke
American mathematician
Carlton E. Lemke's AcademicInfluence.com Rankings
Download Badge
Mathematics
Carlton E. Lemke's Degrees
- Masters Mathematics University of California, Berkeley
- Bachelors Mathematics University of California, Berkeley
Similar Degrees You Can Earn
Why Is Carlton E. Lemke Influential?
(Suggest an Edit or Addition)According to Wikipedia, Carlton Edward Lemke was an American mathematician. After fighting in WWII with the 82nd Airborne Division, then under a GI grant, he received his bachelor's degree in 1949 at the University of Buffalo and his PhD in 1953 at Carnegie Mellon University . In 1952-1954 he was instructor at the Carnegie Institute of Technology and in 1954–55 at the Knolls Atomic Power Laboratory of General Electric. In 1955-56 he was an engineer at the Radio Corporation of America in New Jersey. From 1956 he was assistant professor and later professor at the Rensselaer Polytechnic Institute. Since 1967, he was there Ford Foundation Professor of Mathematics.
Carlton E. Lemke's Published Works
Published Works
- Bimatrix Equilibrium Points and Mathematical Programming (1965) (989)
- Equilibrium Points of Bimatrix Games (1964) (763)
- The dual method of solving the linear programming problem (1954) (212)
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems (1971) (129)
- On classes of copositive matrices (1970) (108)
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming (1967) (105)
- Minimization of non-linear separable convex functionals† (1954) (89)
- Recent results in complementarity problems (1970) (86)
- A Method of Solution for Quadratic Programs (1962) (71)
- Equivalence of LCP and PLS (1981) (57)
- Virtual work, linear programming and plastic limit analysis (1959) (55)
- Some pivot schemes for the linear complementarity problem (1978) (49)
- QUADRATIC FORMS SEMI-DEFINITE OVER CONVEX CONES. (1967) (42)
- Simplicial Approximation of an Equilibrium Point for Non-Cooperative N-Person Games (1973) (32)
- Computational Theory of Linear Programming. 1. The Bounded Variables Problem (1954) (26)
- On generalizing shapley's index theory to labelled pseudomanifolds (1976) (25)
- The Constrained Gradient Method of Linear Programming (1961) (18)
- A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem (1982) (16)
- Constructive proofs of theorems relating to:F(x) = y, with applications (1977) (16)
- On the Equivalence of the Linear Complementarity Problem and a System of Piecewise Linear Equations: Part II (1983) (4)
- Computational problems of linear programing (1952) (4)
- A DUAL DECOMPOSITION PRINCIPLE (1961) (3)
- Pathways to Solutions, Fixed Points, and Equilibria (C. B. Garcia and W. J. Zangwill) (1984) (3)
- Linear programming in industry, theory and applications, an introduction, by Sven Dan+, Springer-Verlag, Vienna, 1960, 120 pp (1961) (1)
- MULTI-COPY GENERALIZED NETWORKS AND MULTIPAGE PROGRAMS (1960) (1)
- Introduction to Sensitivity and Stability Analysis in Nonlinear Programming (Anthony V. Fiacco) (1985) (1)
- COMPUTATIONAL THEORY OF LINEAR PROGRAMMING. II. MINIMIZATION OF NON-LINEAR SEPARABLE CONVEX FUNCTIONALS (1954) (1)
- A COMPUTER PROGRAM FOR A CLASS OF NETWORK-TYPE OPTIMIZATION PROBLEMS (1960) (0)
- The Fourth International Conference on Complementarity Problems Dedicated to the Memory of (0)
This paper list is powered by the following services:
Other Resources About Carlton E. Lemke
What Schools Are Affiliated With Carlton E. Lemke?
Carlton E. Lemke is affiliated with the following schools: