A variant of the dual simplex method for a linear semidefinite programming problem

From MaRDI portal

(Redirected from A variant of the dual simplex method for a linear semidefinite programming problem)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_variant_of_the_dual_simplex_method_for_a_linear_semidefinite_programming_problem&oldid=73835961"