Further Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Program,

Abstract

Mangasarian developed necessary and sufficient conditions under which a linear complementary problem can be solved as a linear program. These conditions include strict inequality systems which are difficult to apply. Using a bilinear programming approach and column scaling, we are able to derive further simplified conditions which replace the strict inequality systems with equations. Our simplified conditions yield new, checkable special cases of linear complementarity problems that are solvable as linear programs. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1986
Accession Number
ADA173327

Entities

People

  • Faiz A. Al-khayyal

Organizations

  • Georgia Tech

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Engineering
  • Industrial Engineering
  • Inequalities
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Numerical Analysis
  • Operations Research
  • Systems Engineering

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Operations Research