| dc.contributor | Tseng, Paul. | en_US |
| dc.contributor | Bertsekas, Dimitri P. | en_US |
| dc.date.accessioned | 2003-04-29T15:27:03Z | |
| dc.date.available | 2003-04-29T15:27:03Z | |
| dc.date.issued | 1986 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/2936 | |
| dc.description | Bibliography: p. 25-26. | en_US |
| dc.description.sponsorship | National Science Foundation grant NSF-ECS-3217668 | en_US |
| dc.description.statementofresponsibility | by Paul Tseng, Dimitri P. Bertsekas. | en_US |
| dc.format.extent | 26 p. | en_US |
| dc.format.extent | 1142928 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] | en_US |
| dc.relation.ispartofseries | LIDS-P ; 1567 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.1567 | en_US |
| dc.title | Relaxation methods for problems with strictly convex separable costs and linear constraints | en_US |
