A Decomposition Method for Structured Linear and Non-Linear Programs

Simple item page
dc.contributor.authorGrigoriadis, M.D.en_US
dc.contributor.authorRitter, K.en_US
dc.date.accessioned2012-03-15T16:15:37Z
dc.date.available2012-03-15T16:15:37Z
dc.date.created1968en_US
dc.date.issued1968
dc.description.abstractA decomposition method for non-linear programming problems with structured linear constraints is described. The structure of the constraint matrix is assumed to be block diagonal with a few coupling constraints and/or variables. The method is further specialized for linear objective functions. An algorithm for performing post optimality analysis - ranging and parametric programming - for such structured linear programs is included. Some computational experience and results for the linear case are presented.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR10
dc.identifier.urihttp://digital.library.wisc.edu/1793/57472
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleA Decomposition Method for Structured Linear and Non-Linear Programsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

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

Collections

CS Technical Reports