On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method.
María D. González-LimaRichard A. TapiaRobert M. ThrallPublished in: Ann. Oper. Res. (1996)
Keyphrases
- primal dual
- linear programming problems
- interior point methods
- linear programming
- linear program
- convex optimization
- interior point algorithm
- simplex algorithm
- interior point
- optimal solution
- search direction
- feasible solution
- approximation algorithms
- convergence rate
- variational inequalities
- semidefinite programming
- multiple objectives
- computationally intensive
- worst case
- learning algorithm
- evolutionary algorithm
- np hard
- natural images
- image restoration
- mixed integer
- metaheuristic
- solving problems
- hyperplane