Using DEA to obtain efficient solutions for multi-objective 0-1 linear programs.
Fuh-Hwa Franklin LiuChueng-Chiu HuangYu-Lee YenPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- linear program
- efficient solutions
- multi objective
- bi objective
- optimal solution
- linear programming
- objective function
- pareto optimal solutions
- efficient frontier
- data envelopment analysis
- bicriteria
- semi infinite
- multi objective optimization
- optimization algorithm
- simplex method
- extreme points
- evolutionary algorithm
- interior point methods
- primal dual
- heuristic methods
- linear programming problems
- nsga ii
- multiple objectives
- column generation
- mixed integer
- particle swarm optimization
- np hard
- integer program
- stochastic programming
- pareto optimal
- multiobjective optimization
- multi criteria
- set covering problem
- linear inequalities
- genetic algorithm
- feasible solution
- dynamic programming
- lower bound
- knapsack problem
- cost function
- neural network
- convex functions
- branch and bound algorithm
- branch and bound
- interior point
- search space
- minimum cost flow
- mixed integer linear program