A Cubically Convergent Method for Locating a Nearby Vertex in Linear Programming

Simple item page
dc.contributor.authorTapia, R.A.en_US
dc.contributor.authorZhang, Yinen_US
dc.date.accessioned2018-06-18T17:29:03Zen_US
dc.date.available2018-06-18T17:29:03Zen_US
dc.date.issued1989-12en_US
dc.date.noteDecember 1989en_US
dc.format.extent13 ppen_US
dc.identifier.citationTapia, R.A. and Zhang, Yin. "A Cubically Convergent Method for Locating a Nearby Vertex in Linear Programming." (1989) <a href="https://hdl.handle.net/1911/101666">https://hdl.handle.net/1911/101666</a>.en_US
dc.identifier.digitalTR89-18en_US
dc.identifier.urihttps://hdl.handle.net/1911/101666en_US
dc.language.isoengen_US
dc.titleA Cubically Convergent Method for Locating a Nearby Vertex in Linear Programmingen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR89-18.pdf
Size:
148.79 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports