A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming.
Kurt MehlhornSanjeev SaxenaPublished in: CoRR (2015)
Keyphrases
- interior point methods
- linear programming
- linear program
- primal dual
- semidefinite programming
- interior point algorithm
- convex programming
- quadratic programming
- linear programming problems
- dynamic programming
- column generation
- simplex method
- np hard
- inequality constraints
- objective function
- convex optimization
- optimal solution
- nonlinear programming
- coefficient matrix
- machine learning
- semidefinite