Two Characterizations of Sufficient Matrices

Abstract

Two characterizations are given for the class of sufficient matrices defined by Cottle, Pang and Venkateswaran. The first is a direct translation of the definition into linear programming terms. The second can be thought of as a generalization of a theorem of T.D. Parsons on P-matrices.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1991
Accession Number
ADA230319

Entities

People

  • Richard Cottle
  • Sy-ming Guu

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Operations Research
  • Optimization
  • Systems Science
  • Translations
  • United States
  • United States Government

Readers

  • Linear Algebra
  • Operations Research