A primal-dual simplex method for linear programs.
Norman D. CuretPublished in: Oper. Res. Lett. (1993)
Keyphrases
- simplex method
- primal dual
- linear program
- linear programming
- linear programming problems
- interior point methods
- simplex algorithm
- interior point algorithm
- interior point
- optimal solution
- semidefinite programming
- column generation
- dynamic programming
- np hard
- mixed integer
- algorithm for linear programming
- convex functions
- objective function
- integer program
- image processing
- feasible solution
- extreme points
- convex optimization
- image restoration
- dual formulation
- multi objective