Fourier–Motzkin elimination ( Linear Programming)

From Algorithm Wiki

Revision as of 09:30, 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((m/{4})$^{({2}^n)})

Space Complexity

$O((m/{4})$^{({2}^n)}) words

((can be easily derived? you have that many inequalities))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Fourier–Motzkin_elimination_(_Linear_Programming)&oldid=47293"