Accession Number:

AD0658095

Title:

HOW TO SOLVE LINEAR INEQUALITIES

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1967-07-01

Pagination or Media Count:

22.0

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.

Subject Categories:

  • Theoretical Mathematics
  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE