A comparison of the primal-simplex and primal-dual algorithms for linear programming.
R. K. MuellerL. CooperPublished in: Commun. ACM (1965)
Keyphrases
- linear programming
- primal dual
- simplex algorithm
- interior point
- linear program
- affine scaling
- linear programming problems
- simplex method
- interior point methods
- algorithm for linear programming
- interior point algorithm
- convergence rate
- feasible solution
- semidefinite programming
- column generation
- convex optimization problems
- variational inequalities
- np hard
- optimal solution
- nonlinear programming
- dynamic programming
- approximation algorithms
- convex programming
- linear programming relaxation
- convex optimization
- integer programming
- evolutionary algorithm
- dual feasible
- learning algorithm
- convex functions
- quadratic programming
- combinatorial optimization
- higher order
- worst case
- multi objective
- special case
- objective function