Iterative Solution of Linear Programs

Simple item page
dc.contributor.authorMangasarian, Olvien_US
dc.date.accessioned2012-03-15T16:28:41Z
dc.date.available2012-03-15T16:28:41Z
dc.date.created1978en_US
dc.date.issued1978
dc.description.abstractBy 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR327
dc.identifier.urihttp://digital.library.wisc.edu/1793/58096
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleIterative Solution of Linear Programsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR327.pdf
Size:
1.48 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports