HOW TO SOLVE LINEAR INEQUALITIES

Abstract

This paper is an attempt to solve the following constrained minimum problem: To present the most easily described algorithm for solving linear inequalities subject to the constraints, (1) The algorithm must be efficient. (2) It must be shown to terminate. The algorithm is a variant of the lexicographic simplex method which avoids using any artificial objective function.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1967
Accession Number
AD0658095

Entities

People

  • David Gale

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Computational Complexity
  • Computations
  • Equations
  • Inequalities
  • Linear Programming
  • Mathematics
  • Operations Research
  • Security
  • Simplex Method
  • United States
  • United States Government

Readers

  • Operations Research