COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING

Abstract

Problems of the form: Find w and z satisfying w = q + Mz, w = or > 0, z = or > 0, zw = 0 play a fundamental role in mathematical programming. This paper describes the role of such problems in linear programming, quadratic programming and bimatrix game theory and reviews the computational procedures of Lemke and Howson, Lemke, and Dantzig and Cottle.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1967
Accession Number
AD0653874

Entities

People

  • George Bernard Dantzig
  • Richard Cottle

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Contracts
  • Convex Programming
  • Equations
  • Game Theory
  • Inequalities
  • Iterations
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Operations Research
  • Quadratic Programming
  • Security
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Theoretical Analysis.