An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

From MaRDI portal

(Redirected from An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution)

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=An_infeasible-start_algorithm_for_linear_programming_whose_complexity_depends_on_the_distance_from_the_starting_point_to_the_optimal_solution&oldid=71155038"