Login / Signup

Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.

Michael J. ToddYinyu Ye
Published in: Math. Program. (1998)
Keyphrases
  • stopping rules
  • linear programming
  • computationally expensive
  • computational complexity
  • dynamic programming
  • optimization problems
  • learning algorithm
  • decision trees
  • linear program