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

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

Related Items (62)

On some classes of matrices related to solving linear complementarity problems as linear programs ⋮ Iterative methods for variational and complementarity problems ⋮ New contraction methods for linear inequalities ⋮ Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods ⋮ Multi-Product Price and Assortment Competition ⋮ On classes of inverse \(Z\)-matrices ⋮ Extended \(P\)-pairs ⋮ A bilateral convergent bounding technique for plastic deformations ⋮ The Linear Complementarity Problems with a Few Variables per Constraint ⋮ On characterizing linear complementarity problems as linear programs ⋮ A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix ⋮ Sufficient conditions for the unsolvability and solvability of the absolute value equation ⋮ Vector equilibrium problems, minimal element problems and least element problems ⋮ A new characterization of real H-matrices with positive diagonals ⋮ Q-matrices and spherical geometry ⋮ A generalized Newton method for a class of discrete-time linear complementarity systems ⋮ Absolute value equation solution via linear programming ⋮ Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities ⋮ A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem ⋮ A Simple P-Matrix Linear Complementarity Problem for Discounted Games ⋮ Continuous Selections of Solutions to Parametric Variational Inequalities ⋮ Absolute value equation solution via dual complementarity ⋮ Linear-step solvability of some folded concave and singly-parametric sparse optimization problems ⋮ Matrices and the linear complementarity problem ⋮ Counting unique-sink orientations ⋮ New methods for linear inequalities ⋮ Iterative algorithms for the linear complementarity problem ⋮ A class of linear complementarity problems solvable in polynomial time ⋮ \(\mathcal L\)-matrices and solvability of linear complementarity problems by a linear program ⋮ Picard splitting method and Picard CG method for solving the absolute value equation ⋮ The equivalence of an LCP to a parametric linear program with a scalar parameter ⋮ Enumeration of PLCP-orientations of the 4-cube ⋮ Equivalence of equilibrium problems and least element problems ⋮ Linear complementarity problems on extended second order cones ⋮ Generalizations of the hidden Minkowski property ⋮ Newton's method for linear complementarity problems ⋮ Linear complementarity problems and multiple objective programming ⋮ Foreword: special issue for the 70th birthday of professor Olvi Mangasarian ⋮ On hidden \(Z\)-matrix and interior point algorithm ⋮ A note on an open problem in linear complementarity ⋮ An exposition of the (linear) complementarity problem ⋮ Solution of symmetric linear complementarity problems by iterative methods ⋮ A nonnegative extension of the affine demand function and equilibrium analysis for multiproduct price competition ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms ⋮ Good hidden \(P\)-matrix sandwiches ⋮ Total dual integrality and integral solutions of the linear complementarity problem ⋮ On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem ⋮ On a class of least-element complementarity problems ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ Conjugate gradient method for the linear complementarity problem withs-matrix ⋮ A new concave minimization algorithm for the absolute value equation solution ⋮ Hidden Z-matrices with positive principal minors ⋮ An algorithm for the linear complementarity problem ⋮ On cone orderings and the linear complementarity problem ⋮ A finite improvement algorithm for the linear complementarity problem ⋮ More on hidden Z-matrices and linear complementarity problem ⋮ A simultaneous projections method for linear inequalities ⋮ Degeneracy in linear complementarity problems: A survey ⋮ Interior-point algorithms for global optimization ⋮ Generalized \(P_ 0\)- and \(Z\)-matrices ⋮ Linear, quadratic, and bilinear programming approaches to the linear complementarity problem ⋮ Linear complementarity and discounted switching controller stochastic games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Linear complementarity problems solvable by A single linear program