Computer experiments on quadratic programming algorithms

A. Ravindran, Harvey K. Lee

Research output: Contribution to journalArticlepeer-review

25 Scopus citations


This paper compares the computational performance of five quadratic programming algorithms. These include Wolfe's simplex method, Lemke's complementary pivot method, convex simplex method and quadratic differential algorithm. Execution time and iteration count are used as the major criteria for comparison. Since Lemke's algorithm out-performed all other methods in the study, a detailed statistical analysis was performed to determine the relative importance of problem parameters on the efficiency of Lemke's algorithm. An analysis of variance showed that the number of variables, the percent of positive linear terms in the objective, the number of constraints, and their interactions were the significant factors for both iteration count and execution time. Finally, regression equations for iteration count and execution time are derived as a function of fifteen problem parameters.

Original languageEnglish (US)
Pages (from-to)166-174
Number of pages9
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - Oct 1981

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Computer experiments on quadratic programming algorithms'. Together they form a unique fingerprint.

Cite this