Least-Index Resolution of Degeneracy in Quadratic Programming.

Abstract

This study combines least-index pivot selection rules with Keller's algorithm for quadratic programming to obtain a finite method for processing degenerate problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1978
Accession Number
ADA060821

Entities

People

  • Richard Cottle
  • Yow-yieh Chang

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematical Programming
  • Operations Research
  • Quadratic Programming
  • Simplex Method
  • United States
  • United States Government
  • Universities

Readers

  • Operations Research