A Class of Linear Programs Solvable by Coordinate-wise Minimization.
Tomás DlaskTomás WernerPublished in: CoRR (2020)
Keyphrases
- linear program
- convex functions
- linear programming
- np hard
- objective function
- simplex method
- stochastic programming
- semi infinite
- multistage stochastic
- special case
- primal dual
- column generation
- extreme points
- integer program
- optimal solution
- interior point methods
- mixed integer linear program
- linear programming problems
- mixed integer
- dynamic programming
- computational complexity
- linear inequalities
- strongly polynomial
- inventory routing
- interior point
- nelder mead