A Least Element Theory of Solving Linear Complementarity Problems as Linear Programs.

Abstract

A previous report established a least-element interpretation to Mangasarian's theory of formulating some linear complementarity problems as linear programs. The present report extends the previous analysis to a more general class of linear complementarity problems investigated by Mangasarian. The purposes are (1) to demonstrate how solutions to these problems can be generated from least elements of polyhedral sets and (2) to investigate how these least-element solutions are related to the solutions obtained by the linear programming approach as proposed by Mangasarian.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1976
Accession Number
ADA044912

Entities

People

  • Jong-shi Pang
  • Richard Cottle

Organizations

  • Stanford University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Convex Programming
  • Interdisciplinary Science
  • Linear Algebra
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Matrix Theory
  • Military Research
  • Operations Research
  • Simplex Method
  • Systems Science
  • Theorems
  • United States
  • United States Government

Readers

  • Operations Research