Linear complementarity problems solvable by A single linear program

DOI10.1007/BF01580671zbMath0355.90040MaRDI QIDQ4127631

Olvi L. Mangasarian

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

90C05: Linear programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

Foreword: special issue for the 70th birthday of professor Olvi Mangasarian, Linear complementarity problems and multiple objective programming, On cone orderings and the linear complementarity problem, A simultaneous projections method for linear inequalities, Interior-point algorithms for global optimization, Vector equilibrium problems, minimal element problems and least element problems, Equivalence of equilibrium problems and least element problems, Generalizations of the hidden Minkowski property, Good hidden \(P\)-matrix sandwiches, Conjugate gradient method for the linear complementarity problem withs-matrix, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, A new characterization of real H-matrices with positive diagonals, Q-matrices and spherical geometry, Matrices and the linear complementarity problem, New methods for linear inequalities, A class of linear complementarity problems solvable in polynomial time, The equivalence of an LCP to a parametric linear program with a scalar parameter, Solution of symmetric linear complementarity problems by iterative methods, Hidden Z-matrices with positive principal minors, Degeneracy in linear complementarity problems: A survey, Generalized \(P_ 0\)- and \(Z\)-matrices, Linear complementarity and discounted switching controller stochastic games, On some classes of matrices related to solving linear complementarity problems as linear programs, New contraction methods for linear inequalities, Extended \(P\)-pairs, A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix, \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program, A finite improvement algorithm for the linear complementarity problem, On classes of inverse \(Z\)-matrices, A bilateral convergent bounding technique for plastic deformations, An exposition of the (linear) complementarity problem, Newton's method for linear complementarity problems, On characterizing linear complementarity problems as linear programs, A Simple P-Matrix Linear Complementarity Problem for Discounted Games, Iterative algorithms for the linear complementarity problem, Iterative methods for variational and complementarity problems, A note on an open problem in linear complementarity, On a class of least-element complementarity problems, An algorithm for the linear complementarity problem

Cites Work

• On the solution of large, structured linear complementarity problems: The tridiagonal case
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Complementary pivot theory of mathematical programming
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Minimality and complementarity properties associated with Z-functions and M-functions
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
• On the Alass of Complementary Cones and Lemke’s Algorithm
• Polyhedral sets having a least element
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item