Show simple item record

dc.contributor.advisorDean N. Arden.en_US
dc.contributor.authorAbrahams, Paul W.en_US
dc.date.accessioned2020-10-09T17:23:45Z
dc.date.available2020-10-09T17:23:45Z
dc.date.copyright1956en_US
dc.date.issued1956en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/127949
dc.descriptionThesis (B.S.) Massachusetts Institute of Technology. Dept. of Mathematics, 1956.en_US
dc.descriptionBibliography: leaf 29.en_US
dc.description.statementofresponsibilityby Paul W. Abrahams.en_US
dc.format.extent39 leaves ;en_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectMathematicsen_US
dc.titleA relaxation method for linear programmingen_US
dc.typeThesisen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.identifier.oclc31524377en_US
dc.description.collectionThesis (B.S.) Massachusetts Institute of Technology. Dept. of Mathematics, 1956.en_US
dspace.imported2020-10-09T17:23:44Zen_US
mit.thesis.degreeBacheloren_US
mit.thesis.departmentMathen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record