A Linear bilevel Programming Problem for Obtaining the Closest Targets and Minimum Distance of a Unit from the Strong Efficient Frontier.
Gholam Reza JahanshahlooJavad VakiliMasoud ZarepishehPublished in: Asia Pac. J. Oper. Res. (2012)
Keyphrases
- minimum distance
- efficient frontier
- nearest neighbor
- data envelopment analysis
- upper bound
- multiple objective linear programming
- convex hull
- multiple criteria
- linear program
- gray level images
- distance measurement
- error correcting codes
- convex polyhedra
- decision makers
- data points
- euclidean distance
- minimum distance classifier
- multiobjective optimization
- binary images