scientific article; zbMATH DE number 3332062

zbMath0208.45503MaRDI QIDQ5608987

George B. Dantzig, Richard W. Cottle

Publication date: 1968

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Game theory (91A99)

Related Items (21)

A numerical scheme for integrating the rate plasticity equations with an a priori error control ⋮ A new subclass of \(Q_0\)-matrix in linear complementarity theory ⋮ A new simple homotopy algorithm for linear programming. I ⋮ An enumerative method for the solution of linear complementarity problems ⋮ Existence results for vector mixed quasi-complementarity problems ⋮ On the basic theorem of complementarity ⋮ Vector mixed quasi complementarity problems in Banach spaces ⋮ A generalized conjugate gradient algorithm for solving a class of quadratic programming problems ⋮ A complementary variant of Lemke's method for the linear complementary problem ⋮ Generalized AOR method for solving absolute complementarity problems ⋮ Generalized vector implicit complementarity problems with corresponding variational inequality problems ⋮ A numerically stable dual method for solving strictly convex quadratic programs ⋮ A unification of the existence theorems of the nonlinear complementarity problem ⋮ On the average number of steps of the simplex method of linear programming ⋮ A class of polynomially solvable linear complementarity problems ⋮ Generalized vector complementarity-type problems in topological vector spaces ⋮ More with the Lemke complementarity algorithm ⋮ The principal pivoting method revisited ⋮ On the average speed of Lemke's algorithm for quadratic programming ⋮ Fully copositive matrices ⋮ An application of Lemke's method to a class of Markov decision problems

This page was built for publication: