Login / Signup

Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming.

Hirofumi FukuyamaKazuyuki Sekitani
Published in: Eur. J. Oper. Res. (2012)
Keyphrases
  • mixed integer programming
  • data envelopment analysis
  • efficient frontier
  • convex hull
  • convex sets
  • evolutionary algorithm
  • probability distribution
  • optimization problems
  • linear program
  • mixed integer