My UW | UW Search

   
   

Computer Science Home Page
 
 
 
Computer Sciences Dept.

Iterative Solution of Linear Programs

Olvi Mangasarian
1978

By perturbing a linear program to a quadratic program it is possible to solve the latter in its dual variable space by iterative techniques such as successive over-relaxation (SOR) methods. This provides a solution to the original linear program.

Download this report (PDF)

Return to tech report index

 
Computer Science | UW Home

Feedback or content questions: send email to "pubs" at the cs.wisc.edu server
Technical or accessibility issues: lab@cs.wisc.edu
Copyright © 2002, 2003, 2004, 2005, 2006, 2007  The Board of Regents of the University of Wisconsin System.