Login / Signup

A simpler and tighter redundant Klee-Minty construction.

Eissa NematollahiTamás Terlaky
Published in: Optim. Lett. (2008)
Keyphrases
  • simplex method
  • upper bound
  • linear programming
  • lower bound
  • data sets
  • highly redundant
  • case study
  • objective function
  • column generation