A New Method for Solving Linear Inequalities.

Abstract

This paper describes a new method for finding nontrivial solutions of the inequality Ax > or = 0, where A is an mxn matrix of rank n. The method is based on the observation that a certain function f has a unique minimum if and only if the inequality fails to have a nontrivial solution. Moreover, if there is a solution, the direction of divergence of an attempt to minimize f will converge to a solution. The technique can also be used to solve inhomogeneous inequalities and hence linear programming problems, although no claims are made about competitiveness with existing methods.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1980
Accession Number
ADA094232

Entities

People

  • Gilbert W. Stewart

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computer Science
  • Computers
  • Coordinate Systems
  • Inequalities
  • Iterations
  • Linear Programming
  • Maryland
  • Military Research
  • New York
  • Numerical Analysis
  • Observation
  • Random Variables
  • Sequences
  • Universities

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Economics
  • Linear Algebra