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

Simple item page
dc.contributor.authorTapia, R.A.
dc.contributor.authorZhang, Yin
dc.date.accessioned2018-06-18T17:29:03Z
dc.date.available2018-06-18T17:29:03Z
dc.date.issued1989-12
dc.date.noteDecember 1989
dc.format.extent13 pp
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>.
dc.identifier.digitalTR89-18
dc.identifier.urihttps://hdl.handle.net/1911/101666
dc.language.isoeng
dc.titleA Cubically Convergent Method for Locating a Nearby Vertex in Linear Programming
dc.typeTechnical report
dc.type.dcmiText
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
CAAM Technical Reports