Computer experiments on quadratic programming algorithms

Arunachalam Ravindran, Harvey K. Lee

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

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
Volume8
Issue number2
DOIs
StatePublished - Jan 1 1981

Fingerprint

Computer Experiments
Quadratic programming
Quadratic Programming
Execution Time
Count
Simplex Method
Iteration
Experiments
Quadratic Differentials
Pivot
Analysis of variance
Analysis of variance (ANOVA)
Percent
Statistical Analysis
Statistical methods
Regression
Computer experiments
Term
Interaction
Simplex method

All Science Journal Classification (ASJC) codes

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

Cite this

Ravindran, Arunachalam ; Lee, Harvey K. / Computer experiments on quadratic programming algorithms. In: European Journal of Operational Research. 1981 ; Vol. 8, No. 2. pp. 166-174.
@article{7b8aaecc86ca4752b312f80d24ae873a,
title = "Computer experiments on quadratic programming algorithms",
abstract = "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.",
author = "Arunachalam Ravindran and Lee, {Harvey K.}",
year = "1981",
month = "1",
day = "1",
doi = "10.1016/0377-2217(81)90257-5",
language = "English (US)",
volume = "8",
pages = "166--174",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

Computer experiments on quadratic programming algorithms. / Ravindran, Arunachalam; Lee, Harvey K.

In: European Journal of Operational Research, Vol. 8, No. 2, 01.01.1981, p. 166-174.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Computer experiments on quadratic programming algorithms

AU - Ravindran, Arunachalam

AU - Lee, Harvey K.

PY - 1981/1/1

Y1 - 1981/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0019625553&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019625553&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(81)90257-5

DO - 10.1016/0377-2217(81)90257-5

M3 - Article

AN - SCOPUS:0019625553

VL - 8

SP - 166

EP - 174

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -