On Solving Linear Complementarity Problems as Linear Programs.

Abstract

Recently, the idea of solving certain classes of linear complementarity problems as linear programs was discussed. The present paper (1) demonstrates how these complementarity problems are related to the theory of polyhedral sets having least elements and (2) discusses the question of whether the linear programming approach can be recommended for solving them.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1976
Accession Number
ADA025725

Entities

People

  • Jong-shi Pang
  • Richard Cottle

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Computations
  • Computer Programming
  • Differential Equations
  • Equations
  • Inequalities
  • Iterations
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Notation
  • Observation
  • Operations Research
  • Permutations
  • Simplex Method

Readers

  • Operations Research