Login / Signup

A redundant Klee-Minty construction with all the redundant constraints touching the feasible region.

Eissa NematollahiTamás Terlaky
Published in: Oper. Res. Lett. (2008)
Keyphrases
  • simplex method
  • constraint programming
  • highly redundant
  • machine learning
  • input image
  • linear programming
  • global constraints