SIMPLICIAL METHODS FOR QUADRATIC PROGRAMMING,

Abstract

The article is concerned with two closely related quadratic programming methods, the Simplex and the dual method for quadratic programming. Though a self-contained exposition of both methods is given, the article is concentrated on proofs of convergence of these methods and the properties of the Simplex tableaux. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1964
Accession Number
AD0622037

Entities

People

  • Andrew Whinston
  • C. Van De Panne

Organizations

  • University of Birmingham

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Convergence
  • Logistics
  • Military Research
  • Quadratic Programming

Fields of Study

  • Mathematics

Readers

  • Operations Research