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

Abstract

In a previous report the authors have established a least-element interpretation to Mangasarian's theory of formulating some linear complementarity problems as linear programs. In the present report a previous analysis to a more general class of linear complementarity problems investigated in Mangasarian is carried out. This report demonstrates how solutions to these problems can be generated from least elements of polyhedral sets and investigates 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
ADA034464

Entities

People

  • Jong-shi Pang
  • Richard Cottle

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Computer Programming
  • Evolutionary Algorithms
  • Linear Algebra
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Matrix Theory
  • North Carolina
  • Operations Research
  • Simplex Method
  • Theorems
  • United States
  • Universities
  • Wisconsin

Readers

  • Operations Research