EXTENSIONS OF A THEOREM BY CLARK

Abstract

IF A LINEAR PROGRAMMING PROBLEM (written in inequality form) has a solution, then either the primal constraint set or the dual constraint set is unbounded. The parenthetical remark is our addition to he statement of the theorem, but is implicitly assumed. The inequality form of the general linear programming problem is s metimes referred to as the canonical form and used as a standard point of departure for further analyses. Yet some care may be needed, as is true here, ifA FULL DEGREE OF GENERALITY AND UNDERSTANDING IS TO BE ACHIEVED.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 13, 1961
Accession Number
AD0269006

Entities

People

  • A. Charnes
  • G. L. Thompson
  • W. W. Cooper

Organizations

  • Northwestern University

Tags

DTIC Thesaurus Topics

  • Computations
  • Computer Programming
  • Contracts
  • Equations
  • Government Procurement
  • Governments
  • Inequalities
  • Linear Programming
  • Mathematics
  • Military Research
  • Procurement
  • Standards
  • United States
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Theoretical Analysis.