A comparison of some solution methods for solving quadratic programs
Date
6-1994
Degree
Bachelor of Science in Applied Mathematics
College
College of Arts and Sciences (CAS)
Adviser/Committee Chair
Norberto R. Navarrete Jr.
Abstract
Five methods, a) Beale's Hill-Climbing Technique, b) Hildreth's Asymptotic Method, c) Houthakker's Capacity Method, d) Theil-Van de Panne's Combinatorial Approach and e) Lemke's LCP Algorithm were compared in terms of their efficiency by solving statistically designed randomly-generated problems. Lemke's LCP Method was found to be the most efficient in solving strictly positive definite OP problems.
Language
English
Location
UPLB Main Library Special Collections Section (USCS)
Call Number
Thesis
Recommended Citation
Rebulanan, Dennis Marcelo V., "A comparison of some solution methods for solving quadratic programs" (1994). Undergraduate Theses. 10123.
https://www.ukdr.uplb.edu.ph/etd-undergrad/10123
Document Type
Thesis