Simplex Algorithm ( Linear Programming)

From Algorithm Wiki
Revision as of 08:33, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^n*poly(n, m))$

Space Complexity

$O(nm)$ words

(can be easily derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1947

Reference

-