An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points.
Ami ArbelPublished in: Comput. Oper. Res. (1997)
Keyphrases
- linear programming
- primal dual
- algorithm for linear programming
- np hard
- dynamic programming
- simplex algorithm
- affine scaling
- interior point algorithm
- multi objective
- linear programming problems
- convergence rate
- optimal solution
- linear program
- objective function
- interior point methods
- approximation algorithms
- optimization algorithm
- simplex method
- computational complexity
- learning algorithm
- semidefinite programming
- particle swarm optimization
- infeasible interior point
- convex hull
- variational inequalities
- interior point
- convex optimization
- worst case
- dual formulation
- valid inequalities
- convex programming
- evolutionary algorithm