C. E. Lemke
27 works · 3,553 citations · h-index 18
Top works
- Bimatrix Equilibrium Points and Mathematical Programming
- Minimization of non‐linear separable convex functionals
- Equilibrium Points of Bimatrix Games
- The dual method of solving the linear programming problem
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- Recent Results on Complementarity Problems
- A Method of Solution for Quadratic Programs
- Equilibrium points of bimatrix games
- On classes of copositive matrices
- QUADRATIC FORMS SEMI-DEFINITE OVER CONVEX CONES
- Virtual work, linear programming and plastic limit analysis
- Equivalence of LCP and PLS
- The Constrained Gradient Method of Linear Programming
- On generalizing shapley's index theory to labelled pseudomanifolds
- Some pivot schemes for the linear complementarity problem
- Simplicial Approximation of an Equilibrium Point for Non-Cooperative N-Person Games
- Constructive proofs of theorems relating to:F(x) = y, with applications
- COMPUTATIONAL THEORY OF LINEAR PROGRAMMING. II. MINIMIZATION OF NON-LINEAR SEPARABLE CONVEX FUNCTIONALS
- A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem