An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming.
Serpil SayinPublished in: Oper. Res. Lett. (1996)
Keyphrases
- multiple objective linear programming
- decomposition algorithm
- pruning strategy
- computational complexity
- convex hull
- dynamic programming
- objective function
- method finds
- optimal solution
- efficient solutions
- min max
- decomposition method
- learning algorithm
- linear programming
- optimization algorithm
- simulated annealing
- face images
- denoising