Login / Signup

An Upper Bound for the Number of Different solutions Generated by the Primal Simplex Method with any Selection Rule of entering Variables.

Tomonari KitaharaShinji Mizuno
Published in: Asia Pac. J. Oper. Res. (2013)
Keyphrases
  • upper bound
  • simplex method
  • linear programming
  • linear program
  • lower bound
  • least squares
  • objective function
  • optimal solution
  • simplex algorithm
  • support vector
  • np hard
  • random variables